Reduction and Discrete Approximation in Linear Semi-Infinite Programming
From MaRDI portal
Recommendations
Cites work
- A limiting Lagrangian for infinitely-constrained convex optimization in \(\mathbb{R}^n\)
- A note on perfect duality and limiting lagrangeans
- An Infinite Linear Program with a Duality Gap
- Boundedness relations in linear semi-infinite programming
- Constructing a perfect duality in infinite programming
- Convex Analysis
- Direct theorems in semi-infinite convex programming
- Duality gaps in semi-infinite linear programming—an approximation problem
- Duality in semi-infinite programs and some works of Haar and Carathéodory
- DUALITY, HAAR PROGRAMS, AND FINITE SEQUENCE SPACES
- Farkas-Minkowski systems in semi-infinite programming
- scientific article; zbMATH DE number 3755766 (Why is no real title available?)
- In a semi-infinite program only a countable subset of the constraints is essential
- On Representations of Semi-Infinite Programs which Have No Duality Gaps
- The extrema of probability determined by generalized moments. I: Bounded random variables
- Uniform duality in semi-infinite convex optimization
Cited in
(12)- Optimal value function in semi-infinite programming
- A purification algorithm for semi-infinite programming
- On duality in semi-infinite programming and existence theorems for linear inequalities
- Discretization methods for the solution of semi-infinite programming problems
- Affine reductions for LPs and SDPs
- On Haar's dual problem
- Extending the mixed algebraic-analysis Fourier-Motzkin elimination method for classifying linear semi-infinite programmes
- scientific article; zbMATH DE number 3906233 (Why is no real title available?)
- scientific article; zbMATH DE number 4035566 (Why is no real title available?)
- scientific article; zbMATH DE number 95244 (Why is no real title available?)
- Dimension and finite reduction in linear semi-infinite programming
- The semismooth approach for semi-infinite programming under the reduction ansatz
This page was built for publication: Reduction and Discrete Approximation in Linear Semi-Infinite Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3780757)
