A Penalty Based Simplex Method for Linear Programming
We give a general description of a new advanced implementation of the simplex method for linear programming. The method ``decouples'' a notion of the simplex basic solution into two independent entities: a solution and a basis. This generalization makes it possible to incorporate new strategies into the algorithm since the iterates no longer need to be the vertices of the simplex. An advantage of such approach is a possibility of taking steps along directions that are not simplex edges (in principle they can even cross the interior of the feasible set). It is exploited in our new approach to finding the initial solution in which global infeasibility is handled through a dynamically adjusted penalty term. We present several new techniques that have been incorporated into the method. These features include: previously mentioned method for finding an initial solution, an original approximate steepest edge pricing algorithm, dynamic adjustment of the penalty term. The presence of the new crashing and restart procedures based on the penalty term make the algorithm particularly suitable for sequential ``warm start'' calls when solving subproblems in decomposition approaches. The same features may be used in post optimal analysis. The efficiency of the new features is demonstrated when running the method on a subset of difficult linear programs from the NETLIB collection.
|Date of creation:||Jan 1995|
|Contact details of provider:|| Postal: A-2361 Laxenburg|
Web page: http://www.iiasa.ac.at/Publications/Catalog/PUB_ONLINE.html
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Robert E. Bixby, 1992. "Implementing the Simplex Method: The Initial Basis," INFORMS Journal on Computing, INFORMS, vol. 4(3), pages 267-284, August.
- A.P. Wierzbicki, 1993. "Augmented Simplex: A Modified and Parallel Version of Simplex Method Based on Multiple Objective and Subdifferential Optimization Approach," Working Papers wp93059, International Institute for Applied Systems Analysis.
- Uwe H. Suhl & Leena M. Suhl, 1990. "Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases," INFORMS Journal on Computing, INFORMS, vol. 2(4), pages 325-335, November.
- A. Ruszczynski, 1993. "Regularized Decomposition of Stochastic Programs: Algorithmic Techniques and Numerical Results," Working Papers wp93021, International Institute for Applied Systems Analysis.
When requesting a correction, please mention this item's handle: RePEc:wop:iasawp:wp95005. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Thomas Krichel)
If references are entirely missing, you can add them using this form.