A maximizing linear programming problem has two constraints: 2X + 4Y ≤ 100 and 3X + 10Y ≤ 210, in addition to constraints stating that both X and Y must be nonnegative. What are the corner points of the feasible region of this problem?
A) (0, 0), (50, 0), (0, 21), and (20, 15)
B) (0, 0), (70, 0), (25, 0), and (15, 20)
C) (20, 15)
D) (0, 0), (0, 100), and (210, 0)
E) (0, 0), (0, 25), (50, 0), (0, 21), and (70, 0)

Question

Quizplus · Accepted Answer

The corner points of the feasible region are found by solving the system of inequalities and finding the intersections of the constraints. The points (0, 0), (50, 0), (0, 21), and (20, 15) are found by solving the equations 2X + 4Y = 100 and 3X + 10Y = 210, along with the non-negativity constraints X ≥ 0 and Y ≥ 0.

A Maximizing Linear Programming Problem Has Two Constraints: 2X