An exterior point simplex algorithm for (general) linear programming problems

An exterior point simplex algorithm for (general) linear programming problems

0.00 Avg rating0 Votes
Article ID: iaor19941143
Country: Switzerland
Volume: 46/47
Issue: 1/4
Start Page Number: 497
End Page Number: 508
Publication Date: Dec 1993
Journal: Annals of Operations Research
Authors:
Abstract:

The paper presents an exterior point simplex type algorithm that possesses a new monotonic property. A dual feasible basic solution is required to start with. Intermediate solutions are neither primal nor dual feasible. Cycling-free pivoting rules and an exponential example are presented.

Reviews

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