Question

In: Operations Management

Situation: Construct the Dual and solve the Dual by the graphical and simplex method. The values...

Situation:

Construct the Dual and solve the Dual by the graphical and simplex method. The values of the variables are in the table.

Minimize     Z = Ax1 + Bx2 + Cx3

Subject to:     Dx1 + Ex2 + Fx3 >= J

                        Gx1 + Hx3 + Ix3 >= K

x1, x2, and x3 >= 0

Student

Coefficients

Numbers

A

B

C

D

E

F

G

H

I

J

K

Objective Function

Equations

Constant recursor

1

2

1

1

3

5

2

3

5

19

15

Solutions

Expert Solution

Primal:

Min Z = 1x1 + 2x2 + 1x3
s.t.
1x1 + 3x2 + 5x3 >= 19
2x1 + 3x3 + 5x3 >= 15
x1, x2, x3 >= 0

Dual:

Max W = 19y1 + 15y2
s.t.
1y1 + 2y2 <= 1
3y1 + 3y2 <= 2
5y1 + 5y2 <= 1
y1, y2 >= 0

Graphical solution:

As we can see the first two constraints are redundant and the feasibility region is formed only by the third constraint with three corner points - the origin, (0, 0.2), and (0.2, 0).

Corner point y1 y2 W = 19y1 + 15y2
(0, 0) 0 0 0
(0, 0.2) 0 0.2 3
(0.2, 0) 0.2 0 3.8 (max)

So,

the optimal solution of the dual is y1=0.2, y2=0, and max W = 3.8

Simplex method:

Standard form:

Max W   =       19   y1   +   15   y2   +   0   S1   +   0   S2   +   0   S3
subject to
y1   +   2   y2   +       S1                           =   1
3   y1   +   3   y2               +       S2               =   2
5   y1   +   5   y2                           +       S3   =   1
y1,y2,S1,S2,S3 ≥ 0

Iteration-1 Cj 19 15 0 0 0
B CB RHS y1 y2 S1 S2 S3 Min Ratio
RHS / y1
S1 0 1 1 2 1 0 0 1 / 1=1
S2 0 2 3 3 0 1 0 2 / 3=0.667
S3 0 1 (5) 5 0 0 1 1 / 5=0.2
W = 0 Zj 0 0 0 0 0
Zj-Cj -19↑ -15 0 0 0

Negative minimum Zj-Cj is -19 and its column index is 1. So, the entering variable is y1.

The minimum ratio is 0.2 and its row index is 3. So, the leaving basis variable is S3.

So, the pivot element is 5.

Entering =y1, Departing =S3, Key Element =5

Row operations:

  • R3(new)=R3(old) / 5
  • R1(new)=R1(old) - R3(new)
  • R2(new)=R2(old) - 3 * R3(new)
Iteration-2 Cj 19 15 0 0 0
B CB RHS y1 y2 S1 S2 S3
S1 0 0.8 0 1 1 0 -0.2
S2 0 1.4 0 0 0 1 -0.6
y1 19 0.2 1 1 0 0 0.2
W = 3.8 Zj 19 19 0 0 3.8
Zj-Cj 0 4 0 0 3.8

Since all Zj-Cj ≥ 0, we have reached the optimal solution which is as follows:

y1 = 0.2
y2 = 0
max W = 3.8


Related Solutions

Construct the Dual and solve the Dual by the graphical and simplex method. Minimize Z =...
Construct the Dual and solve the Dual by the graphical and simplex method. Minimize Z = 1x1 + 2x2 + 3x3 Subject to: 0x1 + 6x2 + 2x3 >= J 3x1 + 2x3 + 5x3 >= K x1, x2, and x3 >= 0 constant resources: J = 25 K = 24 Please do on paper...
Construct the Dual and solve the Dual by the graphical and simplex method. Minimize Z =...
Construct the Dual and solve the Dual by the graphical and simplex method. Minimize Z = 1x1 + 2x2 + 3x3 Subject to: 0x1 + 6x2 + 2x3 >= J 3x1 + 2x3 + 5x3 >= K x1, x2, and x3 >= 0 constant resources: J = 25 K = 24
Construct the Dual and solve the Dual by the graphical and simplex method. Minimize Z =...
Construct the Dual and solve the Dual by the graphical and simplex method. Minimize Z = 1x1 + 1x2 + 2x3 Subject to: 2x1 + 2x2 + 1x3 >= J 5x1 + 6x2 + 7x3 >= K x1, x2, and x3 >= 0 constant resources: J = 15 K = 17 Please do on paper..
Construct the Dual and solve the Dual by the graphical method. Minimize Z = 1x1 +...
Construct the Dual and solve the Dual by the graphical method. Minimize Z = 1x1 + 2x2 + 3x3 Subject to: 0x1 + 6x2 + 2x3 >= J 3x1 + 2x3 + 5x3 >= K x1, x2, and x3 >= 0 constant resources: J = 25 K = 24 Please do on paper...
Solve the following linear programming problem using the dual simplex method: max ? = −?1 −...
Solve the following linear programming problem using the dual simplex method: max ? = −?1 − 2?2 s.t. −2?1 + 7?2 ≤ 6 −3?1 + ?2 ≤ −1 9?1 − 4?2 ≤ 6 ?1 − ?2 ≤ 1 7?1 − 3?2 ≤ 6 −5?1 + 2?2 ≤ −3 ?1,?2 ≥ 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
Use the dual simplex method to solve the following linear programming problems. Clearly indicate all the...
Use the dual simplex method to solve the following linear programming problems. Clearly indicate all the steps, the entering and departing rows and columns and rows, the pivot and the row operations used. Use the simplex method to solve the following linear programming problems. Clearly indicate all the steps, the entering and departing rows and columns and rows, the pivot and the row operations used. 2.2.1 An electronics manufacturing company has three production plants, each of which produces three different...
Solve the LP problem using graphical method. Determine the optimal values of the decision variables and...
Solve the LP problem using graphical method. Determine the optimal values of the decision variables and compute the objective function. Maximize Z = 2A + 10B Subject to 10A + 4B ≥ 40    A + 6B ≥ 24                A + 2B ≤ 14    A, B  ≥ 0 with soln pls thank you!
Maximization by the simplex method Solve the following linear programming problems using the simplex method. 1>....
Maximization by the simplex method Solve the following linear programming problems using the simplex method. 1>. Maximize z = x1 + 2x2 + 3x3 subject to x1 + x2 + x3 ≤ 12 2x1 + x2 + 3x3 ≤ 18 x1, x2, x3 ≥ 0 2>. A farmer has 100 acres of land on which she plans to grow wheat and corn. Each acre of wheat requires 4 hours of labor and $20 of capital, and each acre of corn...
Solve the following linear program using both the graphical and the simplex methods: Max 2X1 +...
Solve the following linear program using both the graphical and the simplex methods: Max 2X1 + 8 X2 s.t. 3X1 + 9X2 <= 15 2X1 + X2 >= 12 X1, X2 >= 0 Show graphically how the simplex method moves from one basic feasible solution to another. Find the coordinates of all extreme points of the feasible region. From the graphic I can see there's no solution , but how to prove it through simplex method? Thank you!
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT