alleryThe 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.
Keep practising Linear Programming
Browse all Linear Programming questions for AP Intermediate 2nd Year, or explore more Mathematics topics.
Related questions
Linear programming problems seek to maximise or:If the feasible region is unbounded, an optimum may:Linear programming numbersFeasible or infeasible?If the feasible region R is bounded, Z has:The optimal value of Z occurs at which points of the region?Linear programming problems here are solved by which method?Points within and on the boundary of the feasible region are: