Question: Use the simplex algorithm to find the optimal solution to the following LP: maxz=36x1 +30x2 3x3 4x4 s.t. x1+x2 x3 <5 6x1 +5x2 x4 <10

Use the simplex algorithm to find the optimal solution to the following LP: 

maxz=36x1 +30x2 –3x3 –4x4

s.t.

x1+x2 –x3<5

6x1 +5x2 –x4 <10 

∀xi > 0

Step by Step Solution

3.46 Rating (166 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

Problem is Max Z 36 x1 30 x2 3 x3 4 x4 subject to x1 x2 x3 5 6 x1 5 x2 x4 10 and x1x2x3x40 The probl... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Mechanical Engineering Questions!

Related Book