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

Advances in design and implementation of optimization software

Author

Listed:
  • Maros, Istvan
  • Haroon Khaliq, Mohammad

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:140:y:2002:i:2:p:322-337
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(02)00072-3
    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. Robert E. Bixby, 1992. "Implementing the Simplex Method: The Initial Basis," INFORMS Journal on Computing, INFORMS, vol. 4(3), pages 267-284, August.
    2. Maros, Istvan, 1986. "A general Phase-I method in linear programming," European Journal of Operational Research, Elsevier, vol. 23(1), pages 64-77, January.
    3. 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.
    4. 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.
    5. 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.
    6. 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-.
    7. 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.
    8. 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.
    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. 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.
    2. 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.
    1. 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.
    2. Gondzio, Jacek, 2012. "Interior point methods 25 years later," European Journal of Operational Research, Elsevier, vol. 218(3), pages 587-601.
    3. A. Swietanowski, 1995. "A Penalty Based Simplex Method for Linear Programming," Working Papers wp95005, International Institute for Applied Systems Analysis.
    4. 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.
    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. 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.
    7. A. Swietanowski, 1995. "A Modular Presolve Procedure for Large Scale Linear Programming," Working Papers wp95113, International Institute for Applied Systems Analysis.
    8. 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.
    9. Ricardo Fukasawa & Laurent Poirrier, 2019. "Permutations in the Factorization of Simplex Bases," INFORMS Journal on Computing, INFORMS, vol. 31(3), pages 612-632, July.
    10. Duarte Jr, A. M., 2000. "Fast Computation of Efficient Portfolios," Finance Lab Working Papers flwp_32, Finance Lab, Insper Instituto de Ensino e Pesquisa.
    11. 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.
    12. Gondzio, Jacek, 2016. "Crash start of interior point methods," European Journal of Operational Research, Elsevier, vol. 255(1), pages 308-314.
    13. Marianna E.-Nagy & Anita Varga, 2023. "A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation," 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. 31(3), pages 691-711, September.
    14. Freund, Robert Michael. & Mizuno, Shinji., 1996. "Interior point methods : current status and future directions," Working papers 3924-96., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    15. Ndayikengurutse Adrien & Huang Siming, 2020. "Implementation of Presolving and Interior-Point Algorithm for Linear & Mixed Integer Programming: SOFTWARE," Journal of Systems Science and Information, De Gruyter, vol. 8(3), pages 195-223, June.
    16. Maros, Istvan, 2003. "A generalized dual phase-2 simplex algorithm," European Journal of Operational Research, Elsevier, vol. 149(1), pages 1-16, August.
    17. Im, Haesol & Wolkowicz, Henry, 2023. "Revisiting degeneracy, strict feasibility, stability, in linear programming," European Journal of Operational Research, Elsevier, vol. 310(2), pages 495-510.
    18. 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.
    19. 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.
    20. István Maros, 2010. "Computational study of the GDPO dual phase-1 algorithm," Computational Management Science, Springer, vol. 7(2), pages 207-223, 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: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.

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