A theory of linear inequality systems

DOI10.1016/0024-3795(88)90024-9zbMath0646.15007OpenAlexW1997873830MaRDI QIDQ1103695

Miguel Angel Goberna, Marco A. López

Publication date: 1988

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(88)90024-9

zbMATH Keywords

boundednessdimensionsolution setminimalityboundaryredundant inequalitiesconsistent systems of linear inequalitiesfinite reduction

Mathematics Subject Classification ID

Linear programming (90C05) Linear inequalities of matrices (15A39)

Related Items (16)

The Voronoi inverse mapping ⋮ Locally polyhedral linear inequality systems ⋮ Optimality theory for semi-infinite linear programming^∗ ⋮ Miguel A. Goberna: ``The challenge was to bring Spanish research in mathematics to normality ⋮ Marco A. López, a pioneer of continuous optimization in Spain ⋮ Voronoi cells via linear inequality systems ⋮ Dimension and finite reduction in linear semi-infinite programming ⋮ Saturation in linear optimization ⋮ Analytical linear inequality systems and optimization ⋮ The linear model revisited ⋮ Quasipolyhedral sets in linear semiinfinite inequality systems ⋮ Selected applications of linear semi-infinite systems theory ⋮ On duality in semi-infinite programming and existence theorems for linear inequalities ⋮ Redundancy in linear inequality system ⋮ Locally Farkas-Minkowski linear inequality systems ⋮ Conditions for the uniqueness of the optimal solution in linear semi- infinite programming

Cites Work

• Farkas-Minkowski systems in semi-infinite programming
• Theorems on the dimensions of convex sets
• On infinite systems of linear inequalities
• Boundedness relations for linear constraint sets
• Duality in Semi-Infinite Programs and Some Works of Haar and Carathéodory
• DUALITY, HAAR PROGRAMS, AND FINITE SEQUENCE SPACES
• Optimality conditions for nondifferentiable convex semi-infinite programming
• Duality gaps in semi-infinite linear programming—an approximation problem
• On Representations of Semi-Infinite Programs which Have No Duality Gaps
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A theory of linear inequality systems