New complexity results for the Iri-Imai method

New complexity results for the Iri-Imai method

0.00 Avg rating0 Votes
Article ID: iaor19971571
Country: Netherlands
Volume: 62
Issue: 1
Start Page Number: 539
End Page Number: 564
Publication Date: Mar 1996
Journal: Annals of Operations Research
Authors: ,
Abstract:

In this paper, the authors show that the number of main iterations required by the Iri-Imai algorithm to solve a linear programming problem is equ1. Moreover, they show that a modification of this algorithm requires only equ2 main iterations. In this modification, the authors measure progress by means of a primal-dual potential function.

Reviews

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