Question

Use the simplex method to solve the linear programming problem. The maximum is ___ when x1= ___ and x2=___

a.)

Maximize : z= 24x1+2x2

Subject to: 6x1+3x2<=10, x1+4x2<=3

With: x1>=0, x2>=0

b.)

Maximize: z=2x1+7x2

Subject to: 5x1+x2<=70, 7x1+2x2<=90, x1+x2<=80

With: x1,x2>=0

c.)

Maximize: z=x1+2x2+x3+5x4

Subject to: x1+3x2+x3+x4<=55, 4x+x2+3x3+x4<=109

With: x1>=0, x2>- 0, x3>=0, x4>=0

d.)

Maximize: z=4x1+7x2

Subject to: x1-4x2<=35 , 4x1-3x2<=21

With: x1>=0, x2>=0

Answer 1