Question: 24. Consider the following Goal Programming model: All variables to be non-negative. The modified simplex tableau giving IBFS is shown below. Carry out the simplex
24. Consider the following Goal Programming model:

All variables to be non-negative.
The modified simplex tableau giving IBFS is shown below. Carry out the simplex iterations until an optimal solution is reached. State clearly the optimal solution and to what extent the goals have been achieved.

Minimise Subject to Z=P+d+Pd+30 Pd +40 Pd + P3d5 2x + 4x2 + dd = 80 - 3x + 3x + dd = 80 x + d-d = 10 x+dd=10 30x +40x2+ d d = 1,200 -
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
