33. A linear-programming problem has constraints given by , , , and .
33.
(a) and are vertical constraints, while y=0 is a horizontal constraint.
(b)
(c) (0, 0); (4, 0); (4, 2); (0, 15)
(d) (i) 16; (ii) (0, 15); (4, 2)