Key feature that optimal solutions for linear programming problems occur at one of the vertices or corner points of the feasible region defined by the constraints.

It is a feasible region is a point in the region which is the intersection of two boundary lines.

An optimal Solution must lie at one or more corner points

it is a corner point and can also be the best solution point 

The corner points are the vertices of the feasible region. 

It is where the best solution to the linear programming problem is located.

It is where you will find the optimal solutions

it is serve as the only feasible solution points where the best solution to the linear programming issue can be found at the intersections of constraint boundaries.

This is an optimal solution must lie on one or many points

a point where you find the best solutions

It is the location of the best answer to the linear programming problem.

Corner points is a point or area where two or more edges.

corner point is a vertex in a feasible region and it determined by linear constraints