IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v268y2015icp439-449.html
   My bibliography  Save this article

Criss-cross algorithm based on the most-obtuse-angle rule and deficient basis

Author

Listed:
  • Ma, Yanqin
  • Zhang, Lili
  • Pan, Pingqi

Abstract

To improve computational efficiency, a new criss-cross algorithm based on the most-obtuse-angle pivoting index rule and deficient basis algorithm is proposed in this paper to solve linear programming problems. We do numerical test values with the 25 standard NETLIB problems, preliminary computational tests demonstrate that the new algorithm overcomes computational difficulties yielding from degeneracy, and reduces the number of iterations and the overall computation time. In addition, the new algorithm has greatly simplified unbound or infeasible conditions to make it more practical. So far, the numerical experimental results show that the new algorithm is promising and is able to implement under the sparse structure, in order to apply to large scale sparse problem.

Suggested Citation

  • Ma, Yanqin & Zhang, Lili & Pan, Pingqi, 2015. "Criss-cross algorithm based on the most-obtuse-angle rule and deficient basis," Applied Mathematics and Computation, Elsevier, vol. 268(C), pages 439-449.
    • Handle: RePEc:eee:apmaco:v:268:y:2015:i:c:p:439-449
    DOI: 10.1016/j.amc.2015.06.080
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300315008619
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2015.06.080?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. Stanley Zionts, 1969. "The Criss-Cross Method for Solving Linear Programming Problems," Management Science, INFORMS, vol. 15(7), pages 426-445, March.
    2. Guerrero-Garcia, Pablo & Santos-Palomo, Angel, 2005. "Phase I cycling under the most-obtuse-angle pivot rule," European Journal of Operational Research, Elsevier, vol. 167(1), pages 20-27, November.
    3. Pan, Ping-Qi, 1997. "The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study," European Journal of Operational Research, Elsevier, vol. 101(1), pages 164-176, August.
    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. Guerrero-Garcia, Pablo & Santos-Palomo, Angel, 2005. "Phase I cycling under the most-obtuse-angle pivot rule," European Journal of Operational Research, Elsevier, vol. 167(1), pages 20-27, November.
    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.
    3. Shi, Yangyang & Zhang, Lei-Hong & Zhu, Wenxing, 2018. "A review of “linear programming computation” by Ping-Qi Pan," European Journal of Operational Research, Elsevier, vol. 267(3), pages 1182-1183.
    4. 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.
    5. Zhang, S., 1997. "New variants of finite criss-cross pivot algorithms for linear programming," Econometric Institute Research Papers EI 9707-/A, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    6. Zhang, Shuzhong, 1999. "New variants of finite criss-cross pivot algorithms for linear programming," European Journal of Operational Research, Elsevier, vol. 116(3), pages 607-614, August.
    7. 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.
    8. 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.
    9. van Dam, Wim & Telgen, Jan, 1978. "Some Computational Experiments With A Primal-Dual Surrogate Simplex Algorithm," Econometric Institute Archives 272174, Erasmus University Rotterdam.
    10. Santos-Palomo, Angel, 2004. "The sagitta method for solving linear programs," European Journal of Operational Research, Elsevier, vol. 157(3), pages 527-539, 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:eee:apmaco:v:268:y:2015:i:c:p:439-449. 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: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.