Lemke paths on simple polytopes

Lemke paths on simple polytopes

0.00 Avg rating0 Votes
Article ID: iaor19951500
Country: United States
Volume: 19
Issue: 4
Start Page Number: 780
End Page Number: 789
Publication Date: Nov 1994
Journal: Mathematics of Operations Research
Authors:
Keywords: programming: nonlinear
Abstract:

Lemke paths are often used in the solution of nonlinear programming problems. The paper investigates a number of properties of Lemke paths, motivated by the d-step conjecture for linear programming. Some negative results are presented, including families of Lemke paths, for which the length of the shortest grows exponentially, joining pairs of vertices of a sequence of polytopes.

Reviews

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