A global convergence theorem for aggregation algorithms

A global convergence theorem for aggregation algorithms

0.00 Avg rating0 Votes
Article ID: iaor1988280
Country: Germany
Volume: 19
Start Page Number: 819
End Page Number: 828
Publication Date: Dec 1988
Journal: Optimization
Authors:
Abstract:

In this paper conditions are given to assure global convergence for a broad class of aggregation algorithms of linear programming. For a more restrictive class properties of the accumulation points are also given, even if global convergence conditions are not satisfied.

Reviews

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