# Computing the Dual Prices for Optimal Linear Program Solution

Not what you're looking for?

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

##### Purchase this Solution

##### Solution Summary

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

##### 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, ...

##### Purchase this Solution

##### Free BrainMass Quizzes

##### Know Your Linear Equations

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.

##### Probability Quiz

Some questions on probability

##### Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

##### Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

##### Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.