Solving a continuous multifacility location problem by DC algorithms. (2nd January 2022)

• Record Type: Journal Article
• Authors: Bajaj, Anuj; Mordukhovich, Boris S.; Nam, Nguyen Mau; Tran, Tuyen
• Is Part Of: Optimization methods and software. Volume 37:Number 1(2022)
• Page Start: 338
• Page End: 360
• Publication Date: 2022-01-02
• Subjects: Mixed integer programming -- multifacility location -- difference of convex functions -- Nesterov's smoothing -- the DCA; 49J52 -- 49J53 -- 90C31; Mathematical optimization -- Periodicals; Algorithms -- Periodicals; 519.7
• DOI: 10.1080/10556788.2020.1771335
• Languages: English
• ISSNs: 1055-6788

Abstract

ABSTRACT: The paper presents a new approach to solve multifacility location problems, which is based on mixed integer programming and algorithms for minimizing differences of convex (DC) functions. The main challenges for solving the multifacility location problems under consideration come from their intrinsic discrete, nonconvex, and nondifferentiable nature. We provide a reformulation of these problems as those of continuous optimization and then develop a new DC type algorithm for their solutions involving Nesterov's smoothing. The proposed algorithm is computationally implemented via MATLAB numerical tests on both artificial and real data sets.