Home › UP Board Class 12 › mathematics › Linear Programming › By the corner-point theorem, the optimum of a bo…
By the corner-point theorem, the optimum of a bounded LPP occurs:
AAt the centroid of the feasible region on the school chart
BAt a vertex (corner point) of the feasible region on the chart
COnly at the origin of the coordinate plane on the school chart
DOn the boundary of the feasible region, but never at a corner
Answer & Solution
Correct answer: B. At a vertex (corner point) of the feasible region on the chart
A bounded LPP attains its optimum at a vertex of the feasible region.
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 atThe feasible region of an LPP isIn a linear programming problem (LPP), the objective function isA linear program has an unbounded feasible region. The maximisation of the objective funct