Strong duality and dual pricing properties in semi-infinite linear programming: a non-Fourier-Motzkin elimination approach
From MaRDI portal
Publication:1695816
DOI10.1007/s10957-017-1184-2zbMath1387.90250OpenAlexW2767214911MaRDI QIDQ1695816
Publication date: 8 February 2018
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-017-1184-2
Related Items (1)
Cites Work
- Unnamed Item
- Strong duality and sensitivity analysis in semi-infinite linear programming
- Sensitivity analysis in linear semi-infinite programming: perturbing cost and right-hand-side coefficients
- Classifying convex extremum problems over linear topologies having separation properties
- On the theory of Lagrangian duality
- Duality in Semi-Infinite Programs and Some Works of Haar and Carathéodory
- Extending the mixed algebraic-analysis Fourier–Motzkin elimination method for classifying linear semi-infinite programmes
- Post-Optimal Analysis in Linear Semi-Infinite Optimization
- Semi-Infinite Programming: Theory, Methods, and Applications
- Sensitivity Analysis in Linear Semi-Infinite Programming via Partitions
- Strong Duality for Semidefinite Programming
- Projection: A Unified Approach to Semi-Infinite Linear Programs and Duality in Convex Programming
- On Representations of Semi-Infinite Programs which Have No Duality Gaps
- Duality and asymptotic solvability over cones
This page was built for publication: Strong duality and dual pricing properties in semi-infinite linear programming: a non-Fourier-Motzkin elimination approach