Extremely non-convex optimization problems: the case of the multiple obnoxious facilities location

DOI10.1007/s11590-021-01731-2zbMath1491.90128OpenAlexW3153130728MaRDI QIDQ2128766

Zvi Drezner, Pawel Jan Kalczynski

Publication date: 22 April 2022

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-021-01731-2

zbMATH Keywords

heuristicslocal searchobnoxious facilitiesstarting solutions

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Obnoxious facility location in multiple dimensional space

Uses Software

• SNOPT
• CPLEX

Cites Work

• Unnamed Item
• Review of obnoxious facilities location problems
• Voronoi Diagrams and Delaunay Triangulations
• The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
• Minimum weight design of trusses using improved move limit method of sequential linear programming
• New Methods in Mathematical Programming—On Varying All the Parameters in a Linear-Programming Problem and Sequential Solution of a Linear-Programming Problem
• Computational efficiency of improved move limit method of sequential linear programming for structural optimization
• Calculation of the move limits for the sequential linear programming method
• SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
• The multifacility maximin planar location problem with facility interaction
• Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming