摘要
本文给出min sum from i=1 to m‖A_iX-b_i‖型最优场址问题一个迭代算法。在一定的条件下,证明了算法的全局收敛性,并会计了收敛速率。
In this paper, is given an iterative algorithm for the min
II type location problem. Under some conditions, the global conver-gence of this algorithm is prover and the convergent rate is estimated as Well.
关键词
选址
场址
最优化
收敛算法
optimization
optimal location problem
gratient method
convergent rate
iterative mthod
