Home
Class 12
MATHS
Consider the linear programming problem,...

Consider the linear programming problem,
Maximise, `Z=x+y`, subject to the constraints `2x+y-3le0`,`x-2y+1le0`,`yle3`,`xge0`,`yge0`
Find the corner at which Z attains its maximum.

Promotional Banner

Topper's Solved these Questions

  • LINEAR PROGRAMMING

    BODY BOOKS PUBLICATION|Exercise EXERCISE|2 Videos
  • INVERSE TRIGONOMETRIC FUNCTIONS

    BODY BOOKS PUBLICATION|Exercise EXERCISE|97 Videos
  • MATRICES

    BODY BOOKS PUBLICATION|Exercise EXERCISE|107 Videos

Similar Questions

Explore conceptually related problems

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.

Maximise Z=2x+3y subject to the constraints x+y 0 , y>0

Solve the linear programming problem graphically Maximise Z=3x+5y subject to the constraints x+3yle3 x+yle2 x,yge0

Consider the linear programming problem: Maximize Z=50x+40y Subject to the constraints x+2yge10 3x+4yle24 xge0,yge0 Find the maximum value of Z.

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+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=50x+40y Subject to the constraints x+2yge10 3x+4yle24 xge0,yge0 Find the corner points of the feasible region.

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 minimum value of Z subject to the given constraints.

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