Boundedness relations in linear semi-infinite programming
From MaRDI portal
Publication:1097166
DOI10.1016/0196-8858(87)90005-4zbMath0634.90039OpenAlexW2046356047MaRDI QIDQ1097166
Publication date: 1987
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-8858(87)90005-4
boundedness of the feasible and the optimal solutions setsdual pair of linear semi-infinite programs
Related Items (5)
Unicity in linear optimization ⋮ Geometric fundamentals of the simplex method in semi-infinite programming ⋮ Miguel A. Goberna: ``The challenge was to bring Spanish research in mathematics to normality ⋮ Reduction and Discrete Approximation in Linear Semi-Infinite Programming ⋮ On duality in semi-infinite programming and existence theorems for linear inequalities
Cites Work
- Linear optimization and approximation. An introduction to the theoretical analysis and numerical treatment of semi-infinite programs. Transl. from the German
- The extrema of probability determined by generalized moments. I: Bounded random variables
- Farkas-Minkowski systems in semi-infinite programming
- Clark's theorem for semi-infinite convex programs
- Theorems on the dimensions of convex sets
- Boundedness relations for linear constraint sets
- On extreme points of bounded sets of generalized finite sequence spaces
- On constraint sets of infinite linear programs over ordered fields
- Remark on the Constraint Sets in Linear Programming
- Clark's Theorem on linear programs holds for convex programs
- On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions
- Complementarity Theorems for Linear Programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Boundedness relations in linear semi-infinite programming
