Home › Maharashtra HSC (Class 12) › 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
Two depots hold 180 and 250 tons; two customers order 200 and 150 tons. After the cheapestA gardener needs AT LEAST 10 units of chemical A. A jar gives 5 units and a carton 1 unit.A gardener needs at least 10, 12 and 12 units of chemicals A, B and C. Jars cost 3,000 andMine A gives 1, 3 and 5 tons of high, medium and low grade ore daily; mine B gives 2 tons Profit is Shs. 3000 on a ring and Shs. 1900 on a chain. With $x$ rings and $y$ chains, theA firm makes $x$ rings and $y$ chains, at most 24 items a day. A ring takes 1 hour, a chaiSome problems minimise a linear function subject to given:A linear programming problem must have constraints that are: