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

Yanqin Ma, Lili Zhang and Pingqi Pan

Applied Mathematics and Computation, 2015, vol. 268, issue C, 439-449

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.

Keywords: Criss-cross; Most-obtuse-angle; Deficient basis (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300315008619
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:268:y:2015:i:c:p:439-449

DOI: 10.1016/j.amc.2015.06.080

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().