This article includes a list of references, related reading, or external links, but its sources remain unclear because it lacks inline citations. (September 2016) |
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.[1]