Compute the dual prices for given constraints
Not what you're looking for?
The initial probability of success was 1 in 3 or .333. Now the contestant is down to two doors. There is a 50/50 chance of winning with two doors no matter what happened before so it doesn't matter if she switches. (true or false)
_________________________________________________________________________
II. The optimal solution of the linear programming problem is at the intersection of constraints 1 and 2.
Max 2x1 + x2
s.t. 4x1 + 1x2 < or equal to 400
4x1 + 3x2 < or equal to 600
1x1 + 2x2 < or equal to 300
x1, x2 > or equal to 0
Compute the dual prices for the tree constraints.
.45, .25, 0
.25, .25, 0
0, .25, .45
.45, .25, .25
Purchase this Solution
Solution Summary
This posting contains solution to following problems.
Purchase this Solution
Free BrainMass Quizzes
Exponential Expressions
In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.
Geometry - Real Life Application Problems
Understanding of how geometry applies to in real-world contexts
Solving quadratic inequalities
This quiz test you on how well you are familiar with solving quadratic inequalities.
Multiplying Complex Numbers
This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.
Probability Quiz
Some questions on probability