[Steps Shown] Consider the following linear program. Min z =15x1 + 15x2 + 16x3 Subject to: 1x1 + 1x3≤ 30 0.5x1 -1x2 + 6x3 ≥ 15 3x1 + 4x2 1x3 ≥ 20 x1,
Question: Consider the following linear program.
Min z =15x1 + 15x2 + 16x3
Subject to:
1x1 + 1x3≤ 30
0.5x1 –1x2 + 6x3 ≥ 15
3x1 + 4x2 1x3 ≥ 20
x1, x2, x3 ≥ 0
Solve the problem using Excel Solver.
- What is the optimal solution, and what is the value of the objective function?
- Which constraints are binding?
- What are the shadow prices? Interpret each.
- If you could change the right-hand side of one constraint by one unit, which one would you choose? What would be the new value of the right-hand side?
Price: $2.99
Solution: The downloadable solution consists of 3 pages
Deliverable: Word Document 