A note on duality gaps in linear programming over convex sets

DOI10.1007/BF00934942MaRDI QIDQ2560092zbMATH OpenFDO

Authors Yanyan Li

Publication date 1974

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

Full work available at URL https://doi.org/10.1007/BF00934942

Mathematics Subject Classification ID

Linear programming (90C05)

Cites work

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

Cited in

(3)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2560092)