In this pedagogical note we present an improved method to solve and analyze linear programming (LP) problems. The method depends on solving a system of equations and is free of any slack, surplus or artificial variables. The proposed method eliminates the need to manipulate linear inequalities to introduce additional variables and works only within the original decision variables space. We present applications of the method to handle linear optimization with varying objective function. The proposed method is easy to implement and enhances understanding of the simplex method and LP solvers transparent. We believe it is a useful alternative approach to present LP in the class room during the first few hours of introducing the subject.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Publisher Info
Article provided by Elsevier in its journal Omega.
Volume (Year): 37 (2009) Issue (Month): 4 (August) Pages: 876-882 Download reference. The following formats are available: HTML
(with abstract),
plain text
(with abstract),
BibTeX,
RIS (EndNote, RefMan, ProCite),
ReDIF