Question

In: Math

Find the dual problem for each of the following primal problems. a): min z=6x1+8x2 st: 3x1+x2>=4...

Find the dual problem for each of the following primal problems.

a): min z=6x1+8x2 st: 3x1+x2>=4 5x1+2x2>=7 x1,x2>=0

b): max z=8x1+3x2-2x3 st: x1-6x2+x3>=2 5x1+7x2-2x3=-4 x1<=0,x2<=0,x3 unrestricted

Expert Solution

b) Given primal problem is :

Here we see that the primal variable x₃ is unrestricted in sign and the second constraint is an equation.

First of all let us rewrite the problem in its equivalent form with all positive variables by writting x₃ = x₃'-x₃'' as

Now we recast these in our required standard form as

Hence the dual problem is given by

i.e.,

This can be written again as

milcah answered 2 years ago

Find dual from primal conversion MIN Z = x1 - 2x2 subject to 4x1 - x2 >= 8 2x1 + x2 >= 10 -x1 + x2 <= 7 and x1,x2 >= 0

Find dual from primal conversion MIN Z = x1 - 2x2 subject to 4x1 - x2 >= 8 2x1 + x2 >= 10 -x1 + x2 = 0

Write the dual maximization problem, and then solve both the primal and dual problems with the...

Write the dual maximization problem, and then solve both the primal and dual problems with the simplex method. (For the dual problem, use x1, x2, and x3 as the variables and f as the function.) Minimize g = 6y1 + 28y2 subject to 2y1 + y2 ≥ 14 y1 + 3y2 ≥ 14 y1 + 4y2 ≥ 17 . primal g = primal y1 = primal y2 = dual f = dual x1 = dual x2 = dual x3 =

Find the Dual of the following LP max z = 4x1 − x2 + 2x3 x1...

Find the Dual of the following LP max z = 4x1 − x2 + 2x3 x1 + x2 ≤ 5 2x1 + x2 ≤ 7 2x2 + x3 ≥ 6 x1 + x3 = 4 x1 ≥ 0, x2, x3 free

Find the set of ALL optimal solutions to the following LP: min z= 3x1−2x2 subject to...

Find the set of ALL optimal solutions to the following LP: min z= 3x1−2x2 subject to 3x1+x2≤12 3x1−2x2−x3= 12 x1≥2 x1, x2, x3≥0

Solve the following problem by the dual simplex method. Min Z = 2 x1 + 3...

Solve the following problem by the dual simplex method. Min Z = 2 x1 + 3 x2 subject to 2 x1 + 2 x2 <= 30 x1 + 2 x2 >=10 x1 0, x2 >=0

Consider the following linear optimization model. Z = 3x1+ 6x2+ 2x3 st 3x1 +4x2 + x3...

Consider the following linear optimization model. Z = 3x1+ 6x2+ 2x3 st 3x1 +4x2 + x3 ≤2 x1+ 3x2+ 2x3 ≤ 1 X1, x2, x3 ≥0 (10) Write the optimization problem in standard form with the consideration of slack variables. (30) Solve the problem using simplex tableau method. (10) State the optimal solution for all variables.

Given the following LP max z = 2x1 + x2 + x3 s. t. 3x1 -...

Given the following LP max z = 2x1 + x2 + x3 s. t. 3x1 - x2 <= 8 x2 +x3 <= 4 x1,x3 >= 0, x2 urs (unrestricted in sign) A. Reformulate this LP such that 1)All decision variables are non-negative. 2) All functional constraints are equality constraints B. Set up the initial simplex tableau. C. Determine which variable should enter the basis and which variable should leave.

Solve the following problems using the two phase method: max 3x1 + x2 S.t. x1 −...

Solve the following problems using the two phase method: max 3x1 + x2 S.t. x1 − x2 ≤ −1 −x1 − x2 ≤ −3 2x1 + x2 ≤ 4 x1, x2 ≥ 0 Please show all steps

use the two-phase method and big.M method to solve the LPP: min z=x1-2x2 st: x1+x2>=2 -x1+x2>=1...

use the two-phase method and big.M method to solve the LPP: min z=x1-2x2 st: x1+x2>=2 -x1+x2>=1 x2<=3 x1,x2>=0 (two method!)

Given the following primal problem: maximize z = 2x1 + 4x2 + 3x3 subject to x1...

Given the following primal problem: maximize z = 2x1 + 4x2 + 3x3 subject to x1 + 3x2 + 2x3 ≥ 20 x1 + 5x2 ≥ 10 x1 + 2x2 + x3 ≤ 18 x1 , x2 , x3 ≥ 0 1. Write this LP in standart form of LP. 2.Find the optimal solution to this problem by applying the Dual Simplex method for finding the initial basic feasible solution to the primal of this LP. Then, find the optimal...