Continuous Search Space

From GM-RKB
Jump to: navigation, search

A Continuous Search Space is a search space that is a continuous space.



References

2015

  • (Wikipedia, 2015) ⇒ http://en.wikipedia.org/wiki/feasible_region Retrieved:2015-12-13.
    • 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. This is the initial set of candidate solutions to the problem, before the set of candidates has been narrowed down.

      For example, consider the problem

       :Minimize [math] x^2+y^4 [/math] with respect to the variables [math] x [/math] and [math] y, [/math] subject to : [math] 1 \le x \le 10 [/math] and : [math] 5 \le y \le 12. \, [/math] Here the feasible set is the set of pairs (x, y) in which the value of x is at least 1 and at most 10 and the value of y is at least 5 and at most 12. Note that the feasible set of the problem is separate from the objective function, which states the criterion to be optimized and which in the above example is [math] x^2+y^4. [/math] In many problems, the feasible set reflects a constraint that one or more variables must be non-negative. In pure integer programming problems, the feasible set is the set of integers (or some subset thereof). In linear programming problems, the feasible set is a convex polytope: a region in multidimensional space whose boundaries are formed by hyperplanes and whose corners are vertices.

      Constraint satisfaction is the process of finding a point in the feasible region.