Classification Schemes for the Strong Duality of Linear Programming Over Cones

DOI10.1287/OPRE.19.7.1571MaRDI QIDQ5646667zbMATH OpenOpenAlexFDO

Authors

Publication date 1971

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.19.7.1571

Mathematics Subject Classification ID

Linear programming (90C05)

Cited in

(2)

• Zero duality gaps in infinite-dimensional programming
• Classifying convex extremum problems over linear topologies having separation properties

This page was built for publication: Classification Schemes for the Strong Duality of Linear Programming Over Cones

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