Duality for constrained multifacility location problems with mixed norms and applications
From MaRDI portal
Publication:920027
DOI10.1007/BF02097796zbMath0707.90071MaRDI QIDQ920027
O. Lefebvre, H. Idrissi, Christian Michelot
Publication date: 1989
Published in: Annals of Operations Research (Search for Journal in Brave)
dual problemoptimality conditionsdecomposition methodsmixed normsconstrained multifacility minisum locationpartial inverse of a multifunction
Continuous location (90B85) Nonlinear programming (90C30) Decomposition methods (49M27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Duality results and proximal solutions of the Huber \(M\)-estimator problem ⋮ Duality in constrained multi‐facility location models ⋮ On duality for mathematical programs with vanishing constraints ⋮ Nondifferentiability detection and dimensionality reduction in minisum multifacility location problems ⋮ Unnamed Item ⋮ When facilities coincide: Exact optimality conditions in multifacility location ⋮ Planar multifacility location problems with tree structure and finite dominating sets ⋮ Complexity results on planar multifacility location problems with forbidden regions ⋮ Asymmetric distances, semidirected networks and majority in Fermat-Weber problems ⋮ Duality for optimal control-approximation problems with gauges
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partial inverse of a monotone operator
- Localization in multifacility location theory
- Geometric interpretation of the optimality conditions in multifacility location and applications
- A quadratically convergent method for minimizing a sum of euclidean norms
- Applications of the method of partial inverses to convex programming: Decomposition
- An Efficient Algorithm for Solving the Rectilinear Multifacility Location Problem
- A primal-dual algorithm for the fermat-weber problem involving mixed gauges
- A projected newton method forl p norm location problems
- A primal-dual algorithm for a constrained Fermat-Weber problem involving mixed norms
- Multifacility Location Problem with Rectilinear Distance by the Minimum-Cut Approach
- Solving multifacility location problems involving euclidean distances
- Fixed Point Optimality Criteria for the Location Problem with Arbitrary Norms
- A Stable Algorithm for Solving the Multifacility Location Problem Involving Euclidean Distances
- A Trajectory Method for the Optimization of the Multi-Facility Location Problem With lp Distances
- A Subgradient Algorithm for Certain Minimax and Minisum Problems—The Constrained Case
- Sufficient Conditions for Optimal Facility Locations to Coincide
- A linear programming solution to the generalized rectangular distance weber problem
- 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
- An Efficient Computational Procedure for Solving the Multi-Facility Rectilinear Facilities Location Problem
- A primal simplex algorithm to solve a rectilinear distance facility location problem
- A Cut Approach to the Rectilinear Distance Facility Location Problem
- A subgradient algorithm for certain minimax and minisum problems
- A note on optimality conditions for the Euclidean. Multifacility location problem
- Convex Analysis
- Locating facilities in three‐dimensional space by convex programming
- Technical Note—The Optimal Location of New Facilities Using Rectangular Distances
- A Nonlinear Approximation Method for Solving a Generalized Rectangular Distance Weber Problem
- Properties of a multifacility location problem involving euclidian distances
