# GetWiki

*Inequation*

ARTICLE SUBJECTS

being →

database →

ethics →

fiction →

history →

internet →

language →

linux →

logic →

method →

news →

policy →

purpose →

religion →

science →

software →

truth →

unix →

wiki →

ARTICLE TYPES

essay →

feed →

help →

system →

wiki →

ARTICLE ORIGINS

critical →

forked →

imported →

original →

Inequation

[ temporary import ]

**please note:**

- the content below is remote from Wikipedia

- it has been imported raw for GetWiki

**inequation**is a statement that an inequality holds between two values.BOOK, The A to Z of Mathematics: A Basic Guide, Thomas H. Sidebotham, 252, John Wiley and Sons, 2002, 0-471-15045-2, It is usually written in the form of a pair of expressions denoting the values in question, with a relational sign between them indicating the specific inequality relation. Some examples of inequations are:

a < b,,
x+y+z leq 1,,
n > 1,,
x neq 0.,

Some authors apply the term only to inequations in which the inequality relation is specifically not-equal-to (â‰ ).{{MathWorld|title=Inequation|urlname=Inequation}}## Chains of inequations

A shorthand notation is used for the conjunction of several inequations involving common expressions, by chaining them together. For example, the chain
0 leq a < b leq 1,

is shorthand for
0 leq a~mathrm{and}~a< b~mathrm{and}~bleq 1.,

## Solving inequations

(File:Linear Programming Feasible Region.svg|thumb|Solution set for example inequations)Similar to equation solving,**inequation solving**means finding what values (numbers, functions, sets, etc.) fulfill a condition stated in the form of an inequation or a conjunction of several inequations.These expressions contain one or more

*unknowns*, which are free variables for which values are sought that cause the condition to be fulfilled. To be precise, what is sought are often not necessarily actual values, but, more in general, expressions. A

**solution**of the inequation is an assignment of expressions to the

*unknowns*that satisfies the inequation(s); in other words, expressions such that, when they are substituted for the unknowns, the inequations become true propositions.Often, an additional

**objective**expression is given that is to be minimized by an

*optimal*solution.For example,

0 leq x_1 leq 690 - 1.5 cdot x_2 ;land; 0 leq x_2 leq 530 - x_1 ;land; x_1 leq 640 - 0.75 cdot x_2

is a conjunction of inequations, partly written as chains (where land can be read as "and"); the set of its solutions is shown in blue in the picture (the red, green, and orange line corresponding to the 1st, 2nd, and 3rd conjunct, respectively).See Linear programming#Example for a larger example.Computer support in solving inequations is described in constraint programming;in particular, the simplex algorithm finds optimal solutions of linear inequations. The programming language Prolog III supports solving algorithms for particular classes of inequalities (and other relations) as a basic language feature, see constraint logic programming.## Special

sqrt{{f(x)}} < g(x)Leftrightarrowbegin{cases}

f(x) ge 0

g(x) > 0

f(x) < left [ g(x) right ]^2 quad

end{cases}g(x) > 0

f(x) < left [ g(x) right ]^2 quad

## See also

{{Wiktionary}}## References

{{reflist}}**- content above as imported from Wikipedia**

- "

- time: 10:39pm EDT - Wed, Jun 26 2019

- "

__Inequation__" does not exist on GetWiki (yet)- time: 10:39pm EDT - Wed, Jun 26 2019

[ this remote article is provided by Wikipedia ]

LATEST EDITS [ see all ]

GETWIKI 09 MAY 2016

GETWIKI 18 OCT 2015

GETWIKI 20 AUG 2014

GETWIKI 19 AUG 2014

GETWIKI 18 AUG 2014

© 2019 M.R.M. PARROTT | ALL RIGHTS RESERVED