Week 6 Extra Problem Solutions

CHAPTER 3
LINEAR PROGRAMMING: FORMULATION AND
APPLICATIONS

Problems
3.16 a) This is a distribution-network problem (transportation problem) because
it deals with the distribution of goods through a distribution network at
minimum cost.
b)

c) Let xij = number of units to ship from Factory i to Customer j (i = 1,2; j =

1, 2, 3)
Minimize Cost = $600x11 + $800x12 + $700x13 + $400x21 + $900x22 +
$600x23
subject to x11 + x12 + x13 = 400
x21 + x22 + x23 = 500
x11 + x21 = 300
x12 + x22 = 200
x13 + x23 = 400
and x11 ≥ 0, x12 ≥ 0, x13 ≥ 0, x21 ≥ 0, x22 ≥ 0, x23 ≥ 0.
3.18 a) Requirement 1: The total amount shipped from Mine 1 must be 40 tons.
Requirement 2: The total amount shipped from Mine 2 must be 60 tons.
Requirement 3: The total amount shipped to the Plant must be 100 tons.
Requirement 4: For Storage 1, the amount shipped out = the amount in.
Requirement 5: For Storage 2, the amount shipped out = the amount in.

1
b)

c) Let xM1S1 = number of units shipped from Mine 1 to Storage 1

xM1S2 = number of units shipped from Mine 1 to Storage 2
xM2S1 = number of units shipped from Mine 2 to Storage 1
xM2S2 = number of units shipped from Mine 2 to Storage 2
xS1P = number of units shipped from Storage 1 to the Plant
xS2P = number of units shipped from Storage 2 to the Plant
Minimize Cost = $2,000xM1S1 + $1,700xM1S2 + $1,600xM2S1 + $1,100xM2S2
+$400xS1P + $800xS2P
subject to xM1S1 + xM1S2 = 40
xM2S1 + xM2S2 = 60
xM1S1 + xM2S1 = xS1P
xM1S2 + xM2S2 = xS2P
xS1P + xS2P = 100
xM1S1 ≤ 30, xM1S2 ≤ 30, xM2S1 ≤ 50, xM2S2 ≤ 50, xS1P ≤ 70, xS2P ≤ 70
and xM1S1 ≥ 0, xM1S2 ≥ 0, xM2S1 ≥ 0, xM2S2 ≥ 0, xS1P ≥ 0, xS2P ≥ 0.

2
 CHAPTER 15
TRANSPORTATION AND ASSIGNMENT PROBLEMS

Problems
15.7
Algebraic Formulation

Let xij be the number of acres of i produced by country j (in millions of acres)
i: w - wheat j: e - England
b - barley f - France
o - oats s - Spain

objective function:
min cost = [18 * $9.00]xwe + [13 * $7.20]xwf + [16 * $9.90]xws
+ [15 * $8.10]xbe + [12 * $9.00]xbf + [12 * $8.40]xbs
+ [12 * $6.90]xoe + [10 * $7.50]xof + [16 * $6.30]xos

s.t.

xwe + xwf + xws = 125 [world demand for wheat]

xbe + xbf + xbs = 60 [world demand for barley]
xoe + xof + xos = 75 [world demand for oats]

xwe + xbe + xoe = 70 [land available in England]

xwf + xbf + xof = 110 [land available in France]
xws + xbs + xos = 80 [land available in Spain]

xij >= 0 for all i, j

NOTE: Total Demand = 125 + 60 + 75 = 260

Total Supply = 70 + 110 + 80 = 260
Thus this is a balanced Transportation Problem, all the constraints will be equality.

3
 A B C D E F G
