Home
Class 12
MATHS
In a linear programming problem, the con...

In a linear programming problem, the constraints on the decision variables x and y are `x − 3y ge 0,y ge 0, 0 le x le 3`. The feasible region

A

is not in the first quadrant

B

is bounded in the first quadrant

C

is unbounded in the first quadrant

D

does not exist

Text Solution

AI Generated Solution

Promotional Banner

Topper's Solved these Questions

  • SAMPLE PAPER 2022

    CBSE MODEL PAPER|Exercise SECTION – B |20 Videos

  • SAMPLE QUESTION PAPER ( MATHEMATICS )

    CBSE MODEL PAPER|Exercise QUESTION|60 Videos

  • SAMPLE PAPER 2022 TERM II

    CBSE MODEL PAPER|Exercise SECTION C|5 Videos

Similar Questions

Explore conceptually related problems

Z = 2x + 3y x ge 0, y ge 0, 1 le x + 2y le10

3x + 4y le 60, x + 3y le 30, x ge 0, y ge 0

x-y le 2, x + y le 4 , x ge 0, y ge

The linear programming problem minimiseZ=3x+2y subject to the constraints x+y ge 8 3x +5y le 15 x ge 0, y ge 0 has

y - 2x le 1, x + y le 2, x ge 0, y ge 0

Z = 3x + 9y x + 3y le 60, x + y ge 10, x le y , x ge 0, y ge 0

3x + 2y le 14, 3x + y le 9, x,y ge 0

x + 2y le 40, 2x + y le 40, x ge 0, y ge 0