Algebraic duality theorems for infinite LP problems
From MaRDI portal
Publication:616403
DOI10.1016/J.LAA.2010.09.007zbMATH Open1206.90214OpenAlexW2164703620MaRDI QIDQ616403FDOQ616403
Authors: Miklós Pintér 
Publication date: 7 January 2011
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: http://unipub.lib.uni-corvinus.hu/574/1/LAAPinter2010.pdf
Recommendations
Linear programming (90C05) Optimality conditions and duality in mathematical programming (90C46) Cooperative games (91A12) Programming in abstract spaces (90C48)
Cites Work
- Cores of convex games
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cores of exact games. I
- Title not available (Why is that?)
- Countably additive measures in cores of games
- Title not available (Why is that?)
Cited In (12)
- On the duality gap and Gale's example in infinite-dimensional conic linear programming
- Balanced capacities
- An Infinite-Dimensional LP Duality Theorem
- Title not available (Why is that?)
- On balanced games with infinitely many players: revisiting Schmeidler's result
- The \(\kappa\)-core and the \(\kappa\)-balancedness of TU games
- Duality in infinite dimensional linear programming
- Title not available (Why is that?)
- Necessary and Sufficient Conditions for Qualitative Properties of Infinite Dimensional Linear Programming Problems
- Explicit solvability of dual pairs of infinite linear programs.
- Submodular functions and rooted trees
- Farkas' Lemma, other theorems of the alternative, and linear programming in infinite-dimensional spaces: a purely linear-algebraic approach
This page was built for publication: Algebraic duality theorems for infinite LP problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q616403)
