An optimal basis identification criterion for interior-point linear programming algorithms

An optimal basis identification criterion for interior-point linear programming algorithms

0.00 Avg rating0 Votes
Article ID: iaor19981921
Country: China
Volume: 18
Issue: 2
Start Page Number: 215
End Page Number: 224
Publication Date: May 1996
Journal: Mathematica Numerica Sinica
Authors:
Keywords: interior point methods
Abstract:

In this paper, the properties of an indicator vector for identifying an optimal basis of linear programming problem are analyzed in the interior-point algorithms, and under suitable assumptions an optimal basis identification criterion is presented during the iterative process.

Reviews

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