LARGE-SCALE SINGLE FACILITY CONTINUOUS LOCATION BY D.C. OPTIMIZATION

DOI10.1080/02331930290019422zbMath1030.90049OpenAlexW2090879885MaRDI QIDQ4548044

Hoang Tuy, Fangjun Zhou, Faiz A. Al-Khayyal

Publication date: 4 November 2002

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930290019422

zbMATH Keywords

nondifferentiable optimizationcompetitive locationconstrained locationmaximin location

Mathematics Subject Classification ID

Continuous location (90B85) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)

Related Items (6)

A note on equity across groups in facility location ⋮ Location of a distribution center for a perishable product ⋮ Equity models in planar location ⋮ Gradual cover competitive facility location ⋮ Sequential location of two facilities: comparing random to optimal location of the first facility ⋮ Big segment small segment global optimization algorithm on networks

Cites Work

• Unnamed Item
• Competitive location with rectilinear distances
• Global optimization of a nonconvex single facility location problem by sequential unconstrained convex minimization
• Polyhedral annexation, dualization and dimension reduction technique in global optimization
• Weber's problem with attraction and repulsion under polyhedral gauges
• Approximation of solutions for location problems
• A d.c. optimization method for single facility location problems
• An Algorithm for a Constrained Weber Problem
• Convex analysis and global optimization

This page was built for publication: LARGE-SCALE SINGLE FACILITY CONTINUOUS LOCATION BY D.C. OPTIMIZATION