Candidate solution
From Wikipedia, the free encyclopedia
(Redirected from Feasible region)
"Solution space" redirects here.
 |
It has been suggested that this article be merged into Optimization problem. (Discuss) Proposed since June 2011. |
 |
This article does not cite any references or sources. (March 2012) |
A series of linear programming constraints on two variables produces a region of possible values for those variables. Solvable problems will have a feasible region in the shape of a simple polygon.
In optimization (a branch of mathematics) and search algorithms (a topic in computer science), a candidate solution is a member of a set of possible solutions to a given problem. A candidate solution does not have to be a likely or reasonable solution to the problem – it is simply in the set that satisfies all constraints.
The space of all candidate solutions is called the feasible region, feasible set, search space, or solution space.
In the case of the genetic algorithm, the candidate solutions are the individuals in the population being evolved by the algorithm.
 |
This applied mathematics-related article is a stub. You can help Wikipedia by expanding it. |
