Locating a semi-obnoxious facility -- A Toland-Singer duality based approach

MaRDI QIDQ3179426zbMATH OpenFDO

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

zbMATH Keywords

obnoxious facilitiesD.C. optimizationconjugate dualitylinear vector optimizationgeometric dualitylocational analysis

Mathematics Subject Classification ID

Linear programming (90C05) Nonconvex programming, global optimization (90C26) Numerical methods involving duality (49M29) Duality theory (optimization) (49N15)

Recommendations

• A d.c. optimization method for single facility location problems
• scientific article; zbMATH DE number 970362
• A D.C. biobjective location model
• LARGE-SCALE SINGLE FACILITY CONTINUOUS LOCATION BY D.C. OPTIMIZATION
• scientific article; zbMATH DE number 2096862

Cited in

(5)

• A d.c. optimization method for single facility location problems
• Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver
• A D.C. biobjective location model
• The bicriterion semi-obnoxious location (BSL) problem solved by an \(\varepsilon\)-approximation
• Locating a semi-obnoxious facility in the special case of Manhattan distances

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)