IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v131y2001i2p417-439.html
   My bibliography  Save this article

Two direct methods in linear programming

Author

Listed:
  • Stojkovic, Nebojsa V.
  • Stanimirovic, Predrag S.

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
  • Handle: RePEc:eee:ejores:v:131:y:2001:i:2:p:417-439
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(00)00083-7
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. 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-.
    2. Gondzio, Jacek, 1995. "HOPDM (version 2.12) -- A fast LP solver based on a primal-dual interior point method," European Journal of Operational Research, Elsevier, vol. 85(1), pages 221-225, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. 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.
    2. 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.
    3. Syed Inayatullah & Nasir Touheed & Muhammad Imtiaz, 2015. "A Streamlined Artificial Variable Free Version of Simplex Method," PLOS ONE, Public Library of Science, vol. 10(3), pages 1-28, 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.
    1. 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.
    2. Maros, Istvan & Haroon Khaliq, Mohammad, 2002. "Advances in design and implementation of optimization software," European Journal of Operational Research, Elsevier, vol. 140(2), pages 322-337, July.
    3. Cosmin G. Petra & Florian A. Potra, 2019. "A homogeneous model for monotone mixed horizontal linear complementarity problems," Computational Optimization and Applications, Springer, vol. 72(1), pages 241-267, January.
    4. Terlaky, Tamas, 2001. "An easy way to teach interior-point methods," European Journal of Operational Research, Elsevier, vol. 130(1), pages 1-19, April.
    5. 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.
    6. Emmanuel Fragnière & Jacek Gondzio & Robert Sarkissian & Jean-Philippe Vial, 2000. "A Structure-Exploiting Tool in Algebraic Modeling Languages," Management Science, INFORMS, vol. 46(8), pages 1145-1158, August.
    7. Glineur, Francois, 2002. "Improving complexity of structured convex optimization problems using self-concordant barriers," European Journal of Operational Research, Elsevier, vol. 143(2), pages 291-310, December.
    8. Gondzio, Jacek & Kouwenberg, Roy & Vorst, Ton, 2003. "Hedging options under transaction costs and stochastic volatility," Journal of Economic Dynamics and Control, Elsevier, vol. 27(6), pages 1045-1068, April.
    9. 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.
    10. Gondzio, Jacek & González-Brevis, Pablo & Munari, Pedro, 2013. "New developments in the primal–dual column generation technique," European Journal of Operational Research, Elsevier, vol. 224(1), pages 41-51.
    11. Stanimirovic, Predrag S. & Stojkovic, Nebojsa V. & Kovacevic-Vujcic, Vera V., 2005. "Stabilization of Mehrotra's primal-dual algorithm and its implementation," European Journal of Operational Research, Elsevier, vol. 165(3), pages 598-609, September.
    12. G. Al-Jeiroudi & J. Gondzio, 2009. "Convergence Analysis of the Inexact Infeasible Interior-Point Method for Linear Optimization," Journal of Optimization Theory and Applications, Springer, vol. 141(2), pages 231-247, May.
    13. Peter Kall & János Mayer, 2006. "Some insights into the solution algorithms for SLP problems," Annals of Operations Research, Springer, vol. 142(1), pages 147-164, February.
    14. Peng, Jiming & Roos, Cornelis & Terlaky, Tamas, 2002. "A new class of polynomial primal-dual methods for linear and semidefinite optimization," European Journal of Operational Research, Elsevier, vol. 143(2), pages 234-256, December.
    15. Cosmin Petra & Mihai Anitescu, 2012. "A preconditioning technique for Schur complement systems arising in stochastic optimization," Computational Optimization and Applications, Springer, vol. 52(2), pages 315-344, June.
    16. Kouwenberg, Roy, 2001. "Scenario generation and stochastic programming models for asset liability management," European Journal of Operational Research, Elsevier, vol. 134(2), pages 279-292, October.
    17. Jacek Gondzio & Roy Kouwenberg, 2001. "High-Performance Computing for Asset-Liability Management," Operations Research, INFORMS, vol. 49(6), pages 879-891, December.
    18. Rehfeldt, Daniel & Hobbie, Hannes & Schönheit, David & Koch, Thorsten & Möst, Dominik & Gleixner, Ambros, 2022. "A massively parallel interior-point solver for LPs with generalized arrowhead structure, and applications to energy system models," European Journal of Operational Research, Elsevier, vol. 296(1), pages 60-71.
    19. 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.
    20. 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.

    More about this item

    Statistics

    Access and download statistics

    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:131:y:2001:i:2:p:417-439. 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.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.