Which pair of constraints makes a linear programming problem infeasible?
Correct answer: C. x + y ≤ 3 and x + y ≥ 5
- A. x + y ≤ 5 and x + y ≥ 2
- B. x + y ≤ 5 and x + y ≥ 5
- C. x + y ≤ 3 and x + y ≥ 5
- D. x + y ≥ 3 and x + y ≥ 5
Explanation
The two constraints in option C require the same expression to be at most 3 and at least 5 at the same time. No values of x and y can satisfy both requirements, so the feasible region is empty.
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
What is the purpose of adding a slack variable to a constraint such as 2x + 3y ≤ 12?
A manufacturer maximizes Z = 3x + 2y subject to x + y ≤ 4, x ≤ 2, y ≤ 3, and x, y ≥ 0. What is the maximum value of Z?
For a linear programming problem with a non-empty bounded feasible region, where does an optimal solution occur if one exists?
Which assumption of linear programming means that the contribution of each activity is directly proportional to its level?
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?
In a graphical solution of a two-variable linear programming problem, what does the common area satisfying all constraints represent?