Duality gaps in semi-infinite linear programming—an approximation problem
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3121286 (Why is no real title available?)
- A note on perfect duality and limiting lagrangeans
- An Infinite Linear Program with a Duality Gap
- Clark's Theorem on linear programs holds for convex programs
- Convex Analysis
- Duality in semi-infinite programs and some works of Haar and Carathéodory
- On Representations of Semi-Infinite Programs which Have No Duality Gaps
- On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions
- The limiting Lagrangian as a consequence of Helly's theorem
- Theorems on the dimensions of convex sets
Cited in
(25)- A pathological semi-infinite program verifying Karlovitz's conjecture
- Clark's theorem for semi-infinite convex programs
- The set of target vectors in a semi-infinite linear program with a duality gap
- On the relationship between the discrete and continuous bounding moment problems and their numerical solutions
- Optimal value function in semi-infinite programming
- Projection: A unified approach to semi-infinite linear programs and duality in convex programming
- Linear inequalities in mathematical programming and pattern recognition
- Convex infinite horizon programs
- Distributionally robust optimization with matrix moment constraints: Lagrange duality and cutting plane methods
- Duality in infinite dimensional linear programming
- Uniform duality in semi-infinite convex optimization
- Inverse optimization in semi-infinite linear programs
- A theory of linear inequality systems
- Geometric fundamentals of the simplex method in semi-infinite programming
- Reduction and Discrete Approximation in Linear Semi-Infinite Programming
- Limiting Lagrangians: A primal approach
- Optimality conditions and duality for semi-infinite programming involving B-arcwise connected functions
- On the sufficiency of finite support duals in semi-infinite linear programming
- On duality in semi-infinite programming and existence theorems for linear inequalities
- A duality theorem for semi-infinite convex programs and their finite subprograms
- A purification algorithm for semi-infinite programming
- The Slater Conundrum: Duality and Pricing in Infinite-Dimensional Optimization
- Strong duality and sensitivity analysis in semi-infinite linear programming
- Infinite linear programming and online searching with turn cost
- Inequality systems and minimax theorems
This page was built for publication: Duality gaps in semi-infinite linear programming—an approximation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3895225)
