CMA Intermediate · Operations Management and Strategic Management · Optimum Allocation of Resources - LPP
In the graphical method of solving a two-variable linear programming problem, the set of all points that satisfy every constraint, including non-negativity, is called the:
The set of points satisfying all constraints and the non-negativity conditions is called the feasible region. Every feasible solution lies inside or on its boundary, and the optimal solution of a linear programming problem is found at one of its corner points.
- AFeasible regionCorrect
- BIso-profit region
- CSlack region
- DDual region
Explanation
The area where all constraints hold simultaneously is the feasible region (solution space). The optimum is searched for within it. Iso-profit lines are lines of equal profit, not the constraint-satisfying area.
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 a maximisation simplex table, the Cj − Zj row reads: x1 = 5, x2 = 8, s1 = 0, s2 = −2. Which variable should enter the basis and is the so…
- 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…