Duality for location problems with unbounded unit balls

Abstract. Given an optimization problem with a composite of a convex and componentwise increasing function with a convex vector function as objective function, by means of the conjugacy approach based on the perturbation theory, we determine a dual to it. Necessary and sufficient optimality conditions are derived using strong duality. Furthermore, as special case of this problem, we consider a location problem, where the ”distances” are measured by gauges of closed convex sets. We prove that the geometric characterization of the set of optimal solutions for this location problem given by Hinojosa and Puerto in a recently published paper can be obtained via the presented dual problem. Finally, the Weber and the minmax location problems with gauges are given as applications. Keywords. Convex programming, Location, Conjugate duality, Gauges, Optimality conditions

• Type: Journal
• Year: 2007
• Where: EOR
• Authors: Gert Wanka, Radu Ioan Bot, Emese Vargyas
• Keywords: Convex Vector Function, EOR 2007, Location Problems, Optimality Conditions