Home
Class 12
MATHS
A Linear Programming Problem is as foll...

A Linear Programming Problem is as follows :
Minimise `z = 2x + y`
subject to the constraints `xge 3, x ge 9 , y ge 0`
`x - y ge 0, x + y le 14`
The feasible region has

A

5 corner points including (0,0) and (9, 5)

B

5 corner points including (7, 7) and (3, 3)

C

5 corner points including (14, 0) and (9, 0)

D

5 corner points including (3, 6) and (9, 5)

Text Solution

AI Generated Solution

Promotional Banner

Topper's Solved these Questions

  • QUESTION PAPER 2022 TERM 1 SET 1

    XII BOARDS PREVIOUS YEAR|Exercise SECTION-B|20 Videos

  • QUESTION PAPER 2022 TERM 1 SET 1

    XII BOARDS PREVIOUS YEAR|Exercise SECTION-C|10 Videos

  • EXAM REVISION SERIES

    XII BOARDS PREVIOUS YEAR|Exercise All Questions|34 Videos

  • QUESTION PAPER 2022 TERM 1 SET 2

    XII BOARDS PREVIOUS YEAR|Exercise SECTION C|10 Videos

Similar Questions

Explore conceptually related problems

Minimize Z = 3x + 2y subject to the constraints : x + y ge 8, 3x + 5y le 15, x ge 0, y ge 0 .

Minimize Z = x + 4y subject to constraints x + 3y ge 3 , 2x + y ge 2, x ge 0 , y ge 0

Maximize: Z = -x + 2y , subject to the constraints: x ge 3, x + y ge 5, x + 2y ge 6, y ge 0 .

Maximise Z= -x + 2y , subject to the constraints: x ge 3, x + y ge 5, x + 2y ge 6, y ge 0 .

Minimize Z = 2x + 3y subject to constraints x + y ge 6 , 2x + y ge 7, x + 4y ge 8 , x ge 0 , y ge 0

Maximum Z = 3x + 5y subject to the constraints : x + 2y ge 10, x + y ge 6, 3x + y ge 8, x ge 0, y ge 0 .

Minimize z = 24x + 40y subject to constraints 6x + 8y ge 96, 7x + 12y ge 168, x ge 0 , y ge 0

A linear programming problem is as follows: Minimize Z= 30x + 50y subject to the constraints, 3x+5y ge 15 2x+3y le 18 x ge 0, y ge 0 In the feasible region, the minimum value of Z occurs at

Maximize : Z = x + y ,subject to the constraints: x - y le -1, -x + y le 0, x ge 0, y ge 0