CMA Intermediate · Operations Management and Strategic Management · Optimum Allocation of Resources - LPP
In a maximisation linear programming problem with three structural constraints (all of the ≤ type) and two decision variables, the dual problem will have:
The dual has three variables and two constraints, because every primal constraint corresponds to one dual variable and every primal decision variable corresponds to one dual constraint. Three primal constraints give three dual variables, and two primal variables give two dual constraints.
- ATwo variables and three constraints
- BThree variables and two constraintsCorrect
- CThree variables and three constraints
- DTwo variables and two constraints
Explanation
Each primal constraint gives one dual variable and each primal variable gives one dual constraint. With three primal constraints and two primal variables, the dual has three variables and two constraints. Option A reverses the mapping.
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:…
- 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…
- Which of the following is a basic assumption of linear programming?