CMA Intermediate · Operations Management and Strategic Management · Optimum Allocation of Resources - LPP
Which of the following is a basic assumption of linear programming?
Linear programming assumes that the objective function and constraints are linear, with proportionality and additivity of contributions. Per-unit profit must stay constant, variables are non-negative, and resources are limited, which is why the other statements are incorrect.
- AProfit per unit changes with the volume produced
- BDecision variables can take only negative values
- CObjective function and constraints are linear, with proportionality and additivityCorrect
- DResources are unlimited
Explanation
LP assumes linearity: contributions are proportional to variable levels and additive across variables. Variable per-unit profit violates proportionality, negative-only variables contradict non-negativity, and unlimited resources would remove the need for constraints.
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 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…
- In a simplex iteration, x1 is the entering variable. Its column coefficients in three constraint rows are 4, 5 and −3, with corresponding RH…
- A graphical LPP has constraints x + y <= 6 and x + y >= 10 with x, y >= 0. The correct conclusion is that the problem:
- Maximise Z = 40x1 + 30x2 subject to x1 + x2 ≤ 80, 2x1 + x2 ≤ 100, x1, x2 ≥ 0, using the simplex method. What is the optimal value of Z?