Long steps in an O(n3L) algorithm for linear programming

Long steps in an O(n3L) algorithm for linear programming

0.00 Avg rating0 Votes
Article ID: iaor1993735
Country: Netherlands
Volume: 54
Issue: 3
Start Page Number: 251
End Page Number: 265
Publication Date: Mar 1992
Journal: Mathematical Programming (Series A)
Authors: ,
Keywords: computational analysis
Abstract:

The authors consider partial updating in Ye’s affine potential reduction algorithm for linear programming. They show that using a Gold

Reviews

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