CMA Intermediate · Operations Management and Strategic Management · Optimum Allocation of Resources - LPP
A graphical LPP has constraints x + y <= 6 and x + y >= 10 with x, y >= 0. The correct conclusion is that the problem:
The two constraints contradict each other, since the sum of x and y cannot be both at most 6 and at least 10. There is no common region satisfying all constraints, so the problem has no feasible solution.
- AHas no feasible solutionCorrect
- BHas an unbounded solution
- CHas a unique optimum at the origin
- DHas multiple optimal solutions
Explanation
No point can have x+y at most 6 and at least 10 at the same time, so the constraints have no common region. Therefore the problem is infeasible.
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
- 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…
- A firm maximises profit subject to the constraints x + y <= 4 and x + y >= 9, with x, y >= 0. What does the graphical method show?
- In the graphical method of solving a two-variable linear programming problem, the set of all points that satisfy every constraint, including…
- A firm maximises Z = 40x + 30y subject to x + y <= 8, x <= 5, and x, y >= 0. What is the maximum value of Z (in rupees)?
- Sundaram Metals maximises profit Z = 5x + 4y subject to: 6x + 4y ≤ 24 (machine hours) and x + 2y ≤ 6 (labour hours), x, y ≥ 0. The optimal s…
- In a maximisation simplex table, a variable has a positive Cj − Zj, but every coefficient in its column in the constraint rows is zero or ne…