Duality in constrained multi‐facility location models
From MaRDI portal
Publication:4552542
DOI10.1002/nav.10010zbMath0993.90065OpenAlexW1966591675MaRDI QIDQ4552542
Publication date: 3 September 2002
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.10010
Optimality conditions and duality in mathematical programming (90C46) Discrete location and assignment (90B80)
Related Items (1)
Uses Software
Cites Work
- Duality for constrained multifacility location problems with mixed norms and applications
- Duality in constrained location problems
- Solving Euclidean distance multifacility location problems using conjugate subgradient and line-search methods
- Technical Note—Minisum Ip Distance Location Problems Solved via a Perturbed Problem and Weiszfeld's Algorithm
- Properties and Solution Methods for Large Location-Allocation Problems
- Technical Note—Solving Constrained Multi-Facility Location Problems Involving lp Distances Using Convex Programming
- The Dual of a Hyperbolic Approximation to the Generalized Constrained Multi-Facility Location Problem with lp, Distances
- Design and Testing of a Generalized Reduced Gradient Code for Nonlinear Programming
- Properties of ordinary and weighted sums of order $p$ used for distance estimation
- An Application of Dynamic Programming to Location—Allocation Problems
- A Nonlinear Approximation Method for Solving a Generalized Rectangular Distance Weber Problem
- A note on Fermat's problem
- Properties of a multifacility location problem involving euclidian distances
This page was built for publication: Duality in constrained multi‐facility location models