Beruflich Dokumente
Kultur Dokumente
DUAL PROBLEM
Neil Gaius J. Bargayo
5.1FINDING THE DUAL OF A LINEAR
PROGRAMMING PROBLEM
RESOURCES
AMOUNT OF
NEEDED
RESOURCE RESOURCE
AVAILABLE(HRS.)
TABLE CHAIR
LABOR (hours)
2 4 40
INVENTORY
24 12 240
SPACE ((feet)2)
TABLE 5.1: CONSTRUCTION OF THE DUAL
FROM THE PRIMAL
maxZ
minW
(x1 > 0) (x2 > 0) LLL (xn > 0)
x1 x2 xn
(y1 > 0) y1 a11 a12 LLL a1n < b1
(y2 > 0) y2 a21 a22 LLL a2n < b2
Z=c1x1+c2x2+LLL+cnxn=b1y1+b2y2+LLL+bmym=W
5.1.2 PRIMAL-DUAL RELATIONSHIP
S1 S2 S3 X1 X2
0 S3 6 -2 1 0 0 48
Z 20 20/3 0 0 0 2240
5.2 READING THE OPTIMAL SOLUTION
TO THE DUAL
L L
The inverse matrix to B is: 1/2 -1/18 0
B = L -1/2 1/9 0 L
2/6 -2 1
L L
1/2 -1/18 0
B = L -1/2 1/9 0 L = (20L20/3L0)L
2/6 -2 1
5.2 READING THE OPTIMAL SOLUTION
TO THE DUAL
x1 x2 x3 s1 e2 a2 a3