\documentclass[12pt]{article}
\usepackage{amsmath,amssymb,amsfonts}
\begin{document}
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.
\end{document}