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

Algebraic simplex initialization combined with the nonfeasible basis method

Author

Listed:
  • Nabli, Hédi
  • Chahdoura, Sonia

Abstract

We propose, in this paper, a new method to initialize the simplex algorithm. This approach does not involve any artificial variables. It can detect also the redundant constraints or infeasibility, if any. Generally, the basis found by this approach is not feasible. To achieve feasibility, this algorithm appeals to the nonfeasible basis method (NFB). Furthermore, we propose a new pivoting rule for NFB method, which shows to be beneficial in both numerical and time complexity. When solving a linear program, we develop an efficient criterion to decide in advance which algorithm between NFB and formal nonfeasible basis method seems to be more rapid. Comparative analysis is carried out with a set of standard test problems from Netlib. Our computational results indicate that the proposed algorithm is more advantageous than two-phase and perturbation algorithm in terms of number of iterations, number of involved variables, and also computational time.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:245:y:2015:i:2:p:384-391
    DOI: 10.1016/j.ejor.2015.03.040
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221715002623
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2015.03.040?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. 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.
    2. 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.
    Full references (including those not matched with items on IDEAS)

    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. 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.
    2. 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.
    3. 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.
    4. 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.

    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:245:y:2015:i:2:p:384-391. 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.