Fill This Form To Receive Instant Help
Homework answers / question archive / Consider the following linear program (LP):max Z = 10x1 + 7x2s
Consider the following linear program (LP):max Z = 10x1 + 7x2s.t.4x1 - 2x2 <= 166x1 + 4x2 <= 243x2 >= 15
x1, x2 >= 0 What are the objective function values at each feasible corner point solution?
What is the optimal solution (x1, x2) and objective function value?
Are any of the constraints redundant? Which one(s)? How do you know?