Thanks to visit codestin.com
Credit goes to www.scribd.com

0% found this document useful (0 votes)
6 views4 pages

Duality Assignment 2

The document presents two linear programming (LP) models: a primal and its corresponding dual. It details the process of solving both models using the Simplex method, providing initial and improved tableau steps, and concludes with the optimal solutions for both primal and dual models. The optimal values for the primal and dual solutions are ZP = 70 and ZD = 24, respectively.

Uploaded by

jjepleting550
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
6 views4 pages

Duality Assignment 2

The document presents two linear programming (LP) models: a primal and its corresponding dual. It details the process of solving both models using the Simplex method, providing initial and improved tableau steps, and concludes with the optimal solutions for both primal and dual models. The optimal values for the primal and dual solutions are ZP = 70 and ZD = 24, respectively.

Uploaded by

jjepleting550
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

Assignment 2

1. For the following primal LP model find the Dual LP model and solve the Primal LP model and read the
solution to both models from the final primal tableau.

PRIMAL LP MODEL DUAL LP MODEL


Max Z = 14x + 7y Min Z = 18u + 24v
S.t S.t
2x + 5y ≤ 18 –(u) 2u + 5v ≤ 14
5x + 2y ≤ 24 - (v) 5u + 2v ≤ 7
x, y ≥ 0 u, v ≥ 0

Solving Primal problem using Simplex method


Standard Form
Max Z -14x - 7y + 0u + 0v = 0
S.t
2x + 5y + u = 18
5x + 2y + v =24
x, y, u, v ≥ 0
Initial Simplex tableau

Basis x y u v RHS Ratio


u 2 5 1 0 18 9
v 5 2 0 1 24 4.8
ZP -14 -7 0 0 0

Pivot column: x column


Pivot row: v
Pivot element: 5

New u row: -2x-row + old u-row


-2(1 2/5 0 1/5 4.8)
-2 -4/5 0 -2/5 -9.6
2 5 1 0 18
0 21/5 1 -2/5 8.4

New Z-row: 14x-row + old Z-row


14(1 2/5 0 1/5 4.8)
14 28/5 0 14/5 67.2
-14 -7 0 0 0
0 -7/5 0 14/5 67.2

Improved Simplex tableau 1

Basis x y u v RHS Ratio


u 0 21/5 1 -2/5 8.4 2
x 1 2/5 0 1/5 4.8 12
ZP 0 -7/5 0 14/5 67.2

Pivot column: y column


Pivot row: u
Pivot element: 21/5
New x- row: -2/5y-row + old x-row
-2/5(0 1 5/21 2/21 2)
0 -2/5 -2/21-4/21 -4/5
1 2/5 0 1/5 4.8
1 0 -2/21 17/105 4

New Z-row: 7/5y-row + old Z-row


7/5(0 1 5/21 2/21 2)
0 7/5 7/21 14/105 14/5
0 -7/5 0 14/5 67.2
0 0 1/3 8/3 70

Improved Simplex tableau 2

Basis x y u v RHS Ratio


y 0 1 5/21 2/21 2
x 1 0 -2/21 17/105 4
ZP 0 0 1/3 8/3 70

Solution is optimal as there is no negative coefficient in the Z – row.

Optimal solutions

Primal solution Dual solution


X=4 U = 1/3
Y=2 V = 8/3
u=0 X=0
v=0 Y=0
ZP = 70 ZD = 70

2. For the following primal LP model find the Dual LP model and solve the Dual LP model and read the
solution to both models from the final dual tableau.

PRIMAL LP MODEL DUAL LP MODEL


Min Z = 3x1 + 9x2 Max Z = 8y1 + 8y2
S.t s.t.
2x1 + x2 ≥ 8 – (y1) 2y1 + y2 ≤ 3
x1 + 2x2 ≥ 8 – (y2) y1 + 2y2 ≤ 9
x1, x2 ≥ 0 y1, y2 ≥ 0

Solving Dual problem using Simplex method


Standard Form
Max ZD - 8y1 - 8y2 + 0x1 + 0x2 = 0
S.t
2y1 + y2 + x1 = 3
y1 + 2y2 + x2 = 9
y1, y2, x1, x2 ≥ 0
Initial Simplex tableau
Basis Y1 Y2 x1 x2 RHS Ratio
x1 2 1 1 0 3 3/2
x2 1 2 0 1 9 9
ZD -8 -8 0 0 0

Pivot column: y1 column


Pivot row: x1
Pivot element: 2

New x2-row: -1y1-row + old x2-row


-1(1 ½ ½ 0 3/2)
-1 -1/2 -1/2 0 3/2
1 2 0 1 9
0 3/2 -1/2 1 7.5

New Z--row: 8y1-row + old z-row


8(1 ½ ½ 0 3/2)
8 4 4 0 12
-8 -8 0 0 0
0 -4 4 0 12

Improved simplex tableau 1

Basis Y1 Y2 x1 x2 RHS Ratio


y1 1 1/2 1/2 0 3/2 3
x2 0 3/2 -1/2 1 7.5 5
ZD 0 -4 4 0 12

Pivot column: y2 column


Pivot row: y1
Pivot element: ½

New x2-row: -3/2y2-row + old x2-row


-3/2(2 1 1 0 3)
-3 -3/2 -3/2 0 -9/2
0 3/2 -1/2 1 7.5
-3 0 -2 1 3

New Z--row: 4y2-row + old z-row


4(2 1 1 0 3)
8 4 4 0 12
0 -4 4 0 12
8 0 8 0 24

Improved simplex tableau 2

Basis Y1 Y2 x1 x2 RHS Ratio


y2 2 1 1 0 3
x2 -3 0 -2 1 3
ZD 8 0 8 0 24
Solution is optimal as there is no negative coefficient in the Z – row.

Optimal solutions
Dual solution Primal solution
Y1 = 0 X1 = 8
Y2 = 3 X2 = 0
X1 = 0 Y1 = 8
X2 = 3 Y2 = 0
ZD = 24 ZP = 24

You might also like