CMA Intermediate · Operations Management and Strategic Management · Optimum Allocation of Resources - LPP
In the graphical solution of a maximisation LPP, the feasible region is found to be unbounded in the direction of increasing objective value, with no constraint limiting it. What is this special case called?
This is an unbounded solution. The feasible region extends indefinitely in the direction of improving the objective, so the objective value can grow without limit. It differs from infeasibility, where no point satisfies all constraints, and from multiple optima, where several points give the same finite best value.
- AInfeasibility
- BUnbounded solutionCorrect
- CAlternative optima
- DDegeneracy
Explanation
If the objective function can be increased indefinitely while staying in the feasible region, the problem has an unbounded solution. Infeasibility means no feasible region exists at all, which is not the case here. Alternative optima requires the objective line to be parallel to a binding constraint, and degeneracy involves redundant binding constraints at a vertex.
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
- A firm maximises Z = 5x + 4y subject to x + y <= 10, x <= 6, and x, y >= 0. What is the optimal value of Z?
- A company must produce at least 60 units in total of products A and B (x + y >= 60), and at most 40 units of A (x <= 40). Cost is minimised:…
- Which of the following is a basic assumption of linear programming?
- Maximise Z = 4x + 6y subject to 2x + 3y <= 12, x <= 5, x, y >= 0. Which statement is correct?
- Sharma Furnitures makes tables (x) and chairs (y). A table needs 4 hours of carpentry and a chair needs 2 hours; 240 carpentry hours are ava…
- In converting a maximisation LPP with all constraints of the '≤' type into the standard form for the simplex method, what is added to each c…