Duality gaps in semi-infinite linear programming—an approximation problem

DOI10.1007/BF01589340zbMath0448.90037MaRDI QIDQ3895225

Dennis F. Karney

Publication date: 1981

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

linear perturbationssemi-infinite linear programmingsequence of linear programsduality gapsapproximation of the primal programlimiting Lagrangean

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05)

Related Items (25)

On the relationship between the discrete and continuous bounding moment problems and their numerical solutions ⋮ Optimal value function in semi-infinite programming ⋮ Distributionally robust optimization with matrix moment constraints: Lagrange duality and cutting plane methods ⋮ A theory of linear inequality systems ⋮ The Slater Conundrum: Duality and Pricing in Infinite-Dimensional Optimization ⋮ Linear inequalities in mathematical programming and pattern recognition ⋮ Geometric fundamentals of the simplex method in semi-infinite programming ⋮ On the sufficiency of finite support duals in semi-infinite linear programming ⋮ Uniform duality in semi-infinite convex optimization ⋮ Inverse optimization in semi-infinite linear programs ⋮ Clark's theorem for semi-infinite convex programs ⋮ Reduction and Discrete Approximation in Linear Semi-Infinite Programming ⋮ A pathological semi-infinite program verifying Karlovitz's conjecture ⋮ Duality in infinite dimensional linear programming ⋮ A duality theorem for semi-infinite convex programs and their finite subprograms ⋮ Strong duality and sensitivity analysis in semi-infinite linear programming ⋮ Infinite linear programming and online searching with turn cost ⋮ A purification algorithm for semi-infinite programming ⋮ Limiting Lagrangians: A primal approach ⋮ The set of target vectors in a semi-infinite linear program with a duality gap ⋮ On duality in semi-infinite programming and existence theorems for linear inequalities ⋮ Optimality conditions and duality for semi-infinite programming involving B-arcwise connected functions ⋮ Projection: A Unified Approach to Semi-Infinite Linear Programs and Duality in Convex Programming ⋮ Inequality systems and minimax theorems ⋮ Convex infinite horizon programs

Cites Work

• Unnamed Item
• The limiting Lagrangian as a consequence of Helly's theorem
• Theorems on the dimensions of convex sets
• Duality in Semi-Infinite Programs and Some Works of Haar and Carathéodory
• A note on perfect duality and limiting lagrangeans
• Clark's Theorem on linear programs holds for convex programs
• An Infinite Linear Program with a Duality Gap
• On Representations of Semi-Infinite Programs which Have No Duality Gaps
• On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions
• Convex Analysis

This page was built for publication: Duality gaps in semi-infinite linear programming—an approximation problem