For a linear programming equations, convex set of equations is included in region of

feasible solutions

In order for a linear programming problem to have a unique solution, the solution must exist at the intersection of two or more constraints. Then the problem becomes convex and has a single optimum(maximum or minimum) solution. Therefore the convex set of equations is included in the feasible region.