A theory of linear inequality systems
type: Item
instance of: scholarly article
title: A theory of linear inequality systems
zbMATH Open document ID: 0646.15007
DOI: 10.1016/0024-3795(88)90024-9
published in: Linear Algebra and its Applications
publication date: 1988-01-01T00:00:00Z
review text: The authors analyze the behaviour of consistent systems of (possible infinite) linear inequalities in the Euclidean space \(R^ n\) in relation to the following features which are related to the solution set: boundedness, dimension, description of its boundary, redundant inequalities, minimality, finite reduction, and associated homogeneous systems. The obtained results are illustrated with many examples.
Mathematics Subject Classification ID: 15A39
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 4053811
zbMATH Keywords: consistent systems of linear inequalities
zbMATH Keywords: solution set
zbMATH Keywords: boundedness
zbMATH Keywords: dimension
zbMATH Keywords: boundary
zbMATH Keywords: redundant inequalities
zbMATH Keywords: minimality
zbMATH Keywords: finite reduction
author: Miguel Angel Goberna
author: Marco Antonio López Cerdá
reviewed by: Mihail Voicu
MaRDI profile type: Publication
full work available at URL: 0024-3795(88)90024-9
OpenAlex ID: W1997873830
cites work: Q3968041
cites work: DUALITY, HAAR PROGRAMS, AND FINITE SEQUENCE SPACES
cites work: Duality in semi-infinite programs and some works of Haar and Carathéodory
cites work: On Representations of Semi-Infinite Programs which Have No Duality Gaps
cites work: On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions
cites work: Q3665778
cites work: Theorems on the dimensions of convex sets
cites work: Q3865836
cites work: On infinite systems of linear inequalities
cites work: Q3208445
cites work: Q3698639
cites work: Farkas-Minkowski systems in semi-infinite programming
cites work: Q3340529
cites work: Q5534404
cites work: Duality gaps in semi-infinite linear programming—an approximation problem
cites work: Optimality conditions for nondifferentiable convex semi-infinite programming
cites work: Q5638112
cites work: Boundedness relations for linear constraint sets
cites work: Complementarity Theorems for Linear Programming
cites work: Q5525616
description: scientific article; zbMATH DE number 4053811