Difference between revisions of "Constraint (mathematics)"
From Wiki @ Karl Jones dot com
Karl Jones (Talk | contribs) (→External links) |
Karl Jones (Talk | contribs) (→See also) |
||
| Line 13: | Line 13: | ||
== See also == | == See also == | ||
| + | * [[2-satisfiability]] - the problem of determining whether a collection of two-valued ([[Boolean algebra|Boolean]] or [[Binary number|binary]]) variables with [[Constraint (mathematics)|constraints]] on pairs of variables can be assigned values satisfying all the constraints. | ||
* [[Candidate solution]] | * [[Candidate solution]] | ||
* [[Feasible set]] | * [[Feasible set]] | ||
Latest revision as of 12:34, 24 August 2016
In mathematics, a constraint is a condition of an optimization problem that the solution must satisfy.
Description
There are several types of constraints, primarily:
- Equality constraints
- Inequality constraints
- Integer constraints
The set of candidate solutions that satisfy all constraints is called the feasible set.
See also
- 2-satisfiability - the problem of determining whether a collection of two-valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all the constraints.
- Candidate solution
- Feasible set
- Mathematical optimization
- Mathematics
- Optimization problem
