Question: Consider the following linear program (LP): max Z = 10x1 + 7x2 s.t. 4x1 - 2x2 = 0 What are the objective function values at
Consider the following linear program (LP):
max Z = 10x1 + 7x2
s.t.
4x1 - 2x2 <= 16
6x1 + 4x2 <= 24
3x2 >= 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?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
