Boundedness relations in linear semi-infinite programming

DOI10.1016/0196-8858(87)90005-4MaRDI QIDQ1097166zbMATH OpenOpenAlexFDO

Authors Miguel Angel Goberna

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

zbMATH Keywords

boundedness of the feasible and the optimal solutions setsdual pair of linear semi-infinite programs

Mathematics Subject Classification ID

Linear programming (90C05) Mathematical programming (90C99)

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

Cites work

• scientific article; zbMATH DE number 3874998 (Why is no real title available?)
• scientific article; zbMATH DE number 3924505 (Why is no real title available?)
• scientific article; zbMATH DE number 3238144 (Why is no real title available?)
• scientific article; zbMATH DE number 3246461 (Why is no real title available?)
• scientific article; zbMATH DE number 3365044 (Why is no real title available?)
• scientific article; zbMATH DE number 3368449 (Why is no real title available?)
• Boundedness relations for linear constraint sets
• Clark's Theorem on linear programs holds for convex programs
• Clark's theorem for semi-infinite convex programs
• Complementarity Theorems for Linear Programming
• Farkas-Minkowski systems in semi-infinite programming
• Linear optimization and approximation. An introduction to the theoretical analysis and numerical treatment of semi-infinite programs. Transl. from the German
• On constraint sets of infinite linear programs over ordered fields
• On extreme points of bounded sets of generalized finite sequence spaces
• On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions
• Remark on the Constraint Sets in Linear Programming
• The extrema of probability determined by generalized moments. I: Bounded random variables
• Theorems on the dimensions of convex sets

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)