Clark's Theorem on linear programs holds for convex programs
From MaRDI portal
Publication:4154374
DOI10.1073/pnas.75.4.1624zbMath0375.90059OpenAlexW2090023640WikidataQ37582873 ScholiaQ37582873MaRDI QIDQ4154374
Publication date: 1978
Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1073/pnas.75.4.1624
Related Items (8)
Boundedness relations in linear semi-infinite programming ⋮ Universal duality in conic convex optimization ⋮ Zero duality gap for convex programs: a generalization of the Clark-Duffin theorem ⋮ Clark's theorem for semi-infinite convex programs ⋮ Unnamed Item ⋮ Duality gaps in semi-infinite linear programming—an approximation problem ⋮ Inequality systems and minimax theorems ⋮ On the existence of a saddle value
This page was built for publication: Clark's Theorem on linear programs holds for convex programs