Question: Linear Programming Problem, please show the iterations. Max z=35x 1 +10x 2 +48x 3 +10x 4 s.t. 5x 1 +8x 3 -5x 4 8 7x
Linear Programming Problem, please show the iterations.
Max z=35x1+10x2+48x3+10x4 s.t. 5x1+8x3-5x4 8 7x1+x2+6x3+2x4 3 x1, x2, x3, x4 0
(1) Use the revised simplex method to solve the LP. (2) Convert the problem into its dual form and determine its shadow prices. (3) Find the range of the objective function coefficient of x2 for which the current basis remains optimal. (4) Find the range of the right hand side of the first constraint for which the current basis remains optimal.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
