wiz-icon
MyQuestionIcon
MyQuestionIcon
2
You visited us 2 times! Enjoying our articles? Unlock Full Access!
Question

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

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

Objective function

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

Decision region

No worries! We‘ve got your back. Try BYJU‘S free classes today!
D
Optimal solution
No worries! We‘ve got your back. Try BYJU‘S free classes today!
Open in App
Solution

The correct option is A Feasible region

This question is based on the definition of feasible region. Let us take one example and try to understand feasible region using that.

Let the constraints for a linear problem be

x + y ≤ 4
x ≥ 0 and y ≥ 0

The region common to all these three regions are the shaded part in the figure given below

If we take any point from the shaded region, it will satisfy all the three inequalities or constraints. We call this shaded region the feasible region for this linear programming problem


flag
Suggest Corrections
thumbs-up
0
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
Graphical Method of Solving LPP
MATHEMATICS
Watch in App
Join BYJU'S Learning Program
CrossIcon