Home
Class 12
MATHS
Solve each of the following linear progr...

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

Text Solution

AI Generated Solution

Promotional Banner

Topper's Solved these Questions

  • LINEAR PROGRAMING

    RD SHARMA ENGLISH|Exercise All Questions|4 Videos

  • MAXIMA AND MINIMA

    RD SHARMA ENGLISH|Exercise All Questions|309 Videos

Similar Questions

Explore conceptually related problems

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 each of the following linear programming problems by graphical method. Maximize Z=2x+3y Subjected to constrent x+ygeq1 , 10 x+ygeq5 , x+10ygeq1 and x , ygeq0

Solve each of the following linear programming problems by graphical method. Maximize Z=30 x+20 y Subject to x+ylt=8 x+4ygeq12 5x+8y=20 x , ygeq0

Solve the following liner programming problems by graphical method: Maximize Z=5x+3y Subject to 4x+5ylt=15 5x+2ylt=10 x , ygeq0

Solve the following liner programming problems by graphical method: Maximize Z=50 x+30 y Subject to 2x+ylt=18 , 3x+2ylt=34 x , ygeq0

Solve each of the following linear programming problems by graphical method. Maximize Z=3x_1+5x_2 Subject to x_1+3x_2geq3 x_1+x_2geq2 x_1, x_2geq0

Solve the Following Linear Programming Problem graphically : Maximise Z = 3x + 4y subject to the constraints : x+ylt=4,xgeq0,ygeq0 .

Solve the following liner programming problems by graphical method: Maximize Z=-x_1+2x_2 , if possible, Subject to the constraints x_1-x_2lt=-1 -x_1+x_2lt=0 x_1, x_2geq0

Solve the following liner programming problems by graphical method: Minimize Z=x-5y+20 Subject to x-ygeq0 -x+2ygeq2 xgeq3 ylt=4 x , ygeq0

Solve the following liner programming problems by graphical method: Minimize Z=5x+3y Subject to 2x+ygeq10 x+3ygeq15 xlt=10 ylt=8 x , ygeq0