R SESSION

Question 1. (Linear Programming)

Coalco produces coal at three mines and ships it to four customers. The cost per ton of producing coal, the
ash and sulfur content (per ton) of the coal, and the production capacity (in tons) for each mine are given in
Table 16. The number of tons of coal demanded by each customer are given in Table 17. The cost (in dollars)
of shipping a ton of coal from a mine to each customer is given in Table 18. It is required that the total
amount of coal shipped contain at most 5% ash and at most 4% sulfur. Formulate an LP that minimizes the
cost of meeting customer demands.

𝑥𝑖𝑗 = 𝑡𝑜𝑛𝑠 𝑜𝑓 𝑐𝑜𝑎𝑙 𝑝𝑟𝑜𝑑𝑢𝑐𝑒𝑑 𝑎𝑡 𝑚𝑖𝑛𝑒 𝑖 𝑎𝑛𝑑 𝑠ℎ𝑖𝑝𝑝𝑒𝑑 𝑡𝑜 𝑐𝑢𝑠𝑡𝑜𝑚𝑒𝑟 𝑗

𝑀𝑖 = 𝑡𝑜𝑛𝑠 𝑜𝑓 𝑐𝑜𝑎𝑙 𝑝𝑟𝑜𝑑𝑢𝑐𝑒𝑑 𝑎𝑡 𝑚𝑖𝑛𝑒 𝑖

𝑀𝑖𝑛 𝑧 = 50𝑀1 + 55𝑀2 + 62𝑀3 + 4𝑥11 + 6𝑥12 + ⋯ + 5𝑥34

s.t.

𝑀1 = 𝑥11 + 𝑥12 + 𝑥13 + 𝑥14

𝑀2 = 𝑥21 + 𝑥22 + 𝑥23 + 𝑥24
𝑀3 = 𝑥31 + 𝑥32 + 𝑥33 + 𝑥34
𝑀1 ≤ 120
𝑀2 ≤ 100
𝑀3 ≤ 140
𝑥11 + 𝑥21 + 𝑥31 ≥ 80
𝑥12 + 𝑥22 + 𝑥32 ≥ 70
𝑥13 + 𝑥23 + 𝑥33 ≥ 60
𝑥14 + 𝑥24 + 𝑥34 ≥ 40
0.08𝑀1 + 0.06𝑀2 + 0.04𝑀3 ≤ 0.05(𝑀1 + 𝑀2 + 𝑀3 )
0.05𝑀1 + 0.04𝑀2 + 0.03𝑀3 ≤ 0.04(𝑀1 + 𝑀2 + 𝑀3 )
𝑥𝑖𝑗 ≥ 0 ∀𝑎𝑙𝑙 𝑖, 𝑗
𝑀𝑖 ≥ 0 ∀𝑎𝑙𝑙 𝑖
Question 2. (Linear Programming)
A family of farmers owns 100 acres of land and has 15000 money units (mu) in funds available for
investment. The members of the family can produce a total of 3500 man-hours of labor during the winter
months and 4000 man-hours during the summer. If any of this labor hours is not needed on the farm, younger
members of the family will use them to work on a neighboring farm for 1.80 mu/hour during the winter
months and 2.10 mu/hour during the summer. Cash income can be obtained from planting three types of
crop; soybeans, corn and oats; and from raising two types of livestock; cows and chickens. No investment
is needed for the crops; however each cow requires an investment of 400 mu and each chicken will require
3 mu. Furthermore each cow will also require 1.5 acres of land, 100 man-hours of labor during winter, and
another 50 man-hours during the summer. The annual net cash income from a cow is expected to be 400
mu. The corresponding figures for a chicken are; no land, 0.6 man-hours during winter, 0.3 man-hours
during summer, and an annual income of 2 mu. The chicken house has capacity for 3000 chickens, and the
barn for 32 cows. The family wants to plant at least 60 acres with the three crops. Labor requirements and
estimated income for each acre planted in each of the three crops are given in the following table:
Soybeans Corn Oats
Winter man-hours 20 35 10
Summer man-hours 50 75 40
Net cash income (mu) 175 300 120

The family wishes to determine how many acres they should plant in each of the three crops and how many
cows and chickens they should keep in order to maximize net cash income.

Soy/Corn/Oat: Number of acres planted in soy/corn/oat

Cow/Chic: Number of cows/chickens raised
ExtraW/ExtraS: number of hours worked in the neighboring farm in the winter/summer

Max 175 Soy + 300 Corn + 120 Oat + 400 Cow + 2 Chic + 1.8 ExtraW + 2.1 ExtraS
s.t.

Soy + Corn + Oat + 1.5Cow ≤ 100 Land

Soy + Corn + Oat ≥ 60 MinAcres
400 Cow + 3 Chic ≤ 15000 Funds
20Soy + 35Corn + 10 Oat + 100Cow + 0.6Chic + ExtraW = 3500 LabrW
50 Soy + 75Corn + 40 Oat + 50Cow + 0.3 Chic + ExtraS = 4000 LabrS
Cow ≤ 32 Barn
Chic ≤ 3000 ChicHous
All variables are non-negative
Question 3. (Integer Programming)
There are six cities (cities 1–6) in Kilroy County. The county must determine where to build fire stations.
The county wants to build the minimum number of fire stations needed to ensure that at least one fire station
is within 15 minutes (driving time) of each city. The times (in minutes) required to drive between the cities
in Kilroy County are shown in the table. There are two restrictions: No more than two stations can be built
in the first four cities; and either a station is built in both City 5 and 6, or no stations are built in those cities.
Formulate an IP that will tell Kilroy how many fire stations should be built and where they should be located.

1 𝑖𝑓 𝑎 𝑠𝑡𝑎𝑡𝑖𝑜𝑛 𝑖𝑠 𝑏𝑢𝑖𝑙𝑡 𝑖𝑛 𝑐𝑖𝑡𝑦 𝑖

𝑥𝑖 = {
0 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒
6

𝑀𝑖𝑛 𝑧 = ∑ 𝑥𝑖
𝑖=1

𝑥1 + 𝑥2 ≥ 1
𝑥1 + 𝑥2 + 𝑥6 ≥ 1
𝑥3 + 𝑥4 ≥ 1
𝑥3 + 𝑥4 + 𝑥5 ≥ 1
𝑥4 + 𝑥5 + 𝑥6 ≥ 1
𝑥2 + 𝑥5 + 𝑥6 ≥ 1
𝑥1 + 𝑥2 + 𝑥3 + 𝑥4 ≤ 2
𝑥5 = 𝑥6
𝑥𝑖 ∈ {0,1}