Consider the following linear program:
Max z=3x1 +2x2 s.t.
2x1 + 2x2 ≤ 8
3x1 + 2x2 ≤ 12
1x1 + 0.5x2 ≤ 3
x1 , x2 ≥ 0

Find the optimal solution using the graphical solution procedure. What is the value of the objective function?
b) Does this linear program have a redundant constraint? If so, what is it? Does the solution change if the redundant constrain is removed from the model? Explain.

Question

Consider the following linear program:
Max	z=3x1 +2x2 s.t.
2x1 + 2x2	≤	8 
3x1 + 2x2	≤	12 
1x1 + 0.5x2	≤	3 
x1 , x2	≥	0

Find the optimal solution using the graphical solution procedure. What is the value of the objective function?
b) Does this linear program have a redundant constraint? If so, what is it? Does the solution change if the redundant constrain is removed from the model? Explain.

anonymous · Answer

This is hard for us because we can't graph it. How much do you know about linear programming?