A discretizing algorithm for location problems
A new and simple methodology is proposed to solve both constrained and unconstrained planar continuous single-facility location problems. As particular instances, the classical location problems with mixed gauges can be solved. Theoretical convergence is proved, and numerical examples are given, sho...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 1995 |
| País: | España |
| Institución: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/107470 |
| Acceso en línea: | https://hdl.handle.net/11441/107470 https://doi.org/10.1016/0377-2217(93)E0145-N |
| Access Level: | acceso abierto |
| Palabra clave: | Location Facilities Nonlinear programming |
| Sumario: | A new and simple methodology is proposed to solve both constrained and unconstrained planar continuous single-facility location problems. As particular instances, the classical location problems with mixed gauges can be solved. Theoretical convergence is proved, and numerical examples are given, showing a fast convergence in a small number of steps. |
|---|