CMA Intermediate · Operations Management and Strategic Management · Optimum Allocation of Resources - LPP
In converting a maximisation LPP with all constraints of the '≤' type into the standard form for the simplex method, what is added to each constraint and what is its coefficient in the objective function?
A slack variable is added to each '≤' constraint, and its objective function coefficient is zero. It represents unused resource capacity, which contributes no profit. Surplus variables belong to '≥' constraints, and artificial variables are used to obtain an initial basic solution.
- AA slack variable, with objective coefficient zeroCorrect
- BA surplus variable, with objective coefficient zero
- CAn artificial variable, with objective coefficient zero
- DA slack variable, with a coefficient equal to the constraint's RHS value
Explanation
A '≤' constraint has unused capacity, which is represented by a slack variable. Slack variables add nothing to profit, so their objective coefficient is zero. Surplus variables are used for '≥' constraints, and artificial variables are used when no starting basic variable is available.
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
- 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?
- 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…
- In a linear programming model, which of the following is an example of a non-negativity restriction?
- 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…