Home
Class 12
MATHS
Find the corner points of the feasible ...

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`

Text Solution

Verified by Experts

The correct Answer is:
A, B, C, D
Promotional Banner

Topper's Solved these Questions

  • LINEAR PROGRAMMING GRAPHICAL METHOD

    CHHAYA PUBLICATION|Exercise Long Answer Type Question|16 Videos

  • LINEAR PROGRAMMING GRAPHICAL METHOD

    CHHAYA PUBLICATION|Exercise Multiple Correct Answers Type|5 Videos

  • LINEAR PROGRAMMING GRAPHICAL METHOD

    CHHAYA PUBLICATION|Exercise Very Short Answer Type Question|10 Videos

  • LINEAR INEQUATIONS

    CHHAYA PUBLICATION|Exercise SAMPLE QUESTION FOR COMPETITIVE EXAMS (Assertion- Reason Type)|2 Videos

  • LOGARITHM

    CHHAYA PUBLICATION|Exercise Long Answer Type Question|12 Videos

Similar Questions

Explore conceptually related problems

Solve the following linear programming problem graphically : min Z= 5x+7y Subject to the constraints 3x+2y ge12 2x+3y ge 13 and x ge 0, y ge 0

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

Solve the following linear programming problem graphically Maximize Z= 60 x+15y Subject to the constraints x+y le 50 3x+y le90 x,yge 0

3x+2y le 12, x ge 1, y ge 2

Find the corner points of the LPP max Z=x+2y Subject ot the constraints 3x+5yle10 5x+3yle15 x,y ge0

Find the corner points of the LPP Max Z= 2x+5y Subject to the constaints 0 le x le 4 0 le y le 3 x+yle6

Solve the following Linear programming problem in graphical method Subject to the constraints, 5x+10yle50 .

The maximum value of Z=3x+4y subject to the constraints x+y le 40, x+2y le 60, x ge 0 and y ge 0 is -

Minimize Z=(3x+y) Subject ot the constraints : 2x+3y lt6 x+ygt1, and x gt 0, y gt 0