Abstract

In a linear programming problem involving maximization (or minimization) of the objective function the set of feasible points is often required to be bounded above (or below). A criterion based on the simplex method which requires the constraints coefficients of the entering variable to be zero or negative for the set of feasible points to be unbounded is often used. In this paper, the necessary and sufficient conditions for the set of feasible points of the system of linear inequalities to be bounded are stated and proved. These conditions which do not require the knowledge of the entering variable are illustrated with examples.

This work is licensed under a Creative Commons Attribution 4.0 License.