Understanding linear semi-infinite programming via linear programming over cones
From MaRDI portal
Publication:3066933
DOI10.1080/02331930903395865zbMath1229.90248MaRDI 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
90C46: Optimality conditions and duality in mathematical programming
90C34: Semi-infinite programming
52A20: Convex sets in (n) dimensions (including convex hypersurfaces)
Related Items
The minimal cone for conic linear programming, 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
Cites Work