A unified view of interior point methods for linear programming

A unified view of interior point methods for linear programming

0.00 Avg rating0 Votes
Article ID: iaor1990300
Country: Switzerland
Volume: 22
Start Page Number: 55
End Page Number: 70
Publication Date: Jan 1990
Journal: Annals of Operations Research
Authors: ,
Abstract:

The paper shows how various interior point methods for linear programming may all be derived from logarithmic barrier methods. These methods include primal and dual projective methods, affine methods, and methods based on the method of centers. In particular, the paper demonstrates that Karmarkar’s algorithm is equivalent to a classical logarithmic barrier method applied to a problem in standard form.

Reviews

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