In linear programming, how is a constraint such as 3x + 2y ≥ 10 usually converted into an equality?
Correct answer: A. Subtract a surplus variable from the left side
- A. Subtract a surplus variable from the left side
- B. Add a slack variable to the left side
- C. Multiply both sides by a positive constant
- D. Replace the inequality with a strict equality
Explanation
A surplus variable is subtracted from a greater-than-or-equal constraint to obtain equality. A slack variable is instead added to a less-than-or-equal constraint, which is a common point of confusion.
Report an error
The more specific you are, the faster it gets fixed. A source beats an opinion.
Prefer email? support@testustad.com
Practise Linear Programming
30 free Linear Programming MCQs from Quantitative Methods, each with the correct answer and an explanation. Unlimited attempts, no account needed.
Exams that ask Quantitative Methods questions like this
Quantitative Methods is on this paper prepared for on TestUstad, and all of them draw the same bank, so this question is worth knowing for it.
More Linear Programming questions
A basic feasible solution is called degenerate when which condition occurs?
In a graphical solution of a two-variable linear programming problem, what does the common area satisfying all constraints represent?
If the primal linear programming problem is a maximization problem with less-than-or-equal constraints and non-negative variables, what is the usual form of its dual?
A constraint is binding at a particular solution when it:
Which feature indicates that a maximization linear programming problem is unbounded?
In a graphical linear programming solution, an optimal value occurs along an entire edge of the feasible region when: