PRC-2 · Chapter 4 · Question 11 of 60
Given an objective function designed to minimize cost where C = 3x + 4y, and the corner points of the feasible region are (2, 5), (4, 1), and (0, 6). Which point yields the minimum cost?
Test yourself: pick an answer
Reveal answer & explanation
Correct answer: B) (4, 1)
Explanation
Testing the points: At (2, 5), C = 3(2) + 4(5) = 26. At (4, 1), C = 3(4) + 4(1) = 16. At (0, 6), C = 3(0) + 4(6) = 24. The minimum cost is 16, which occurs at point (4, 1).
More Linear Programming MCQs
- Q13Given the objective function to maximize profit P = 400x + 200y, and corner points of a feasible region at (0, 10), (8, 0), and (5, 5)…
- Q14Which of the following statements perfectly describes a feasible region?
- Q15A graphical boundary line is defined as x = 4. What does the inequality x ≥ 4 represent visually on the coordinate plane?
- Q16What is the primary overarching purpose of utilizing linear programming in a business scenario?
- Q17A factory produces items X and Y. Production is restricted by the inequalities x ≤ 20, y ≤ 30, and x ≤ 50. Which of these constraints is…