A Streamlined Artificial Variable Free Version of Simplex Method
Author
Abstract
Suggested Citation
DOI: 10.1371/journal.pone.0116156
Download full text from publisher
References listed on IDEAS
- Harvey M. Wagner, 1956. "A Two-Phase Method for the Simplex Tableau," Operations Research, INFORMS, vol. 4(4), pages 443-447, August.
- Ron Shamir, 1987. "The Efficiency of the Simplex Method: A Survey," Management Science, INFORMS, vol. 33(3), pages 301-334, March.
- Oliver Serang, 2012. "Conic Sampling: An Efficient Method for Solving Linear and Quadratic Programming by Randomly Linking Constraints within the Interior," PLOS ONE, Public Library of Science, vol. 7(8), pages 1-12, August.
- 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.
- 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.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Rujira Visuthirattanamanee & Krung Sinapiromsaran & Aua-aree Boonperm, 2020. "Self-Regulating Artificial-Free Linear Programming Solver Using a Jump and Simplex Method," Mathematics, MDPI, vol. 8(3), pages 1-15, March.
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.- Csizmadia, Zsolt & Illés, Tibor & Nagy, Adrienn, 2012. "The s-monotone index selection rules for pivot algorithms of linear programming," European Journal of Operational Research, Elsevier, vol. 221(3), pages 491-500.
- Jesús Latorre & Santiago Cerisola & Andrés Ramos & Rafael Palacios, 2009. "Analysis of stochastic problem decomposition algorithms in computational grids," Annals of Operations Research, Springer, vol. 166(1), pages 355-373, February.
- Fabio Vitor & Todd Easton, 2018. "The double pivot simplex method," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 87(1), pages 109-137, February.
- Adrienn Csizmadia & Zsolt Csizmadia & Tibor Illés, 2018. "Finiteness of the quadratic primal simplex method when s-monotone index selection rules are applied," 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. 26(3), pages 535-550, September.
- van Eekelen, Wouter, 2023. "Distributionally robust views on queues and related stochastic models," Other publications TiSEM 9b99fc05-9d68-48eb-ae8c-9, Tilburg University, School of Economics and Management.
- Bahman Kalantari, 2015. "A characterization theorem and an algorithm for a convex hull problem," Annals of Operations Research, Springer, vol. 226(1), pages 301-349, March.
- Drexl, Andreas & Kimms, Alf, 1998. "Optimization guided lower and upper bounds for the resource investment problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 481, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
- Zs. Darvay & T. Illés & B. Kheirfam & P. R. Rigó, 2020. "A corrector–predictor interior-point method with new search direction for linear optimization," 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. 28(3), pages 1123-1140, September.
- Nabli, Hédi & Chahdoura, Sonia, 2015. "Algebraic simplex initialization combined with the nonfeasible basis method," European Journal of Operational Research, Elsevier, vol. 245(2), pages 384-391.
- Liu, Yanwu & Tu, Yan & Zhang, Zhongzhen, 2021. "The row pivoting method for linear programming," Omega, Elsevier, vol. 100(C).
- Ordónez, Fernando & Freund, Robert M., 2003. "Computational Experience and the Explanatory Value of Condition Numbers for Linear Optimization," Working papers 4337-02, Massachusetts Institute of Technology (MIT), Sloan School of Management.
- T. L. Morin & N. Prabhu & Z. Zhang, 2001. "Complexity of the Gravitational Method for Linear Programming," Journal of Optimization Theory and Applications, Springer, vol. 108(3), pages 633-658, March.
- Fabio Vitor & Todd Easton, 2022. "Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming," Computational Optimization and Applications, Springer, vol. 83(1), pages 211-246, September.
- Li, Wei, 2004. "A note on two direct methods in linear programming," European Journal of Operational Research, Elsevier, vol. 158(1), pages 262-265, October.
- Konstantinos Paparrizos & Nikolaos Samaras & Angelo Sifaleras, 2015. "Exterior point simplex-type algorithms for linear and network optimization problems," Annals of Operations Research, Springer, vol. 229(1), pages 607-633, June.
- Antimo Barbato & Antonio Capone, 2014. "Optimization Models and Methods for Demand-Side Management of Residential Users: A Survey," Energies, MDPI, vol. 7(9), pages 1-38, September.
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:plo:pone00:0116156. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.