Question: ( 2 0 pts ) You are using the matrix form of Simplex method to solve the following linear programming problem. Maximize , Z =

(20 pts) You are using the matrix form of Simplex method to solve the following linear
programming problem.
Maximize ,Z=6x1+5x2-x3+4x4,
subject to
3x1+2x2-3x3+x4120
3x1+3x2+x3+3x4180
and
x10,x20,x30,x40.
You have obtained the following final simplex tableau where x5 and x6 are the slack
variables for the respective constraints.
Use the fundamental insight presented in class and also in the textbook to identify Z**,b1**, and
b2**.
 (20 pts) You are using the matrix form of Simplex method

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock 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 General Management Questions!