Consider following linear program. Max 50x1 + 75x2 s.t. 3.5x1 + 4x2 =0, x2 >=0 The optimal solution found is: x1 = 0, x2 =

Consider following linear program.

Max 50x1 + 75x2

s.t.

3.5x1 + 4x2 <= 84 Constraint 1

x1 + 1.5x2 <= 21 Constraint 2

x1 2x2 >= 0 Constraint 3

x1 >=0, x2 >=0

The optimal solution found is: x1 = 0, x2 = 14 with objective function value of 1050.

1. True or False, Constraint 1 is binding?
2. Which of the following is true for Constraint 2? Constraint 2 has a shadow price >= 0 Constraint 2 has a shadow price that is < 0 Constraint 2 has a shadow price <= 0
3. Develop an algebraic linear programming model that will find an alternative optimal solution if one exists.