# Feasible Solution Set

__Corner Point OR Vertex:__

A point of a solution region where two of its boundary lines intersect is called a *corner point* or the *vertex* of the solution region.

__Problem Constraint:__

In a certain problem from everyday life each linear inequality concerning the problem is called the *problem constraint*.

__Non – Negative Constraint OR Decision Variables:__

The variables used in the system of linear inequalities relating to the problems of everyday life are non–negative and are called *non–negative constraints* or *decision variables*.

__Feasible Region:__

The solution region of an inequality restricted to the first quadrant is called the *feasible region*. In this case both $$x$$ and $$y$$ are always non–negative, i.e. $${\text{x}} \geqslant 0$$, $${\text{y}} \geqslant 0$$.

__Feasible Solution:__

Each point of the feasible region is called the *feasible solution* of the system of linear inequalities.

__Feasible Solution Set:__

A set consisting of all the feasible solutions of the system of linear inequalities is called the *feasible solution set*.

__Convex Region:__

If the line segment joining any two points of a certain region lies entirely within the region, then such a region is called the *convex region*, as shown in the figure.