Difference between revisions of "Feasible set"
From Wiki @ Karl Jones dot com
Karl Jones (Talk | contribs) (Created page with "In mathematical optimization, a '''feasible region''', '''feasible set''', '''search space''', or '''solution space''' is the set of all possible points (sets of values of...") |
Karl Jones (Talk | contribs) (→External links) |
||
| Line 14: | Line 14: | ||
* [https://en.wikipedia.org/wiki/Feasible_region Feasible region] @ Wikipedia | * [https://en.wikipedia.org/wiki/Feasible_region Feasible region] @ Wikipedia | ||
| + | |||
| + | [[Category:Mathematics]] | ||
Latest revision as of 18:35, 24 April 2016
In mathematical optimization, a feasible region, feasible set, search space, or solution space is the set of all possible points (sets of values of the choice variables) of an optimization problem that satisfy the problem's constraints, potentially including inequalities, equalities, and integer constraints.
Description
This is the initial set of candidate solutions to the problem, before the set of candidates has been narrowed down.
See also
External links
- Feasible region @ Wikipedia
