A global convergence theorem for aggregation algorithms
作者:
L. García,
期刊:
Optimization
(Taylor Available online 1988)
卷期:
Volume 19,
issue 6
页码: 819-828
ISSN:0233-1934
年代: 1988
DOI:10.1080/02331938808843395
出版商: Akademic-Verlag
关键词: Iterative aggregation;linear programming;large scale;global convergence;Primary: 49 B 36;Secondary: 90 C 06
数据来源: Taylor
摘要:
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.
点击下载:
PDF (475KB)
返 回