Wikia

Psychology Wiki

Constraint (mathematics)

Talk0
34,117pages on
this wiki
Revision as of 21:37, December 31, 2011 by Dr Joe Kiff (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Assessment | Biopsychology | Comparative | Cognitive | Developmental | Language | Individual differences | Personality | Philosophy | Social |
Methods | Statistics | Clinical | Educational | Industrial | Professional items | World psychology |

Statistics: Scientific method · Research methods · Experimental design · Undergraduate statistics courses · Statistical tests · Game theory · Decision theory


In mathematics, a constraint is a condition that a solution to an optimization problem must satisfy. There are two types of constraints: equality constraints and inequality constraints. The set of solutions that satisfy all constraints is called the feasible set.

ExampleEdit

The following is a simple optimization problem:

\min f(\bold x) = x_1^2+x_2^4

subject to

 x_1 \ge 1

and

 x_2 = 1, \,

where \bold x denotes the vector (x1, x2).

In this example, the first line defines the function to be minimized (called the objective or cost function). The second and third lines define two constraints, the first of which is an inequality constraint and the second is an equality constraint. These two constraints define the feasible set of candidate solutions.

Without the constraints, the solution would be (0,0)\, where f(\bold x) has the lowest value. But this solution does not satisfy the constraints. The solution of the constrained optimization problem stated above but  \bold x = (1,1), which is the point with the smallest value of f(\bold x) that satisfies the two constraints.

Terminology Edit

  • If a constraint is an equality at a given point, the constraint is said to be Template:Visible anchor, as the point cannot be varied in the direction of the constraint.
  • If a constraint is an inequality at a given point, the constraint is said to be Template:Visible anchor, as the point can be varied in the direction of the constraint.
  • If a constraint is not satisfied, the point is said to be infeasible.

See also Edit

External links Edit

This page uses Creative Commons Licensed content from Wikipedia (view authors).
Advertisement | Your ad here

Around Wikia's network

Random Wiki