Case 1

Formulation:

y1 = 1 if a plant constructed in Detroit; 0 if not

y2 = 1 if a plant is constructed in Toledo; 0 if not

y3 = 1 if a plant is constructed in Denver; 0 if not

y4 = 1 if a plant is constructed in Kansas City; 0 if not

Minimize Z

=5x11+2x12+3x13+4x21+3x22+4X23+9x31+7x32+5x33+10x41+4x42+2x43+8x51+4x52+3x53+
175000y1+300000y2+375000y3+500000y4

Subject to,

x11+ x12+x13<= 10000y1 Detroit

x21+ x22+x23<= 20000y2 Toledo

x31+ x32+x33<= 30000y3 Denver

x41+ x42+x43<= 40000y4 Kansas City

x51+ x52+x53<= 30000 St. Louis

x11+ x21+x31+x41+x51= 30000 Boston

x21+ x22+x32+x42+x52= 20000 Atlanta

x13+ x23+x33+x43+x53= 30000 Houston

xij>=0 and integers, y1, y2, y3, y4 binary

Solution

Housto Total
Boston Atlanta n Shipped
Not
open Detroit 0 0 0 0
Not
open Toledo 0 0 0 0
Not
open Denver 0 0 0 0
Open Kansas City 0 20000 20000 40000
St. Louis 30000 0 0 30000
Total Shipped
to 30000 20000 20000 70000

Total Cost = 860000

Case 2:

Max Z = X1+X2

s.t. 3X1+2X2 <= 5

X2 <= 2

X1, X2 >= 0, and X1 is an integer

Sol-

X1 = 0

X2 = 2

Objective Function = 2