A dual projective pivot algorithm for linear programming

A dual projective pivot algorithm for linear programming

0.00 Avg rating0 Votes
Article ID: iaor20051120
Country: Netherlands
Volume: 29
Issue: 3
Start Page Number: 333
End Page Number: 346
Publication Date: Dec 2004
Journal: Computational Optimization and Applications
Authors:
Keywords: duality
Abstract:

Recently, a linear programming problem solver, called dual projective simplex method, was proposed. 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.

Reviews

Required fields are marked *. Your email address will not be published.