Advances in design and implementation of optimization software
Author
Abstract
Suggested Citation
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Maros, Istvan, 1986. "A general Phase-I method in linear programming," European Journal of Operational Research, Elsevier, vol. 23(1), pages 64-77, January.
- Ilan Adler & Narendra Karmarkar & Mauricio G. C. Resende & Geraldo Veiga, 1989. "Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm," INFORMS Journal on Computing, INFORMS, vol. 1(2), pages 84-106, May.
- István Maros & Gautam Mitra, 1998. "Strategies for Creating Advanced Bases for Large-Scale Linear Programming Problems," INFORMS Journal on Computing, INFORMS, vol. 10(2), pages 248-260, May.
- Jacek Gondzio, 1997. "Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method," INFORMS Journal on Computing, INFORMS, vol. 9(1), pages 73-91, February.
- Robert E. Bixby, 1992. "Implementing the Simplex Method: The Initial Basis," INFORMS Journal on Computing, INFORMS, vol. 4(3), pages 267-284, August.
- Kevin A. McShane & Clyde L. Monma & David Shanno, 1989. "An Implementation of a Primal-Dual Interior Point Method for Linear Programming," INFORMS Journal on Computing, INFORMS, vol. 1(2), pages 70-83, May.
- 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.
- Andersen, E.D. & Gondzio, J. & Meszaros, C. & Xu, X., 1996. "Implementation of Interior Point Methods for Large Scale Linear Programming," Papers 96.3, Ecole des Hautes Etudes Commerciales, Universite de Geneve-.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Sophia Voulgaropoulou & Nikolaos Samaras & Nikolaos Ploskas, 2022. "Predicting the Execution Time of the Primal and Dual Simplex Algorithms Using Artificial Neural Networks," Mathematics, MDPI, vol. 10(7), pages 1-21, March.
- Péter Tar & Bálint Stágel & István Maros, 2017. "Parallel search paths for the simplex algorithm," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 25(4), pages 967-984, December.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Jeffery L. Kennington & Karen R. Lewis, 2004. "Generalized Networks: The Theory of Preprocessing and an Empirical Analysis," INFORMS Journal on Computing, INFORMS, vol. 16(2), pages 162-173, May.
- Gondzio, Jacek, 2012. "Interior point methods 25 years later," European Journal of Operational Research, Elsevier, vol. 218(3), pages 587-601.
- A. Swietanowski, 1995. "A Penalty Based Simplex Method for Linear Programming," Working Papers wp95005, International Institute for Applied Systems Analysis.
- Illes, Tibor & Terlaky, Tamas, 2002. "Pivot versus interior point methods: Pros and cons," European Journal of Operational Research, Elsevier, vol. 140(2), pages 170-190, July.
- Terlaky, Tamas, 2001. "An easy way to teach interior-point methods," European Journal of Operational Research, Elsevier, vol. 130(1), pages 1-19, April.
- Stojkovic, Nebojsa V. & Stanimirovic, Predrag S., 2001. "Two direct methods in linear programming," European Journal of Operational Research, Elsevier, vol. 131(2), pages 417-439, June.
- Jacek Gondzio & Andreas Grothey, 2009. "Exploiting structure in parallel implementation of interior point methods for optimization," Computational Management Science, Springer, vol. 6(2), pages 135-160, May.
- María Gonzalez-Lima & Aurelio Oliveira & Danilo Oliveira, 2013. "A robust and efficient proposal for solving linear systems arising in interior-point methods for linear programming," Computational Optimization and Applications, Springer, vol. 56(3), pages 573-597, December.
- Paparrizos, Konstantinos & Samaras, Nikolaos & Stephanides, George, 2003. "An efficient simplex type algorithm for sparse and dense linear programs," European Journal of Operational Research, Elsevier, vol. 148(2), pages 323-334, July.
- Qi Huangfu & J. Hall, 2015. "Novel update techniques for the revised simplex method," Computational Optimization and Applications, Springer, vol. 60(3), pages 587-608, April.
- A. Swietanowski, 1995. "A Modular Presolve Procedure for Large Scale Linear Programming," Working Papers wp95113, International Institute for Applied Systems Analysis.
- Maziar Salahi & Renata Sotirov & Tamás Terlaky, 2004. "On self-regular IPMs," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 12(2), pages 209-275, December.
- Luca Bergamaschi & Jacek Gondzio & Manolo Venturin & Giovanni Zilli, 2007. "Inexact constraint preconditioners for linear systems arising in interior point methods," Computational Optimization and Applications, Springer, vol. 36(2), pages 137-147, April.
- Miles Lubin & J. Hall & Cosmin Petra & Mihai Anitescu, 2013. "Parallel distributed-memory simplex for large-scale stochastic LP problems," Computational Optimization and Applications, Springer, vol. 55(3), pages 571-596, July.
- R. Almeida & A. Teixeira, 2015. "On the convergence of a predictor-corrector variant algorithm," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 23(2), pages 401-418, July.
- Alper Atamtürk & Martin Savelsbergh, 2005. "Integer-Programming Software Systems," Annals of Operations Research, Springer, vol. 140(1), pages 67-124, November.
- Meszaros, Csaba, 1997. "The augmented system variant of IPMs in two-stage stochastic linear programming computation," European Journal of Operational Research, Elsevier, vol. 101(2), pages 317-327, September.
- Ricardo Fukasawa & Laurent Poirrier, 2019. "Permutations in the Factorization of Simplex Bases," INFORMS Journal on Computing, INFORMS, vol. 31(3), pages 612-632, July.
- Daniel E. Steffy & Kati Wolter, 2013. "Valid Linear Programming Bounds for Exact Mixed-Integer Programming," INFORMS Journal on Computing, INFORMS, vol. 25(2), pages 271-284, May.
- Fernanda Raupp & B. Svaiter, 2009. "Analytic center of spherical shells and its application to analytic center machine," Computational Optimization and Applications, Springer, vol. 43(3), pages 329-352, July.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:140:y:2002:i:2:p:322-337. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.