Chapter 6 Q8

Formulate this problem as a linear programming model and solve it by using the computer.
The route from Chicago to Miami is prohibited, therefore a higher cost M = 100 is assign to
the route in between Chicago and Miami
Minimize Z = 9xTN + 14xTP + 12xTC + 17xTB + 11xMN + 10xMP + 100xMC + 10xMB +
12xFN + 8xFP + 15xFC + 7xFB
subject to
xTN + xTP + xTC + xTB 200
xMN + xMP + xMC + xMB 200
xFN + xFP + xFC + xFB 200
xTN + xMN + xFN = 130
xTP + xMP + xFP = 170
xTC + xMC + xFC = 100
xTB + xMB + xFB = 150
xij 0
Tampa - NY = 100
Tampa - Chicago = 100
Miami - NY = 30
Miami - Philadelphia = 120
Fresno - Philadelphia = 50
Fresno - Boston = 150
Z = $5,080