Boundedness relations in linear semi-infinite programming
From MaRDI portal
DOI10.1016/0196-8858(87)90005-4zbMATH Open0634.90039OpenAlexW2046356047MaRDI QIDQ1097166FDOQ1097166
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
Recommendations
- Condiciones suficientes para la existencia de solucion optima en un programa semi-infinito
- Primal-dual partitions in linear semi-infinite programming with bounded coefficients
- On duality in semi-infinite programming and existence theorems for linear inequalities
- On the sufficiency of finite support duals in semi-infinite linear programming
- Generic primal-dual solvability in continuous linear semi-infinite programming
boundedness of the feasible and the optimal solutions setsdual pair of linear semi-infinite programs
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Clark's theorem for semi-infinite convex programs
- Clark's Theorem on linear programs holds for convex programs
- Boundedness relations for linear constraint sets
- Farkas-Minkowski systems in semi-infinite programming
- 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
- Title not available (Why is that?)
- Theorems on the dimensions of convex sets
- Remark on the Constraint Sets in Linear Programming
- Title not available (Why is that?)
- On extreme points of bounded sets of generalized finite sequence spaces
- Title not available (Why is that?)
- On constraint sets of infinite linear programs over ordered fields
- Title not available (Why is that?)
Cited In (7)
- A characterization of Delsarte's linear programming bound as a ratio bound
- Geometric fundamentals of the simplex method in semi-infinite programming
- Reduction and Discrete Approximation in Linear Semi-Infinite Programming
- Condiciones suficientes para la existencia de solucion optima en un programa semi-infinito
- Miguel A. Goberna: ``The challenge was to bring Spanish research in mathematics to normality
- Unicity in linear optimization
- On duality in semi-infinite programming and existence theorems for linear inequalities
This page was built for publication: Boundedness relations in linear semi-infinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1097166)
