Locating a semi-obnoxious facility -- A Toland-Singer duality based approach
zbMATH Open1354.49077MaRDI QIDQ3179426FDOQ3179426
Authors: Andrea Wagner, Juan-Enrique Martínez-Legaz, Chr. Tammer
Publication date: 21 December 2016
Full work available at URL: http://www.heldermann.de/JCA/JCA23/JCA234/jca23044.htm#jca224
Recommendations
obnoxious facilitiesD.C. optimizationconjugate dualitylinear vector optimizationgeometric dualitylocational analysis
Linear programming (90C05) Nonconvex programming, global optimization (90C26) Numerical methods involving duality (49M29) Duality theory (optimization) (49N15)
Cited In (5)
- A d.c. optimization method for single facility location problems
- A D.C. biobjective location model
- Locating a semi-obnoxious facility in the special case of Manhattan distances
- The bicriterion semi-obnoxious location (BSL) problem solved by an \(\varepsilon\)-approximation
- Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver
This page was built for publication: Locating a semi-obnoxious facility -- A Toland-Singer duality based approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3179426)