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?
Correct answer: C. 17
- A. 15
- B. 16
- C. 17
- D. 18
Explanation
The relevant corner points include (3,2), where Z equals 18, and (1,4), where Z equals 16. The maximum is therefore 18, so option c is not correct.
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
What does the non-negativity condition x ≥ 0 and y ≥ 0 mean in a linear programming model?
In a graphical linear programming solution, an optimal value occurs along an entire edge of the feasible region when:
Which feature indicates that a maximization linear programming problem is unbounded?
In a minimization linear programming problem, the feasible region is commonly located on which side of a constraint such as 2x + y ≥ 8?
What does the shadow price of a resource constraint represent in a linear programming model?
Which statement correctly distinguishes linear programming from integer programming?