A linear programming problem has two constraints 2X + 4Y =<100 and 1X + 8Y
=<100, plus nonnegativity constraints on X and Y. Which of the following statements
about its feasible region is true?
A) There are four corner points including (50, 0) and (0, 12.5).
B) The two corner points are (0, 0) and (50, 12.5).
C) The graphical origin (0, 0) is not in the feasible region.
D) The feasible region includes all points that satisfy one constraint, the other, or both.
E) The feasible region cannot be determined without knowing whether the problem is to
be minimized or maximized.
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
Forward scheduling