A pathological semi-infinite program verifying Karlovitz's conjecture

DOI10.1007/BF00934327zbMath0472.90032WikidataQ123335579 ScholiaQ123335579MaRDI QIDQ1158340

Dennis F. Karney

Publication date: 1982

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

duality gapsemi-infinite linear programssequence of linear programsDuffin/Karlovitz approximationKarlovitz's conjecturesemi-infinite convex program

Mathematics Subject Classification ID

Convex programming (90C25) Linear programming (90C05) Duality theory (optimization) (49N15)

Related Items (4)

In a semi-infinite program only a countable subset of the constraints is essential ⋮ A duality theorem for semi-infinite convex programs and their finite subprograms ⋮ Strong duality and sensitivity analysis in semi-infinite linear programming ⋮ Limiting Lagrangians: A primal approach

Cites Work

• Duality gaps in semi-infinite linear programming—an approximation problem
• An Infinite Linear Program with a Duality Gap
• Convex analysis treated by linear programming

This page was built for publication: A pathological semi-infinite program verifying Karlovitz's conjecture