A Dual Projective Pivot Algorithm for Linear Programming

Authors:
Ping-Qi Pan
Affiliations:
Department of Mathematics, Southeast University, People's Republic of China. panpq@seu.edu.cn
Venue:
Computational Optimization and Applications
Year:
2004

Citing 4
Cited 1

A dual approach to primal degeneracy

Mathematical Programming: Series A and B - Mathematical Models and Their Solutions
Steepest-edge simplex algorithms for linear programming

Mathematical Programming: Series A and B
Numerical Methods

Numerical Methods
The Dual Active Set Algorithm and Its Application to Linear Programming

Computational Optimization and Applications

Progress in the dual simplex algorithm for solving large scale LP problems: techniques for a fast and stable implementation

Computational Optimization and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, a linear programming problem solver, called dual projective simplex method, was proposed (Pan, Computers and Mathematics with Applications, vol. 35, no. 6, pp. 119–135, 1998). This algorithm requires a crash procedure to provide an initial (normal or deficient) basis. In this paper, it is recast in a more compact form so that it can get itself started from scratch with any dual (basic or nonbasic) feasible solution. A new dual Phase-1 approach for producing such a solution is proposed. Reported are also computational results obtained with a set of standard NETLIB problems.