Background
Type:

On the convergence of the Cooper’s algorithm

Journal: Optimization Letters (18624472)Year: 1 November 2020Volume: 14Issue: Pages: 2539 - 2547
DOI:10.1007/s11590-020-01572-5Language: English

Abstract

In this paper, we consider the Cooper’s alternate location and allocation algorithm for solving the constrained uncapacitated multi-source Weber problem. The convergence of the sequence generated by Cooper’s algorithm to a local optimal solution proved under mild assumption. Furthermore, an approach for finding the global optimal solution is proposed. © 2020, Springer-Verlag GmbH Germany, part of Springer Nature.


Author Keywords

Constrained muli-source Weber problemConvergenceCooper’s algorithmSubdifferential

Other Keywords

Control engineeringOptimizationAllocation algorithmConvergenceGlobal optimal solutionsLocal optimal solutionMulti-SourcesS-algorithmsSubdifferentialsWeber problemOptimal systems