Question: Consider the linear programme: Max 3x+2x s.t. 1x1 +228 2x + 1x2 10 X1, X2 0 a. Solve this problem using the Simplex method. Keep
Consider the linear programme: Max 3x+2x s.t. 1x1 +228 2x + 1x2 10 X1, X2 0
a. Solve this problem using the Simplex method. Keep a record of the value of the objective function at each extreme point.
b. Formulate and solve the dual of this problem using the graphical procedure.
c. Compute the value of the dual objective function for each extreme-point solution of the dual problem.
d. Compare the values of the objective function for each primal and dual extreme-point solution.
e. Can a dual feasible solution yield a value less than a primal feasible solution? Can you state a result conceming bounds on the value of the primal solution provided by any feasible solution to the dual problem?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
