Question: Need a and b a) use simplex method to show it has no feasible solution maximize z=4x1+5x2+3x3 subjet to; x1+x2+2x3 >=20 15x1+6x2-5x3
Need a and b
a) use simplex method to show it has no feasible solution
maximize z=4x1+5x2+3x3
subjet to;
x1+x2+2x3 >=20
15x1+6x2-5x3 <=50
x1+3x2+5x3 <=30
x1,x2,x3 >=0
b) show that the following linear programming problem is temporally degenerate
minimize z=2x1+2x2
subject to:
4x1+3x2 <=12
4x1+x2 <=8
4x1-x2 <=8
x1,x2 >=0
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
