Home › JEE Main › mathematics › Linear Programming › The corner points of a feasible region are obtai…
The corner points of a feasible region are obtained as the:
Acentres of the region
Bintersections of the boundary lines of the constraints
Corigin and axes only
Dmidpoints of each constraint
Answer & Solution
Correct answer: B. intersections of the boundary lines of the constraints
Corner points are the vertices where the boundary lines of the constraints intersect.
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