Maximise `Z=-x+2y`, subject to the constraint,
`xge3, x+yge5, yge0`

Maximise Z=3x+4y Subject to the constraints x+yle4, xge0, yge0

Minimise Z=3x+2y subject to the constraints, x+yge8 ………..1 3x+5yle15 …………2 xge0, yge0 ………..3

Represent geometrically the following LPP Minimize Z= 3x+2y Subject to the constraits 5x+y ge 10 x+yge6 x+4yge12 and x ge 0 ,y ge 0 find out the exterme points of the convex set of feasible solution and hence find out the minimum value of the objective function

Make a graphical representation of the set of constraints in the following LPP Maximize Z=3x+2y subject of the constraints xgt 4 , y gt 6 3x+2ylt18 and x,y gt0

Solve graphically: Maximize Z= 3x+4y subject of the constraints x-ygt0 -x+3ylt3 and x,ygt0

Solve graphically : Maximize Z=-4x+6y Subject to the constraints -x+ylt3 -x+3ylt15 and x,y gt0

Given the LPP max Z=2x+3y Subject to the constraints 3x+y le3 x ge 0, y ge 0 show that the corner points of the LPP are (0,0) ,(1,0) and (0,3)

Show by graphical method that the feasible region of the following LPP is unbounded but it has unique optimal solution x=3 ,y =18 Minimize Z=4x+2y subject to the constraints 3x+y ge 27 -x-y le -21 x+2y ge30 and xge 0,y ge 0

Find the corner points of the feasible region of the linear programing problem Max Z=x Subject to the constraints 3x+2yle12 2x+3y le13 x ge 0,y ge 0