返回
A primal deficient-basis simplex algorithm for linear programming
DOI:10.1016/j.amc.2007.07.030.png)
摘要
En 中文
The standard basis, which plays a fundamental role in simplex methodology, was recently extended to include a deficient case (with fewer columns than rows) by taking advantage of primal degeneracy. Computational results have been favorable with dense implementations. In this paper, we propose a primal simplex algorithm using sparse LU factors of deficient bases. Amenable to real-world linear programming problems, which are often degenerate or even highly degenerate, the algorithm would solve them with potentially improved stability compared to the simplex algorithm. The proposed algorithm has been implemented and tested on a set of 50 Netlib test problems as well as a set of 15 much larger real-world problems, including 8 Kennington and 5 BPMPD problems. It significantly outperformed MINOS 5.3 in terms of both iteration counts and run time. In particular,. these results reveal that there is no inevitable correlation between an algorithm's inefficiency and degeneracy (contradicting common belief). (C) 2007 Elsevier Inc. All rights reserved.
Keyword:
large-scale linear programming
simplex algorithm
primal degeneracy
deficient-basis
LU factorization
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
暂无机构信息
引用论文
Role of Interleukin 28B Polymorphisms in Response to Interferon Based Therapy for Hepatitis C Virus Clearance白细胞介素28B多态性在干扰素为基础的治疗清除丙型肝炎病毒中的作用
Is Collective Efficacy Age Graded? The Development and Evaluation of a New Measure of Collective Efficacy for Older Adults集体效能是否按年龄分级?老年人集体效能新量表的编制与评价
Effect of residue management on productivity and economics of pearlmillet (Pennisetum glaucum)-based cropping system under zero-till condition零耕条件下,残茬管理对珍珠粟(Pennisetum glaucum)为基础的轮作体系生产力与经济性的影响

