Refinements and extensions of some strong duality theorems in conic linear programming

DOI10.1007/s40306-024-00543-7MaRDI QIDQ6650711

Nguyen Dong Yen, Nguyen Ngoc Luan

Publication date: 9 December 2024

Published in: Acta Mathematica Vietnamica (Search for Journal in Brave)

zbMATH Keywords

strong dualityquasi-regularitysolution existenceinfinite-dimensional conic linear programfinite-dimensional conic linear programgeneralized polyhedral convex conegeneralized relative interior

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Programming in abstract spaces (90C48) General theory of locally convex spaces (46A03) Duality theory for topological vector spaces (46A20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A generalization of the Farkas lemma and applications to convex programming
• Convergent conic linear programming relaxations for cone convex polynomial programs
• Generalized polyhedral convex optimization problems
• On the duality gap and Gale's example in infinite-dimensional conic linear programming
• Two optimal value functions in parametric conic linear programming
• Linear and nonlinear programming
• Lectures on Modern Convex Optimization
• Programmes in Paired Spaces
• Convex Analysis and Beyond
• A representation of generalized convex polyhedra and applications
• Efficient solutions in generalized linear vector optimization
• Convex Analysis
• Convex analysis and global optimization
• Duality gap function in infinite dimensional linear programming
• Strong duality and solution existence under minimal assumptions in conic linear programming

This page was built for publication: Refinements and extensions of some strong duality theorems in conic linear programming