A fast algorithm for the rectilinear distance location problem
S. Nobakhtian () and
A. Raeisi Dehkordi ()
Additional contact information
S. Nobakhtian: University of Isfahan
A. Raeisi Dehkordi: University of Isfahan
Mathematical Methods of Operations Research, 2018, vol. 88, issue 1, No 4, 98 pages
Abstract:
Abstract In this paper, we consider the rectilinear distance location problem with box constraints (RDLPBC) and we show that RDLPBC can be reduced to the rectilinear distance location problem (RDLP). A necessary and sufficient condition of optimality is provided for RDLP. A fast algorithm is presented for finding the optimal solution set of RDLP. Global convergence of the method is proved by a necessary and sufficient condition. The new proposed method is provably more efficient in finding the optimal solution set. Computational experiments highlight the magnitude of the theoretical efficiency.
Keywords: Box constraints; Location; Rectilinear distance; Subdifferential (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://link.springer.com/10.1007/s00186-018-0629-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:mathme:v:88:y:2018:i:1:d:10.1007_s00186-018-0629-1
Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186
DOI: 10.1007/s00186-018-0629-1
Access Statistics for this article
Mathematical Methods of Operations Research is currently edited by Oliver Stein
More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().