CMA Intermediate · Operations Management and Strategic Management · Optimum Allocation of Resources - LPP
In a simplex iteration, x1 is the entering variable. Its column coefficients in three constraint rows are 4, 5 and −3, with corresponding RHS values 24, 20 and 9. Which row's basic variable leaves the basis?
The basic variable in row 2 leaves the basis. The minimum ratio test uses only positive coefficients in the entering column: 24/4 = 6 and 20/5 = 4. The row with a negative coefficient is ignored, and the smallest ratio, 4, identifies row 2.
- ARow 2, with ratio 4Correct
- BRow 1, with ratio 6
- CRow 3, with ratio −3
- DRow 3, because its RHS is the smallest
Explanation
The minimum ratio test divides RHS by positive entering-column coefficients only. Row 1 gives 24/4 = 6 and row 2 gives 20/5 = 4. Row 3 has a negative coefficient and is ignored. The smallest ratio is 4, so the row 2 basic variable leaves. Picking row 3 because of its small RHS ignores the rule.
Did you get it right without looking?
One question tells you little. A timed set on Optimum Allocation of Resources - LPP shows your real accuracy, how long you take and where you lose marks.
More Optimum Allocation of Resources - LPP questions
- Which of the following is a basic assumption of linear programming?
- In a maximisation linear programming problem with three structural constraints (all of the ≤ type) and two decision variables, the dual prob…
- By the complementary slackness property of duality, if a primal constraint has positive slack (unused resource) at the optimal solution, the…
- In the graphical solution of a maximisation LPP, the feasible region is found to be unbounded in the direction of increasing objective value…
- In a graphical LPP, a redundant constraint is best described as one that
- In a graphical LPP, the objective function is maximised and its iso-profit line is moved parallel to itself away from the origin. The optimu…