A new polynomial-time algorithm for LP

A new polynomial-time algorithm for LP

0.00 Avg rating0 Votes
Article ID: iaor20001106
Country: China
Volume: 19
Issue: 1
Start Page Number: 34
End Page Number: 38
Publication Date: Jan 1996
Journal: Acta Mathematicae Applicatae Sinica
Authors: , ,
Abstract:

In this paper, the authors present a new polynomial-time algorithm for linear programming, which has a family of feasible directions at each iteration step. Meanwhile, the switch strategy is used. By all these means, it is possible to reduce the amount of calculations for inverse matrix greatly. Finally, it is proved that the algorithm can be stopped in O(nL) iterations.

Reviews

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