In a semi-infinite program only a countable subset of the constraints is essential

DOI10.1016/0021-9045(85)90068-1zbMath0597.90068OpenAlexW2087479728MaRDI QIDQ1079497

Dennis F. Karney

Publication date: 1985

Published in: Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0021-9045(85)90068-1

zbMATH Keywords

convex inequality constraintscountable constraint selection

Mathematics Subject Classification ID

Convex programming (90C25) Semi-infinite programming (90C34) Methods of successive quadratic programming type (90C55)

Related Items (4)

On the sufficiency of finite support duals in semi-infinite linear programming ⋮ Clark's theorem for semi-infinite convex programs ⋮ Reduction and Discrete Approximation in Linear Semi-Infinite Programming ⋮ Strong duality and sensitivity analysis in semi-infinite linear programming

Cites Work

• The limiting Lagrangian as a consequence of Helly's theorem
• Clark's theorem for semi-infinite convex programs
• A pathological semi-infinite program verifying Karlovitz's conjecture
• Uniform duality in semi-infinite convex optimization
• A duality theorem for semi-infinite convex programs and their finite subprograms
• Convex analysis treated by linear programming

This page was built for publication: In a semi-infinite program only a countable subset of the constraints is essential