Article ID: | iaor19981347 |
Country: | Netherlands |
Volume: | 7 |
Issue: | 2 |
Start Page Number: | 239 |
End Page Number: | 253 |
Publication Date: | Mar 1997 |
Journal: | Computational Optimization and Applications |
Authors: | Wang Changyu, Gao Chengyun, Shi Zhenjun |
In this paper, we extend the ordinary discrete type facility location problems to continuous type ones. Unlike the discrete type facility location problem in which the objective function is not everywhere differentiable, the objective function in the continuous type facility location problem is strictly convex and continuously differentiable. An algorithm without line search for solving the continuous type facility location problems is proposed and its global convergence, linear convergence rate is proved. Numerical experiments illustrate that the algorithm suggested in this paper has smaller amount of computation and quicker convergence rate than the gradient method and conjugate direction method in some sense.