Difference between revisions of "Constraint (mathematics)"
From Wiki @ Karl Jones dot com
Karl Jones (Talk | contribs) (Created page with "In mathematics, a '''constraint''' is a condition of an optimization problem that the solution must satisfy. == Description == There are several types of constraints...") |
Karl Jones (Talk | contribs) (→See also) |
||
| (3 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
| − | In [[mathematics]], a '''constraint''' is a condition of an [[optimization problem]] that the solution must satisfy. | + | In [[mathematics]], a '''constraint''' is a condition of an [[Mathematical optimization|optimization problem]] that the solution must satisfy. |
== Description == | == Description == | ||
| Line 9: | Line 9: | ||
* Integer constraints | * Integer constraints | ||
| − | The set of candidate solutions that satisfy all constraints is called the [[feasible set]]. | + | The set of [[Candidate solution|candidate solutions]] that satisfy all constraints is called the [[feasible set]]. |
== 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]] | ||
* [[Feasible set]] | * [[Feasible set]] | ||
| + | * [[Mathematical optimization]] | ||
* [[Mathematics]] | * [[Mathematics]] | ||
* [[Optimization problem]] | * [[Optimization problem]] | ||
| + | |||
| + | == External links == | ||
| + | |||
| + | * [https://en.wikipedia.org/wiki/Constraint_(mathematics) Constraint (mathematics)] | ||
| + | |||
| + | [[Category:Mathematics]] | ||
Latest revision as of 11: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
