In the graphical approach of linear programming, a point in the feasible region where two or more constraints cross is called a corner point, sometimes known as a vertex. These locations are important because, in linear programming, one of the feasible region's corner points is usually where the best solution—maximizing or reducing the objective function—is discovered. The viable zone is a polygon (or polyhedron in higher dimensions) produced by the set of constraints, where each corner point denotes a possible contender for the best solution. The best answer can be found by analyzing the objective function at each corner point.

A corner point refers to a point where the constraint lines intersect, representing a potential solution to the optimization problem, typically where the objective function attains its maximum or minimum value within the feasible region.

A corner point (vertex) in the graphical method of linear programming is a point where two or more constraint lines intersect.

A corner point (or vertex) in the graphical method of linear programming is a point where two or more constraints intersect. These points are potential candidates for the optimal solution, as the optimal value typically occurs at one of the vertices of the feasible region

The corner points are the vertices of the feasible region. Once you have the graph of the system of linear inequalities, then you can look at the graph and easily tell where the corner points are.