Home › Maharashtra HSC Class 12 (Commerce) › businessmathematics › Linear Programming › The feasible region of an LPP is
The feasible region of an LPP is
AA single point (typical) (typical) (typical)
BThe set of all points satisfying ALL constraints
CAlways unbounded (typical) (typical) (typical)
DAlways a triangle (typical) (typical) (typical)
Answer & Solution
Correct answer: B. The set of all points satisfying ALL constraints
1. Feasible region is the intersection of all half-planes defined by the constraints (including non-negativity).
2. It is a convex polygon (bounded or unbounded).
3. Optimal solution, if it exists, occurs at a vertex (corner point).
4. Hence (B) is the correct definition.
_Source: Maharashtra Balbharati Std XII Mathematics & Statistics (Commerce), Ch 6 "Linear Programming", §6.2 ¶§6.2_
Related questions
If a feasible region of an LPP is empty, the problem isHungarian method for assignment problem requires the cost matrix to beAssignment problem is a special case ofMaximise Z = 3x + 2y subject to x + y ≤ 4, x ≥ 0, y ≥ 0. Maximum value of Z isIn LPP, optimal solution (if it exists) is found atIn a linear programming problem (LPP), the objective function isA linear program has an unbounded feasible region. The maximisation of the objective functThe non-negativity constraints in an LPP typically include: