a.

Draw the network model

b. Write the LP model
c. Determine the quantities to be shipped to the various customers.

Answer:

SELLER ATLANTA DALLAS COLUMBUS BOSTON TOTAL

X3 X4 X5 X6 SUPPLY
PHILADELPHIA 2 6 6 2 5000
X1
NEW 1 2 5 7 3000
ORLEANS
X2
TOTAL 1400 3200 2000 1400
DEMAND
Xij =number of goods shipped from port I to customer j
i= 1,2
j= 1,2,3,4
Objective function
Min Z = 2X11+6X12+6X13+2X14+1X21+2X22+5X23+7X24
Supplier:
1.       X11+X12+X13+X14 =5000
2.      X21+X22+X23+X24 =3000
Demands:
1)     X11+X21 =1400
2)     X12+X22 =3200
3)     X13+X23 =2000
4)     X14+X24 =1400
Non-negativity constraint:
Xij≥ 0
i= 1,2, j= 1,2,3,4
a. Develop a linear programming model for this problem; be sure to define the variables in
your model.
Nodes from 1 to 5
Jefferson City: node 1
Omaha: node 2
Des Moines: node 3
Kansas City: node 4
St. Louis: node 5

Decision variables:
Let x11 be the amount shipped from Jefferson City to Des Moines
Let x12 be the amount shipped from Jefferson City to Kansas City

Transportation cost for units shipped from Jefferson City

14x11 + 9x12 + 7x13

Transportation cost for units shipped from Omaha

8x21 + 10x22 + 5x23

Total transportation costs:

14x11 + 9x12 + 7x13 + 8x21 + 10x22 + 5x23

Constraints:
Total units shipped from Jefferson City x11 + x12 + x13
x11 + x12 + x13 ≤ 30

Total units shipped from Omaha

x21 + x22 + x23 ≤ 20

Demand Constraints:
Total units supplied to Des Moines x11 + x21
x11 + x21 = 25

Total units supplied to Kansas x12 + x22

X12 + x22 = 15

Total units supplied to St. Louis

X13 + x23 = 10

LP Model:
Minimize 14x11 + 9x12 + 7x13 + 8x21 + 10x22 + 5x23
s.t.
x11 + x12 + x13 ≤ 30
X21 + x22 + x23 ≤ 20
x11 + x21 = 25
X12 + x22 = 15
X13 + x23 = 10
x11, x12, x13, x21, x22, x23, ≥ 0

b. Solve the linear program to determine the optimal solution.

Optimal Solution
x11 = 5
x12 = 15
x13 = 10
x21 = 20
x22 = 0
x23 = 0
Objective Function Value
= 435
Objective Function Calculation
14(5) + 9(15) + 7(10) + 8(20) + 10(0) + 5(0) 70 + 135 + 70 + 160 + 0 + 0
= 435

C. What will be the quantities shipped and the transportation cost if the Omaha – St Louis
route is classed.

DESTINATION
ORIGIN DEN MOINES KANSAS CITY ST LOUIS SUPPLY
JEFFERSON 14 9 7 30
CITY
OMAHA 8 10 5 20
DEMAND 25 15 10

QUANTITY SHIPPED

ORIGIN DEN MOINES KANSAS CITY ST LOUIS

JEFFERSON 5 15 10
CITY
OMAHA 20 0 0

MINIMIZE COST

COST 435

OPTIMAL SOLUTION

ORIGIN DEN MOINES KANSAS CITY ST LOUIS

JEFFERSON 5 15 10
 CITY
OMAHA 20 0 0