Explore BrainMass

# Computing the Dual Prices for Optimal Linear Program Solution

Not what you're looking for? Search our solutions OR ask your own Custom question.

This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

The optimal solution of the linear programming problem is at the intersection of constraints 1 and 2.
Max 2x1 + x2
s.t. 4x1 + 1x2 < 400
4x1 + 3x2 < 600
1x1 + 2x2 Â£ 300
x1 , x2 > 0

Compute the dual prices for the three constraints.
.45, .25, 0
.25, .25, 0
0, .25, .45
.45, .25, .25

https://brainmass.com/math/linear-programming/computing-dual-prices-optimal-linear-program-solution-143741

#### Solution Preview

Since constraint 3 is not a binding constraint the dual price for third constraint is zero. Thus, possible answers are .45, .25, 0 or .25, .25, 0.
The solution lies at the intersection of constraints 1 and 2. Thus, ...

#### Solution Summary

Shows how to compute the dual prices in a few paragraphs' worth of explained calculations.

\$2.49