A new algorithm for the minimax location problem with the closest distance

This paper focuses on the constrained minimax location problem with the closest distance. Some properties concerning the existence and uniqueness of the optimal solution are provided. To achieve these results, we apply non-smooth approach that allow us to give the explicit solution structure of the...

Full description

Saved in:
Bibliographic Details
Published inOptimization Vol. 72; no. 12; pp. 2893 - 2923
Main Authors Nobakhtian, S., Raeisi Dehkordi, A.
Format Journal Article
LanguageEnglish
Published Philadelphia Taylor & Francis 02.12.2023
Taylor & Francis LLC
Subjects
Algorithms
closest distance
global convergence
Minimax location problem
Minimax technique
non-smooth optimization
Online AccessGet full text

Cover

More Information
Summary:This paper focuses on the constrained minimax location problem with the closest distance. Some properties concerning the existence and uniqueness of the optimal solution are provided. To achieve these results, we apply non-smooth approach that allow us to give the explicit solution structure of the constrained problem. Moreover, we develop an effective algorithm for solving this class of problems and we provide its convergence under some mild assumptions. At the end, some computational test problems are provided to illustrate the effectiveness of the method and certify the theoretical results.
ISSN:0233-1934
1029-4945
DOI:10.1080/02331934.2022.2081081