inequation

A shorthand notation is used for the conjunction of several inequations involving common expressions, by chaining them together. For example, the chain

:

is shorthand for

:

which also implies that and .

In rare cases, chains without such implications about distant terms are used.

For example $i\; \backslash neq\; 0\; \backslash neq\; j$ is shorthand for $i\; \backslash neq\; 0\; ~\; ~\; \backslash mathrm\{and\}\; ~\; ~\; 0\; \backslash neq\; j$, which does not imply $i\; \backslash neq\; j.${{citation needed|date=December 2019}} Similarly, is shorthand for , which does not imply any order of $a$ and $c$.{{cite book | author1=Brian A. Davey | author2=Hilary Ann Priestley | author2-link=Hilary Priestley | title=Introduction to Lattices and Order |title-link= Introduction to Lattices and Order |publisher=Cambridge University Press | series=Cambridge Mathematical Textbooks | isbn=0-521-36766-2 | lccn=89009753 | year=1990 |at= definition of a fence in exercise 1.11, p.23}}

File:Linear Programming Feasible Region.svg) for a sample list of 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, make the inequations true propositions.

Often, an additional objective expression (i.e., an optimization equation) is given, that is to be minimized or maximized by an optimal solution.{{Cite web|url=https://www.purplemath.com/modules/linprog.htm|title=Linear Programming: Introduction|last=Stapel|first=Elizabeth|website=Purplemath|access-date=2019-12-03}}

For example,

:$0\; \backslash leq\; x\_1\; \backslash leq\; 690\; -\; 1.5\; \backslash cdot\; x\_2\; \backslash ;\backslash land\backslash ;\; 0\; \backslash leq\; x\_2\; \backslash leq\; 530\; -\; x\_1\; \backslash ;\backslash land\backslash ;\; x\_1\; \backslash leq\; 640\; -\; 0.75\; \backslash cdot\; x\_2$

is a conjunction of inequations, partly written as chains (where $\backslash 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). For a larger example. see Linear programming#Example.

Computer support in solving inequations is described in constraint programming; in particular, the simplex algorithm finds optimal solutions of linear inequations.{{Cite web|url=https://www.britannica.com/science/optimization|title=Optimization - The simplex method|website=Encyclopedia Britannica|language=en|access-date=2019-12-03}} The programming language Prolog III also supports solving algorithms for particular classes of inequalities (and other relations) as a basic language feature. For more, see constraint logic programming.

Usually because of the properties of certain functions (like square roots), some inequations are equivalent to a combination of multiple others. For example, the inequation is logically equivalent to the following three inequations combined:

1. $f(x)\; \backslash ge\; 0$
2. $g(x)\; >\; 0$

{{Wiktionary}}

• Apartness relation — a form of inequality in constructive mathematics
• Equation
• Equals sign
• Inequality (mathematics)
• Relational operator

{{reflist}}

{{Authority control}}

Category:Elementary algebra

Category:Mathematical terminology