On Boundness Conditions for the Set of Feasible Points of Systems of Linear Inequalities

E. O. Effanga, Z. Lipcsey, M. E. Nja

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.

Full Text: PDF DOI: 10.5539/jmr.v4n2p57

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

Journal of Mathematics Research   ISSN 1916-9795 (Print)   ISSN 1916-9809 (Online)

Copyright © Canadian Center of Science and Education

To make sure that you can receive messages from us, please add the 'ccsenet.org' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.