The primal linear programming problem is
Maximise Z=22x1+25x2+19x3subject to18x1+26x2+22x3≤35014x1+18x2+20x3≥18017x1+19x2+18x3=205 and x1,x2,x3≥0
Since the second constraint is of ‘‘≥" type, we convert it into ‘‘≤" by multiplying it by -1.
Maximise Z=22x1+25x2+19x3 subject to 18x1+26x2+22x3−14x1−18x2−20x317x1+19x2+18x3≤350≤−180=205and x1,x2,x3≥0
The dual of the given linear programming problem is
Minimise Z∗=350y1−180y2+205y3subject to18y1−14y2+17y326y1−18y2+19y322y1−20y2+18y3 and y1,y2≥22≥25≥19≥0,y3 unrestricted in sign
Since the third constraint in the primal is equality, the corresponding dual variable y3 will be unrestricted in sign.
Comments