| A GLOBALLY CONVERGENT ALGORITHM FOR THE EUCLIDEAN MULTIPLICITY LOCATION PROBLEM |
| |
| 作者姓名： | J.B.ROSEN 薛国良 |
| |
| 作者单位： | Computer Science Department，University of Minnesota，Minneapolis，MN 55455，USA，Institute of Operations Research，Qufu Normal University，Qufu 278165，China |
| |
| 基金项目： | This research is supported in part by the Air Force Office of Scientific Research Grant AFOSR-87-0127, the National Science Foundation Grant DCR-8420935 and University of Minnesota Graduate School Doctoral Dissertation Fellowship awarded to G.L. Xue |
| |
| 摘 要： | The Euclidean single facility location problem (ESFL) and the Euclidean multiplicity lo-cation problem (EMFL) are two special nonsmooth convex programming problems which haveattracted a largr literature. For the ESFL problem. there are algorithms which converge bothglobally and quadratically For the EMFL problem, there are some quadratically convergentalgorithms. but for global convergencel they all need nontrivial assumptions on the problem.In this paper, we present an algorithm for EMFL. With no assumption on the problem, it isproved that from any initial point, this algorithm generates a sequence of points which convergesto the closed convex set of optimal solutions of EMFL.
|
| 本文献已被 CNKI 等数据库收录！ |
