Exercise (Practise Problem)
Minimize Z=4x_(1)+3x_(2)
Subject to 2x_(1)+x_(2)>=10
-3x_(1)+2x_(2)<=6
and x_(1)+x_(2)>=6
x_(1),x_(2)>=0 use the big M methodExercise (practise Problem) Using dual simplex method to solve the following LPP,
Maximize Z=-2x_(1)-2x_(2)-4x_(3)Subject to the constraints
2x_(1)+3x_(2)+5x_(3)>=2
3x_(1)+x_(2)+7x_(3)<=3
x_(1)+4x_(2)+6x_(3)<=5
and x_(1),x_(2),x_(3)>=0
