PRC-2 · Chapter 4 · Question 20 of 60
According to the fundamental theorems of linear programming, where does the optimal mathematical solution always occur within a defined, closed feasible region?
Test yourself: pick an answer
Reveal answer & explanation
Correct answer: B) At one of the outer corner points (vertices) of the region.
Explanation
The Corner Point Theorem states that if a linear programming problem has an optimal solution (maximum or minimum), it will always be found at one of the extreme corner points of the feasible region.
More Linear Programming MCQs
- Q22Given an objective function to maximize profit P = 50x + 40y, and the feasible corner points are (0,0), (10,0), (0,15), and (5,10). What…
- Q23At what exact coordinate point do the linear boundary constraints x + y = 100 and 2x + y = 150 intersect?
- Q24What is the mathematical slope of the boundary line defined by the production constraint 3x + 4y = 120?
- Q25For the raw material constraint 5x + 2y ≤ 200, what is the maximum number of product 'x' that can be produced if zero units of 'y' are…
- Q26If the optimal solution of a linear program falls exactly on the intersection of two constraint lines, those specific constraints are…