A constraint is binding at a particular solution when it:
Correct answer: C. Is satisfied exactly as an equality
- A. Has a positive slack value
- B. Holds as a strict inequality
- C. Is satisfied exactly as an equality
- D. Has a zero objective coefficient
Explanation
A binding constraint is satisfied exactly, so its left side equals its right side. A positive slack indicates unused capacity and therefore a non-binding constraint.
Report an error
The more specific you are, the faster it gets fixed. A source beats an opinion.
Prefer email? support@testustad.com
About Linear Programming
Linear programming models the maximum or minimum of an objective function subject to linear constraints. Questions involve translating word conditions into inequalities, drawing the feasible region, identifying corner points and evaluating the objective function, including cases involving non-negativity restrictions and redundant constraints.
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
In linear programming, how is a constraint such as 3x + 2y ≥ 10 usually converted into an equality?
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?
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:
What does the non-negativity condition x ≥ 0 and y ≥ 0 mean in a linear programming model?