Understanding linear semi-infinite programming via linear programming over cones
From MaRDI portal
Publication:3066933
DOI10.1080/02331930903395865zbMath1229.90248OpenAlexW2053271671MaRDI QIDQ3066933
Publication date: 20 January 2011
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930903395865
Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Related Items
A note on the minimal cone for conic linear programming ⋮ Extending the mixed algebraic-analysis Fourier–Motzkin elimination method for classifying linear semi-infinite programmes ⋮ The minimal cone for conic linear programming
Cites Work