Question: IF YOU SOLVE IT CORRECTLY I WILL GIVE YOU THUMBS UP. IF YOU PUT SCREENSHOTS OF A CALCULATOR AS A ANSWER I WILL REPORT YOU


IF YOU SOLVE IT CORRECTLY I WILL GIVE YOU THUMBS UP. IF YOU PUT SCREENSHOTS OF A CALCULATOR AS A ANSWER I WILL REPORT YOU FROM ABUSE.
4. (30 points) Consider the following linear programming problem and its optimal final tableau shown below. max 2 = 2.21 +22 - 13 s.t. X1 + 2x2 + x3 0 24 25 2 0 Z Z 21 10 0 1 0 0 22 23 3 3 2 1 3 -1 RHS 16 8 12 21 1 1 0 1 25 (d) (10 points) Suppose that the following constraint is added to the problem: 22+x3 = 3. Is the solution still optimal? If not, find the new optimal solution using dual simplex algorithmStep by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
