On Representations of Semi-Infinite Programs which Have No Duality Gaps
From MaRDI portal
Cited in
(45)- An extension of the multi-output state-contingent production model
- Contributions of Professor William W. Cooper in operations research and management science
- Cluster sets of vector series
- Convex semi-infinite games
- Intrinsic linear programming
- A theory of linear inequality systems
- A limiting Lagrangian for infinitely-constrained convex optimization in \(\mathbb{R}^n\)
- Inexact linear programming with generalized resource sets
- Zero duality gaps in infinite-dimensional programming
- On duality in semi-infinite programming and existence theorems for linear inequalities
- Conditions for the uniqueness of the optimal solution in linear semi- infinite programming
- A dual characterization of incentive efficiency.
- Stability of the duality gap in linear optimization
- Recent contributions to linear semi-infinite optimization
- Strong duality and dual pricing properties in semi-infinite linear programming: a non-Fourier-Motzkin elimination approach
- Recent contributions to linear semi-infinite optimization: an update
- Stable local minimizers in semi-infinite optimization: Regularity and second-order conditions
- Unicity in linear optimization
- Analytical linear inequality systems and optimization
- Selected applications of linear semi-infinite systems theory
- Robust Farkas-Minkowski constraint qualification for convex inequality system under data uncertainty
- A duality theory for abstract mathematical programs with applications to optimal control theory
- On the relationship between the discrete and continuous bounding moment problems and their numerical solutions
- Stability of the primal-dual partition in linear semi-infinite programming
- Uniform duality in semi-infinite convex optimization
- A duality theorem for semi-infinite convex programs and their finite subprograms
- Reduction and Discrete Approximation in Linear Semi-Infinite Programming
- Duality gaps in semi-infinite linear programming—an approximation problem
- Direct theorems in semi-infinite convex programming
- Solving stochastic dynamic programming problems by linear programming — An annotated bibliography
- Redundancy in linear inequality system
- Dimension and finite reduction in linear semi-infinite programming
- On stable uniqueness in linear semi-infinite optimization
- A note about linear inequality systems and duality
- Optimality theory for semi-infinite linear programming∗
- The FM and BCQ Qualifications for Inequality Systems of Convex Functions in Normed Linear Spaces
- Strong duality and sensitivity analysis in semi-infinite linear programming
- New Farkas-type constraint qualifications in convex infinite programming
- On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions
- Semi-infinite programming, differentiability and geometric programming: Part II
- Linear conic and two-stage stochastic optimization revisited via semi-infinite optimization
- Alternative KKT conditions for (semi)infinite convex optimization
- A new tour on the subdifferential of the supremum function
- A one-phase algorithm for semi-infinite linear programming
- Uniform LP duality for semidefinite and semi-infinite programming
This page was built for publication: On Representations of Semi-Infinite Programs which Have No Duality Gaps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5519728)
