Pages that link to "Item:Q5343962"
From MaRDI portal
The following pages link to An Infinite Linear Program with a Duality Gap (Q5343962):
Displaying 47 items.
- Strong duality and sensitivity analysis in semi-infinite linear programming (Q507336) (← links)
- Limiting Lagrangians: A primal approach (Q761250) (← links)
- A one-phase algorithm for semi-infinite linear programming (Q911454) (← links)
- Strong unicity and alternation for linear optimization (Q915659) (← links)
- Uniform LP duality for semidefinite and semi-infinite programming (Q940834) (← links)
- Inequality systems and minimax theorems (Q1059843) (← links)
- Cluster sets of vector series (Q1061612) (← links)
- Convex semi-infinite games (Q1065725) (← links)
- Intrinsic linear programming (Q1077337) (← links)
- Optimal value function in semi-infinite programming (Q1093526) (← links)
- On approximate solutions of infinite systems of linear inequalities (Q1121345) (← links)
- The limiting Lagrangian as a consequence of Helly's theorem (Q1136348) (← links)
- A limiting Lagrangian for infinitely-constrained convex optimization in \(\mathbb{R}^n\) (Q1136349) (← links)
- Clark's theorem for semi-infinite convex programs (Q1150527) (← links)
- Optimality conditions and duality in continuous programming. II: The linear problem revisited (Q1152305) (← links)
- A pathological semi-infinite program verifying Karlovitz's conjecture (Q1158340) (← links)
- Optimality conditions and strong duality in abstract and continuous-time linear programming (Q1166103) (← links)
- Duality in infinite dimensional linear programming (Q1184338) (← links)
- A purification algorithm for semi-infinite programming (Q1197680) (← links)
- A note on infinite systems of linear inequalities in R\(^n\) (Q1212982) (← links)
- Duality in infinite-dimensional mathematical programming: Convex integral functionals (Q1256398) (← links)
- Zero duality gaps in infinite-dimensional programming (Q1263531) (← links)
- The Lagrange approach to infinite linear programs (Q1348714) (← links)
- Recent contributions to linear semi-infinite optimization (Q1680760) (← links)
- Recent contributions to linear semi-infinite optimization: an update (Q1730534) (← links)
- Linear programming and operator means (Q1813693) (← links)
- Posynomial geometric programming as a special case of semi-infinite linear programming (Q1824566) (← links)
- A benders squared \((B^2)\) framework for infinite-horizon stochastic linear programs (Q2063190) (← links)
- On the duality gap and Gale's example in infinite-dimensional conic linear programming (Q2109025) (← links)
- The set of target vectors in a semi-infinite linear program with a duality gap (Q2317358) (← links)
- A duality theory for abstract mathematical programs with applications to optimal control theory (Q2527347) (← links)
- Duality overlap in infinite linear programs (Q2557175) (← links)
- Uniform duality in semi-infinite convex optimization (Q3219365) (← links)
- A duality theorem for semi-infinite convex programs and their finite subprograms (Q3308653) (← links)
- Optimality conditions for nondifferentiable convex semi-infinite programming (Q3308655) (← links)
- The Slater Conundrum: Duality and Pricing in Infinite-Dimensional Optimization (Q3465240) (← links)
- Reduction and Discrete Approximation in Linear Semi-Infinite Programming (Q3780757) (← links)
- A note on perfect duality and limiting lagrangeans (Q3880596) (← links)
- Duality gaps in semi-infinite linear programming—an approximation problem (Q3895225) (← links)
- Direct theorems in semi-infinite convex programming (Q3923950) (← links)
- The theorem of the alternative, the key-theorem, and the vector-maximum problem (Q4079322) (← links)
- Solving stochastic dynamic programming problems by linear programming — An annotated bibliography (Q4152066) (← links)
- Dimension and finite reduction in linear semi-infinite programming (Q4327939) (← links)
- Duality for semi-definite and semi-infinite programming (Q4467176) (← links)
- Projection: A Unified Approach to Semi-Infinite Linear Programs and Duality in Convex Programming (Q5245019) (← links)
- On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions (Q5556184) (← links)
- Convex analysis treated by linear programming (Q5675150) (← links)