A Maximizing Linear Programming Problem Has Two Constraints: 2X

Multiple Choice

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. The corner points of the feasible region of this problem are

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) none of the above