Reduction and Discrete Approximation in Linear Semi-Infinite Programming
From MaRDI portal
Publication:3780757
DOI10.1080/02331938708843278zbMath0639.90063MaRDI QIDQ3780757
Marco A. López, Miguel Angel Goberna
Publication date: 1987
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331938708843278
discretization; approximation; finite reduction; countable subproblems; discretizable; finite subproblem; Haar's duality; linear semi-infinite system; reductible; sequence of perturbed finite subproblems
Related Items
Dimension and finite reduction in linear semi-infinite programming, 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, On Haar's dual problem
Cites Work
- Unnamed Item
- The extrema of probability determined by generalized moments. I: Bounded random variables
- In a semi-infinite program only a countable subset of the constraints is essential
- Boundedness relations in linear semi-infinite programming
- A limiting Lagrangian for infinitely-constrained convex optimization in \(\mathbb{R}^n\)
- Farkas-Minkowski systems in semi-infinite programming
- Constructing a perfect duality in infinite programming
- Duality in Semi-Infinite Programs and Some Works of Haar and Carathéodory
- Uniform duality in semi-infinite convex optimization
- DUALITY, HAAR PROGRAMS, AND FINITE SEQUENCE SPACES
- A note on perfect duality and limiting lagrangeans
- Duality gaps in semi-infinite linear programming—an approximation problem
- Direct theorems in semi-infinite convex programming
- An Infinite Linear Program with a Duality Gap
- On Representations of Semi-Infinite Programs which Have No Duality Gaps
- Convex Analysis
