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

MINIMIZE 7 X + 8 Y

s.t. 2X - 3 Y 6 ............ (1)

X 6 ............ (2)

X 0 and Y 0

Using graphical method which constraint(s) is (are) binding?

Keep your own graph.

Select one:

a. Neither constraint #1 nor constraint #2 is binding constraint.b. Constraint #2 is the only one binding constraint.c. Both constraint #1 and constraint #2 are binding constraints.d. Constraint #1 is the only one binding constraint.