Professional Documents
Culture Documents
Linear Inequalities
Linear Inequalities
or
or
or
That is
or
Applications
Polyhedra
Linear programming
A linear programming problem seeks to
optimize (find a maximum or minimum
value) a function (called the objective
function) subject to a number of
constraints on the variables which, in
general, are linear inequalities.[5] The list of
constraints is a system of linear
inequalities.
Generalization
The above definition requires well-defined
operations of addition, multiplication and
comparison; therefore, the notion of a
linear inequality may be extended to
ordered rings, and in particular to ordered
fields.
Notes
1. Miller & Heeren 1986, p. 355
2. Technically, for this statement to be
correct both a and b can not simultaneously
be zero. In that situation, the solution set is
either empty or the entire plane.
3. Angel & Porter 1989, p. 310
4. In the 2-dimensional case, both linear
forms and affine functions are historically
called linear functions because their graphs
are lines. In other dimensions, neither type
of function has a graph which is a line, so
the generalization of linear function in two
dimensions to higher dimensions is done by
means of algebraic properties and this
causes the split into two types of functions.
However, the difference between affine
functions and linear forms is just the
addition of a constant.
5. Angel & Porter 1989, p. 373
References
Angel, Allen R.; Porter, Stuart R. (1989), A
Survey of Mathematics with Applications
(3rd ed.), Addison-Wesley, ISBN 0-201-
13696-1
Miller, Charles D.; Heeren, Vern E. (1986),
Mathematical Ideas (5th ed.), Scott,
Foresman, ISBN 0-673-18276-2
External links
Khan Academy: Linear inequalities, free
online micro lectures
Retrieved from
"https://en.wikipedia.org/w/index.php?
title=Linear_inequality&oldid=869594112"