Solve graphically, the linear programming problem: Minimize Z=2x+y subject to `5x+10yle50,x+yge1,yle4`,`x,yge0`

Consider the linear programming problem: Minimise Z=3x+9y subject to the constraints: x+3yle60, x+yge10 , xley , xge0 , yge0 . Find the minimum value of Z subject to the given constraints.

Consider the linear programming problem: Minimise Z=3x+9y subject to the constraints: x+3yle60 x+yge10 , xley , xge0 , yge0 . Draw its feasible region.

Consider the linear programming problem: Minimise Z=3x+9y subject to the constraints: x+3yle60 x+yge10 , xley , xge0 , yge0 . Find the vertics of the feasible region.

Consider the linear programming problem: Maximize z=4x+y Subject to constraints: x+yle50 , 3x+yle90 , x,yge0 Draw the feasible region.

Consider the linear programming problem: Maximize z=4x+y Subject to constrains: x+yle50 , 3x+yle90 , x,yge0 Find the corner at which 'z' attains its maximum value.

Consider the linear programming problem: Minimise Z=-3x+4y Subject to x+2yle8 , 3x+2yle12 ,x,y ge 0 Find the corner at which Z attain its minimum.

Consider the linear programming problem: Minimise Z=-3x+4y Subject to x+2yle8 , 3x+2yle12 ,x,y ge 0 Find the corner points of the feasible region.

Solve the linear programming problem graphically: Max: z=3x+2y Subject to: x+2yle10,3x+yle15,xge0,yge0

Consider the linear programming problem, Maximize, Z=x+y , subject to constraints 2x+y-3le0 , x-2y+1le0 , yle3 , xge0 , yge0 Find the corner points of the feasible region.

Consider the linear programming problem: Maximum z=50x+40y subject to constraints: x+2yle10 , 3x+4yge24 , x,yge0 Find the maximum value of z.