Feasible region: In mathematical optimization, a feasible region, feasible set, search space, or solution space is the set of all possible points (sets of values of the choice variables) of an optimization problem that satisfy the problem's constraints, potentially including inequalities, equalities, and integer constraints.

Corner point property: The corner points are the vertices of the feasible region. In linear programming, at least one corner point is an optimal solution. The principle states that there is a corner point of the feasible region that yields the optimal solution.

Optimal solution: In linear programming, at least one corner point is an optimal solution. The principle states that there is a corner point of the feasible region that yields the optimal solution. The maximum or minimum value of the objective function is obtained at one of the corner points of the feasible region.