Which feature indicates that a maximization linear programming problem is unbounded?
Correct answer: D. The objective value can increase without limit
- A. The feasible region contains no points
- B. The feasible region has exactly one corner point
- C. Every constraint passes through the origin
- D. The objective value can increase without limit
Explanation
A maximization problem is unbounded when feasible points allow the objective value to increase indefinitely. An empty feasible region describes infeasibility, not unboundedness.
Report an error
The more specific you are, the faster it gets fixed. A source beats an opinion.
Prefer email? [email protected]
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.
Discussion
Stuck on an option, or know a faster way to get there? Ask or explain it here.
No comments yet. Be the first to explain this one.
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 constraint is binding at a particular solution when it:
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 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?
Consider the problem of maximizing Z = 4x + 3y subject to x + y ≤ 5, x ≤ 3, y ≤ 4, and x, y ≥ 0. What is the optimal value of Z?