Classification Schemes for the Strong Duality of Linear Programming Over Cones
From MaRDI portal
Publication:5646667
DOI10.1287/opre.19.7.1571zbMath0236.90045OpenAlexW2063821157MaRDI QIDQ5646667
No author found.
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
Related Items (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
