Difference between revisions of "Constraint (mathematics)"

From Wiki @ Karl Jones dot com
Jump to: navigation, search
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 ==
  
 +
* [[Candidate solution]]
 
* [[Feasible set]]
 
* [[Feasible set]]
 
* [[Mathematical optimization]]
 
* [[Mathematical optimization]]

Revision as of 08:20, 7 February 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

External links