The Slater Conundrum: Duality and Pricing in Infinite-Dimensional Optimization
From MaRDI portal
Publication:3465240
DOI10.1137/140974584zbMath1344.90070OpenAlexW2222363143MaRDI QIDQ3465240
Christopher Thomas Ryan, Matt Stern, R. Kipp Martin
Publication date: 21 January 2016
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/6a63dd6052d43d3ea8e92e4b09d99ee5f8dddfac
Optimality conditions and duality in mathematical programming (90C46) Programming in abstract spaces (90C48) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)
Related Items
Robust optimization in countably infinite linear programs ⋮ Circumventing the Slater conundrum in countably infinite linear programs ⋮ An extension of the Kaliszewski cone to non-polyhedral pointed cones in infinite-dimensional spaces ⋮ Duality in Countably Infinite Monotropic Programs ⋮ Strong duality and sensitivity analysis in semi-infinite linear programming ⋮ Stability analysis of conically perturbed linearly constrained least-squares problems by optimizing the regularized trajectories ⋮ Stable conical regularization by constructible dilating cones with an application to \(L^{p}\)-constrained optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quasi-relative interior-type constraint qualifications ensuring strong Lagrange duality for optimization problems with cone and affine constraints
- Conjugate duality in convex optimization
- On the use of purely finitely additive multipliers in mathematical programming
- Equilibria in markets with a Riesz space of commodities
- Duality in infinite dimensional linear programming
- Partially finite convex programming. I: Quasi relative interiors and duality theory
- Stochastic convex programming: Singular multipliers and extended duality, singular multipliers and duality
- On the sufficiency of finite support duals in semi-infinite linear programming
- Continuous programming. II: Nonlinear objectives
- Shadow Prices in Infinite-Dimensional Linear Programming
- Dividing a Territory Among Several Vehicles
- On stochastic programming ii: dynamic problems under risk∗
- Duality gaps in semi-infinite linear programming—an approximation problem
- Stochastic Convex Programming: Relatively Complete Recourse and Induced Feasibility
- An Algorithm for a Class of Continuous Linear Programs
- Optimal Dynamic Pricing of Inventories with Stochastic Demand over Finite Horizons
- Approaches to the Theory of Optimization
- Optimal Procurement Mechanisms
- A Linear Programming Approach to Nonstationary Infinite-Horizon Markov Decision Processes
- The Euler Characteristic in Combinatorial Geometry
- An Infinite Linear Program with a Duality Gap
- Duality and Existence of Optimal Policies in Generalized Joint Replenishment
- VALUATION EQUILIBRIUM AND PARETO OPTIMUM
