A projective algorithm for linear programming with no regularity condition

Authors:
J.-P Vial
Affiliations:
Département d'Economie Commerciale et Industrielle, Université de Genève, Geneva, Switzerland
Venue:
Operations Research Letters
Year:
1992

Citing 3
Cited 0

A new polynomial-time algorithm for linear programming

Combinatorica
An extension of Karmarkar`s algorithm for solving a system of linear homogeneousequations on the simplex

Mathematical Programming: Series A and B
A unified approach to projective algorithms for linear programming

Proceedings of the international seminar on Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

The combined phase I-phase II projective algorithm of de Ghellinck and Vial solves any linear programming problem in its primal-dual formulation, without assuming any regularity condition. The method does not require artificial variables and/or constraints. It consists simply in minimizing the sum of all primal and dual variables. The present note is an alternative to a recent proposal of Anstreicher.