A hybrid polynomial algorithm for linear programming

A hybrid polynomial algorithm for linear programming

0.00 Avg rating0 Votes
Article ID: iaor20001132
Country: China
Volume: 9
Issue: 1
Start Page Number: 67
End Page Number: 75
Publication Date: Jan 1996
Journal: Journal of Systems Science and Complexity
Authors: ,
Abstract:

In this paper, the authors propose a ‘long step’ double scaling algorithm. Its local performance has been compared with those of potential-reduction algorithms. On the basis of this analysis, the authors introduce a polynomial algorithm which combines scaling-steps and potential-reduction steps. The algorithm terminates in O(√(n)L) iterations.

Reviews

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