The solution of the set of constraints of a linear programming problem is a convex (open or closed) is called ______ region.

feasible

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

active

No worries! We‘ve got your back. Try BYJU‘S free classes today!

linear

No worries! We‘ve got your back. Try BYJU‘S free classes today!

none of these

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is A feasible
A solution of LPP is an infeasible solution if the system of constraints has no point which satisfies all the constraints and non-negativity restrictions. The common region determined by all the constraints of LPP is called feasible region and every point of this region is a feasible solution of the given LPP.

Suggest Corrections

Similar questions

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

The linear inequalities or equations or restrictions on the variables of a linear programming problem are called...... The conditions x ≥ 0, y ≥ 0 are called.......

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

Q. If the constraints in a linear programming problem are changed
(a) the problem is to be re-evaluated
(b) solution is not defined
(c) the objective function has to be modified
(d) the change in constraints is ignored

Which of the following are feasible solutions for a linear programming problem with constraints
x ≥0, y ≥ 0
3x+5y ≤ 15
5x+2y ≤ 10

Join BYJU'S Learning Program