Given the following linear programming (LP) problem with 3 constraints:

MAXIMIZE Z =X + 7 Y

s.t. 2Y 12 ............ (1)

2X - Y 8 ......... (2)

3X 9 ............ (3)

X 0 and Y 0

Using graphical method how many corner(s) is (are) there in the feasible region?

Keep your own graph.

Select one:

a. There are two corners in the feasible region.b. There are four corners in the feasible region.c. There are three corners in the feasible region.d. There are five corners in the feasible region.e. There is only one corner in the feasible region.