2015/04/21 by Bruno F. Lourenço, Lourenço, Bruno F.
Computer Science · Engineering · Mathematics · #49N15 #90C46 #Advanced Optimization Algorithms Research #Algorithm #Cone (formal languages) #Conic optimization #Conic section #Constraint (computer-aided design) #Convex analysis #Convex cone #Convex optimization #Dual (grammatical number) #Duality (order theory) #Duality gap #FOS: Mathematics #Geometry #Mathematical optimization #Mathematics #Optimization and Control (math.OC) #Optimization and Variational Analysis #Optimization problem #Pure mathematics #Regular polygon #Strong duality #Vehicle Routing Optimization Methods #Weak duality #math.OC #msc:49N15 #msc:90C46
paper · pdf · doi:10.48550/arxiv.1504.05630
published in arXiv (Cornell University) (Cornell University) · Paper withdrawn due to error in Theorem 2
openalex publication_date 2015/04/21 · arxiv created 2015/04/23 · arxiv updated 2015/04/24 · openalex created_date 2022/10/01 · openalex updated_date 2026/07/28
We discuss a weak constraint qualification for conic linear programs and its\napplications for a few classes of cones. This constraint qualification is used\nto give a solution to a problem proposed by Shapiro and Z valinescu and show\nthat if a closed convex cone is such that all its non-trivial faces are\npolyhedral and all the non-trivial exposed faces of its dual are polyhedral,\nthen the duality gap is zero as long as the primal and dual problems are\nfeasible. Moreover, the common optimal value must be attained at least at one\nof the sides. We also show an example of a cone that meets the requirements our\ntheorem but is such that previously known results cannot be used to prove its\ngood duality properties.\n