Use the following LP problem to answer questions 1-14 (1-10: 2 Points; 11-15: 4 Points): LetA=(2,0)T andD=(0,2)T

Min z = 5x1 + x2

st

x1 +x2 ≥4 

3x1 + 5x2 ≤ 30 

2x1 −x2 ≤ 4

?x1+?x2 ≤?

x1,x2 ≥ 0

11. Which constraint(s) are binding? (Consider the nonnegativity constraints)

12. Which constraint(s) are redundant? (Consider the nonnegativity constraints)

13. Which Constraint(s) are non-binding? (Consider the nonnegativity constraints)

14. Write down the standard form of the linear programming model.

Transcribed Image Text:

10- G B F. E. x2 10- G B F. E. x2