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

Verified by Experts

The correct Answer is:

B

Promotional Banner

Promotional Banner

Recommended Questions

In a linear programming problem, the constraints on the decision varia...
Text Solution
|
The area of the feasible region for the following constraints 3y +x g...
Text Solution
|
Solve the linear programming problem. Maximise Z = x + 2y Subject ...
Text Solution
|
z= 5x + 3y का अधिक्तमीकरण कीजिए, जबकि अवरोध निम्न है - x + 3y le 5 ...
Text Solution
|
आलेखीय विधि से निम्न रैखिक प्रोग्रामन समस्या को हल कीजिए- निम्न व्यव...
Text Solution
|
(a) Draw the feasible region of inequation: x + y le 4, x ge 0, y ge...
Text Solution
|
Solve the following linear programming problem graphically : Maximize ...
Text Solution
|
Solve the following linear programming problem graphically : Minimize ...
Text Solution
|
For linear programming x+2y ge 10, 3x+4y le 24" and "x ge 0, y ge 0 ……...
Text Solution
|