Clark's theorem for semi-infinite convex programs

DOI10.1016/0196-8858(81)90036-1zbMath0456.90069OpenAlexW2061726564MaRDI QIDQ1150527

Dennis F. Karney

Publication date: 1981

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-8858(81)90036-1

zbMATH Keywords

duality gapClark's theoremLagrangian dualboundedness assumptionsemi-infinite convex programs

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (8)

In a semi-infinite program only a countable subset of the constraints is essential ⋮ Boundedness relations in linear semi-infinite programming ⋮ Zero duality gap for convex programs: a generalization of the Clark-Duffin theorem ⋮ Inverse optimization in semi-infinite linear programs ⋮ A duality theorem for semi-infinite convex programs and their finite subprograms ⋮ Optimality conditions for nondifferentiable convex semi-infinite programming ⋮ Zero duality gaps in infinite-dimensional programming ⋮ Inequality systems and minimax theorems

Cites Work

• In a semi-infinite program only a countable subset of the constraints is essential
• Theorems on the dimensions of convex sets
• On the primal and dual constraint sets in geometric programming
• Remark on the Constraint Sets in Linear Programming
• Duality gaps in semi-infinite linear programming—an approximation problem
• The complementary unboundedness of dual feasible solution sets in convex programming
• Clark's Theorem on linear programs holds for convex programs
• An Infinite Linear Program with a Duality Gap
• Some Properties of Redundant Constraints and Extraneous Variables in Direct and Dual Linear Programming Problems

This page was built for publication: Clark's theorem for semi-infinite convex programs