A linear inequality is an inequality in which each side is a linear function of the variables. In
one variable it has a solution set that is an interval, ray, empty
set, or the entire real line. In 
variables, an inequality
defines a closed half-space; a finite system of linear inequalities therefore defines a convex polytope
or, more generally, a polyhedron.
See also
Fourier-Motzkin Elimination,
Half-Space,
Linear
Programming,
Polyhedron
Explore with Wolfram|Alpha
References
Boyd, S. and Vandenberghe, L. Convex
Optimization. Cambridge, England: Cambridge University Press, 2004.
Cite this as:
Weisstein, Eric W. "Linear Inequality."
From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/LinearInequality.html
Subject classifications
