Polynomial affine algorithms for linear programming

Polynomial affine algorithms for linear programming

0.00 Avg rating—0 Votes
Article ID: iaor19921147
Country: Netherlands
Volume: 49
Issue: 1
Start Page Number: 7
End Page Number: 21
Publication Date: Nov 1990
Journal: Mathematical Programming
Authors:
Abstract:

The method of steepest descent with scaling (affine scaling) applied to the potential function equ1solves the linear programming problem in polynomial time for equ2. If equ3, then the algorithm terminates in no more than equ4iterations; if equ5with equ6then it takes no more than equ7iterations. A modified algorithm using rank-1 updates for matrix inversions achieves respectively equ8and missing1arithmetic computations.

Reviews

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