An Infinite Linear Program with a Duality Gap

DOI10.1287/mnsc.12.1.122zbMath0133.42604OpenAlexW2012375689MaRDI QIDQ5343962

Publication date: 1965

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.12.1.122

zbMATH Keywords

operations research

Related Items

Intrinsic linear programming ⋮ On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions ⋮ Optimal value function in semi-infinite programming ⋮ The Lagrange approach to infinite linear programs ⋮ The Slater Conundrum: Duality and Pricing in Infinite-Dimensional Optimization ⋮ On approximate solutions of infinite systems of linear inequalities ⋮ Uniform duality in semi-infinite convex optimization ⋮ Recent contributions to linear semi-infinite optimization ⋮ The limiting Lagrangian as a consequence of Helly's theorem ⋮ A limiting Lagrangian for infinitely-constrained convex optimization in \(\mathbb{R}^n\) ⋮ Dimension and finite reduction in linear semi-infinite programming ⋮ Clark's theorem for semi-infinite convex programs ⋮ Optimality conditions and duality in continuous programming. II: The linear problem revisited ⋮ Reduction and Discrete Approximation in Linear Semi-Infinite Programming ⋮ A one-phase algorithm for semi-infinite linear programming ⋮ A pathological semi-infinite program verifying Karlovitz's conjecture ⋮ Convex analysis treated by linear programming ⋮ Strong unicity and alternation for linear optimization ⋮ Optimality conditions and strong duality in abstract and continuous-time linear programming ⋮ The theorem of the alternative, the key-theorem, and the vector-maximum problem ⋮ Recent contributions to linear semi-infinite optimization: an update ⋮ Duality in infinite dimensional linear programming ⋮ Uniform LP duality for semidefinite and semi-infinite programming ⋮ A duality theorem for semi-infinite convex programs and their finite subprograms ⋮ Optimality conditions for nondifferentiable convex semi-infinite programming ⋮ Strong duality and sensitivity analysis in semi-infinite linear programming ⋮ A purification algorithm for semi-infinite programming ⋮ A note on infinite systems of linear inequalities in R\(^n\) ⋮ Solving stochastic dynamic programming problems by linear programming — An annotated bibliography ⋮ A note on perfect duality and limiting lagrangeans ⋮ Duality in infinite-dimensional mathematical programming: Convex integral functionals ⋮ A duality theory for abstract mathematical programs with applications to optimal control theory ⋮ Duality gaps in semi-infinite linear programming—an approximation problem ⋮ Zero duality gaps in infinite-dimensional programming ⋮ Linear programming and operator means ⋮ A benders squared \((B^2)\) framework for infinite-horizon stochastic linear programs ⋮ Limiting Lagrangians: A primal approach ⋮ Duality for semi-definite and semi-infinite programming ⋮ Posynomial geometric programming as a special case of semi-infinite linear programming ⋮ The set of target vectors in a semi-infinite linear program with a duality gap ⋮ Duality overlap in infinite linear programs ⋮ Direct theorems in semi-infinite convex programming ⋮ Projection: A Unified Approach to Semi-Infinite Linear Programs and Duality in Convex Programming ⋮ Inequality systems and minimax theorems ⋮ Cluster sets of vector series ⋮ Convex semi-infinite games ⋮ On the duality gap and Gale's example in infinite-dimensional conic linear programming