Consider the minimization problem: Minimize P(w1, w2, w3) = 18w1 + 42w2 + 24w3, Subject to 2w1 + 2w2 + 3w3 ? 3, w1 + 3w2 + w3 ? 2, w1, w2, w3 ? 0. Write down the initial simplex tableau of the corresponding dual problem, and use the theorem of duality to find the minimum value of P in the primal problem. Give your answer as an integer.
Added by Amanda L.
Close
Step 1
First, we need to rewrite the inequalities as equalities by introducing slack variables s1, s2, and s3: 2w1 + 2w2 + 3w3 + s1 = 3 w1 + 3w2 + w3 + s2 = 2 w1, w2, w3, s1, s2 ≥ 0 Show more…
Show all steps
Your feedback will help us improve your experience
Sri K and 92 other Intro Stats / AP Statistics educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Use the simplex method to solve: Minimize w = 6y1 + 4y2 Subject to: 6y1 + y2 ≥ 60 15y1 + y2 ≥ 105 with y1 ≥ 0, y2 ≥ 0 The minimum is w = when y1 = and y2 = . (Simplify your answers.)
Madhur L.
Consider the constrained optimization problem: minimize f(x,y) = x^2 + y^2 - 14x - 6y, subject to x + y >= 2 and x + 2y <= 3. Argue that this is a convex programming problem. (b) Write down all the Karush Kuhn Tucker conditions satisfied by minimizer x. For each possible tight/active constraint set I(x), solve the resultant system of equations. Hence, find the minimizer.
Adi S.
Consider the following linear programming (LP) problem: Maximize z = x1 - x2 + 2x3 subject to: 3x1 - x2 + x3 ≤ 4 (Constraint 1) x2 + 2x3 ≤ 11 (Constraint 2) x1, x2, x3 ≥ 0 By introducing slack variables where appropriate, express the LP problem in standard form. Then solve the LP problem using the simplex method. Be sure to specify the entering and leaving variables as well as the elementary row operations for each iteration. For the benefit of comparison, a partially-filled simplex tableau at the optimal stage is shown below: Basic z x1 x2 x3 s1 s2 Solution z 1 3 0 0 4/3 1/3 9 ? 0 ? ? ? ? ? 5 ? 0 ? ? ? ? ? 1 (b) Convert the above LP problem to its dual. (c) Using appropriate properties, deduce the optimal solution and optimal value for the dual problem in (b).
Sri K.
Recommended Textbooks
Elementary Statistics a Step by Step Approach
The Practice of Statistics for AP
Introductory Statistics
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD