Feasible Region

Q. The common region determined by all the constraints including the non-negative constraints x ≥ 0 and y ≥ 0 of a linear programming problem is called

1. Decision region

2. Optimal solution
3. Feasible region

4. Objective function

Q.

Which of the given solids has the maximum number of vertices?

1. Cuboid

2. Cylinder

3. Cone

4. Sphere

Q. The constraints x + y ≤ 4, x ≥ 0 and y ≥ 0 gives an unbounded feasible region for the linear programming problem with the same constraints

1. True
2. False