Constraint (mathematics)In mathematics, a constraint is a condition of an optimization problem that the solution must satisfy. There are several types of constraints—primarily equality constraints, inequality constraints, and integer constraints. The set of candidate solutions that satisfy all constraints is called the feasible set. The following is a simple optimization problem: subject to and where denotes the vector (x1, x2). In this example, the first line defines the function to be minimized (called the objective function, loss function, or cost function).
Dynamic equilibriumIn chemistry, a dynamic equilibrium exists once a reversible reaction occurs. Substances transition between the reactants and products at equal rates, meaning there is no net change. Reactants and products are formed at such a rate that the concentration of neither changes. It is a particular example of a system in a steady state. In physics, concerning thermodynamics, a closed system is in thermodynamic equilibrium when reactions occur at such rates that the composition of the mixture does not change with time.
AM-GM InequalityIn mathematics, the inequality of arithmetic and geometric means, or more briefly the AM–GM inequality, states that the arithmetic mean of a list of non-negative real numbers is greater than or equal to the geometric mean of the same list; and further, that the two means are equal if and only if every number in the list is the same (in which case they are both that number). The simplest non-trivial case – i.e., with more than one variable – for two non-negative numbers x and y, is the statement that with equality if and only if x = y.
