Home
Class 12
MATHS
Let an LPP be as follows: Maximize Z=3x1...

Let an LPP be as follows: Maximize `Z=3x_1+5x_2` subject to `x_1+2x_2le12`, `2x_1+5x_2le20` and `x_1,x_2ge0`. Test whether the points (2,3) and (-3,4) are feasible solutions or not.

Text Solution

Verified by Experts

The correct Answer is:
Hence,(2,3) is a feasible solution.
Promotional Banner

Topper's Solved these Questions

  • LINEAR PROGRAMMING

    ARIHANT PUBLICATION|Exercise QUSTIONS FOR PRACTICE (Short Answer Type Questions 4 Marks)|9 Videos

  • LINEAR PROGRAMMING

    ARIHANT PUBLICATION|Exercise QUSTIONS FOR PRACTICE (Long Answer Type Questions 6 Marks)|19 Videos

  • LINEAR PROGRAMMING

    ARIHANT PUBLICATION|Exercise QUSTIONS FOR PRACTICE (Allocation Problem)|1 Videos

  • INVERSE TRIGONOMETRIC FUNCTIONS

    ARIHANT PUBLICATION|Exercise CHAPTER PRACTICE |35 Videos

  • MATRICES

    ARIHANT PUBLICATION|Exercise CHAPTER PRACTICE (Very Short Answer Type Questions) |56 Videos

Similar Questions

Explore conceptually related problems

Maximize: Z=3x_1+2x_2 "Subject to:-2x_1+x_2 le 1 x_1 le 2 x_1+x_2 le 3 x_1,x_2 ge 0

Maximize Z =5x_1+6x_2 "Subject to" : 2x_1 +3x_2 le 6 x_1,x_2 ge 0

Maximize : Z=20x_1+40x_2 "Subject to" :x_1+x_2 le 1 x_1,x_2 ge 0 .

Minimize Z= 5x_1+3x_2 ''Subject to ":x_1+x_2 le 2 2x_1+x_2 ge 4 x_1,x_2 ge 0

Maximize : Z=3x_1+5x_2 "Subject to":x_1+x_2 le 2 3x_1+x_2 ge 3 x_1,x_2 ge 0

Maximize Z= 6x_1+10x_2 subject to x_1+2x_2gt10,2x_1+2x_2gt12,3x_1+x_2gt8,x_1,x_2gt0

Minimize: Z=6x_1+7x_2 "Subject to":x_1+2x_2 ge 4 x_1,x_2 ge 0

Solve the following LPP graphically : Maximize : Z=5x_1+3x_2 subject to : 3x_1+5x_2le15 5x_1+2x_2le10 x_1,x_2ge0

For the LPP: Maximize z=5x_1+7x_2 subject to x_1+x_2lt4 3x_1+8x_2le24 . 10x_1+7x_2le35 . xge0,yge0 . Examine whether (10/3,11/5) is a feasible solution or not.

Solve the following LPP graphically Maximize z=5x_1+3x_2 Subject to 3x_1+5x_2le15 ,5x_1+2x_2le10 ,x_1, x_2ge0 .