Linear programming part 2

If the constraints in a linear programming problem are changed

Solve the following linear programming problem graphically. Minimize :z=2x+3y-1 Subject to: x-yge0 -x+2yge2 xge3 yle4 yge0

Solve the linear programming problem Maximise Z=x+2y Subject to the constraints: x-yle10, 2x + 3y le20 and xge0, yge0

Solve each of the following linear programming problems by graphical method. Maximize Z=x+y Subject to -2x+ylt=1 , xlt=2 , x+ylt=3 x , ygeq0

Solve the following linear programming problem graphically: Maximize : z=x+2y Subject to: x-yle2 x+yle4 xge0 yge0

Solve the following linear programming problem graphically: Maximize : z=4x+3y Subject to: 2x+yge40 x+2yge50 x+yle35 xge0 yge0

Solve the following linear programming problem graphically: Minimize : z=100x+50y Subject to constraints : x+2yge10 3x+4yge24 xge0 yge0

Solve the following linear programming problem graphically: Maximise Z" "=" "4x" "+y . . . (1) subject to the constraints: x+ylt=50 . . .(2) 3x+ylt=90 . . .(3) xgeq0,""""ygeq0 . . .(4)

Solve the following linear programming problem graphically: Minimize : z=3x+5y Subject to: x+yge2 x+3yge3 xge0 yge0

Solve the following linear programming problem graphically: Maximize : z=30x+25y Subject to: x+yle6 3x+2yle15 xge0 yge0