1 Labor Hours / Acre
2 Wheat Barley Oats
3 England 18 15 12
4 France 13 12 10
5 Spain 16 12 16
6
7
8 Labor Cost / Hour
9 Wheat Barley Oats
10 England $9.00 $8.10 $6.90
11 France $7.20 $9.00 $7.50
12 Spain $9.90 $8.40 $6.30
13
14
15 Cost/Acre
16 Wheat Barley Oats
17 England $162.00 $121.50 $82.80
18 France $93.60 $108.00 $75.00
19 Spain $158.40 $100.80 $100.80
20
21
22 Land Allocation (millions of acres)
23 Wheat Barley Oats Total Supply
24 England 0 0 70 70 = 70
25 France 110 0 0 110 = 110
26 Spain 15 60 5 80 = 80
27 Total 125 60 75
28 = = = Total Cost ($millions)
29 Demand 125 60 75 25,020

4
15.15
Algebraic Formulation

Let xij be the amount of widgets produced in regular time in week i shipped in week j
i = 1, 2, 3 j = 1, 2, 3

Let yij be the amount of widgets produced in overtime in week i shipped in week j
i = 1, 2, 3 j = 1, 2, 3

Let zi be the amount of widgets in storage at the beginning of week 1 shipped in

week i
i = 1, 2, 3

objective function:

Min cost = 300x11 + 350x12 + 400x13 + 500x22 + 550x23 + 400x33

+ 400y11 + 450y12 + 500y13 + 600y22 + 650y23 + 500y33 + 0z1 + 50z2 + 100z3

s.t.
x11 + x12 + x13 =< 2 [max production reg. time week 1]
x22 + x23 =< 3 [max production reg. time week 2]
x33 =< 1 [max production reg. time week 3]

y11 + y12 + y13 =<2 [max production overtime week 1]

y22 + y23 =< 2 [max production overtime week 2]
y33 =< 2 [max production overtime week 3]

z1 + z2 + z3 = 2

x11 + y11 + z1 = 3 [demand for week 1]

x12 + x22 + y12 + y22 + z2 = 3 [demand for week 2]
x13 + x23 + x33 + y13 + y23 + y33 + z3 = 3 [demand for week 3]

xij >= 0, yij >=0, zi >= 0 for all i, j

5
 A B C D E F G H
1 Production Cost
2 Regular Overtime
3 Week 1 $300 $400
4 Produced 2 $500 $600
5 3 $400 $500
6
7 Storage Cost / Week $50
8
9
10 Unit Cost Month Shipped (Product 1)
11 1 2 3
12 Start $0 $50 $100
13 RT1 $300 $350 $400
14 Month OT1 $400 $450 $500
15 Produced RT2 Š $500 $550
16 OT2 Š $600 $650
17 RT3 Š Š $400
18 OT3 Š Š $500
19
20
21 Shipments Week Shipped
22 1 2 3 Total Shipped Capacity
23 Start 2 0 0 2 = 2
24 RT1 0 2 0 2 <= 2
25 Month OT1 1 1 0 2 <= 2
26 Produced RT2 0 0 0 0 <= 3
27 OT2 0 0 0 0 <= 2
28 RT3 0 0 1 1 <= 1
29 OT3 0 0 2 2 <= 2
30 Total Received 3 3 3
31 = = = Total Cost
32 Demand 3 3 3 $2,950

6
15.20

a) This problem fits as an assignment problem with ships as assignees and

ports as assignments.
b)
Unit Cost Port
1 2 3 4
1 $500 $400 $600 $700
Ship 2 $600 $600 $700 $500
3 $700 $500 $700 $600
4 $500 $400 $600 $600

Assignments Port Total

1 2 3 4 Assignments Supply
1 0 1 0 0 1 = 1
Ship 2 0 0 0 1 1 = 1
3 0 0 1 0 1 = 1
4 1 0 0 0 1 = 1
Total Assigned 1 1 1 1
= = = = Total Cost
Demand 1 1 1 1 $2,100

Double click on the excel spreadsheet above to check out the formulas for the
objective function (i.e. Total Cost), and contstraints.(i.e. Total
Assignments and Total Assigned).