A note on duality gaps in linear programming over convex sets

DOI10.1007/BF00934942zbMath0259.90018MaRDI QIDQ2560092

Yanyan Li

Publication date: 1974

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (3)

Comment on a note on duality gaps in linear programming over convex sets ⋮ The set of target vectors in a semi-infinite linear program with a duality gap ⋮ Classifying convex extremum problems over linear topologies having separation properties

Cites Work

• Asymptotic duality over closed convex sets
• Linear Inequalities and Related Systems. (AM-38)
• Duality and asymptotic solvability over cones
• Duality in Nonlinear Programming: A Simplified Applications-Oriented Development

This page was built for publication: A note on duality gaps in linear programming over convex sets