A linear programming primer: from Fourier to Karmarkar
Author
Abstract
Suggested Citation
DOI: 10.1007/s10479-019-03186-2
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
- Robert E. Bixby, 1994. "Commentary—Progress in Linear Programming," INFORMS Journal on Computing, INFORMS, vol. 6(1), pages 15-22, February.
- Michael J. Todd, 1994. "Commentary—Theory and Practice for Interior-Point Methods," INFORMS Journal on Computing, INFORMS, vol. 6(1), pages 28-31, February.
- Nimrod Megiddo, 1991. "On Finding Primal- and Dual-Optimal Bases," INFORMS Journal on Computing, INFORMS, vol. 3(1), pages 63-65, February.
- I. Adler & S. Cosares, 1991. "A Strongly Polynomial Algorithm for a Special Class of Linear Programs," Operations Research, INFORMS, vol. 39(6), pages 955-960, December.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- In Lee, 2020. "Internet of Things (IoT) Cybersecurity: Literature Review and IoT Cyber Risk Management," Future Internet, MDPI, vol. 12(9), pages 1-21, September.
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.- Erling D. Andersen, 1999. "On Exploiting Problem Structure in a Basis Identification Procedure for Linear Programming," INFORMS Journal on Computing, INFORMS, vol. 11(1), pages 95-103, February.
- Samuel Bismuth & Ivan Bliznets & Erel Segal-Halevi, 2019. "Fair Division with Bounded Sharing: Binary and Non-Degenerate Valuations," Papers 1912.00459, arXiv.org, revised Jul 2024.
- Alper Atamtürk & Andrés Gómez, 2017. "Maximizing a Class of Utility Functions Over the Vertices of a Polytope," Operations Research, INFORMS, vol. 65(2), pages 433-445, March-Apr.
- Yann Briheche & Frederic Barbaresco & Fouad Bennis & Damien Chablat, 2018. "Theoretical Complexity of Grid Cover Problems Used in Radar Applications," Journal of Optimization Theory and Applications, Springer, vol. 179(3), pages 1086-1106, December.
- Yinyu Ye, 2011. "The Simplex and Policy-Iteration Methods Are Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate," Mathematics of Operations Research, INFORMS, vol. 36(4), pages 593-603, November.
- Robert E. Bixby, 2002. "Solving Real-World Linear Programs: A Decade and More of Progress," Operations Research, INFORMS, vol. 50(1), pages 3-15, February.
- László A. Végh, 2017. "A Strongly Polynomial Algorithm for Generalized Flow Maximization," Mathematics of Operations Research, INFORMS, vol. 42(1), pages 179-211, January.
More about this item
Keywords
Linear inequalities; Linear programming; Optimisation; Duality; Simplex method; Ellipsoid method; Interior point method; Monotone;All these keywords.
Statistics
Access and download statisticsCorrections
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:spr:annopr:v:287:y:2020:i:2:d:10.1007_s10479-019-03186-2. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.