# Candidate solution

Talk0*34,141*pages on

this wiki

Assessment |
Biopsychology |
Comparative |
Cognitive |
Developmental |
Language |
Individual differences |
Personality |
Philosophy |
Social |

Methods |
Statistics |
Clinical |
Educational |
Industrial |
Professional items |
World psychology |

**Statistics:**
Scientific method ·
Research methods ·
Experimental design ·
Undergraduate statistics courses ·
Statistical tests ·
Game theory ·
Decision theory

In optimization (a branch of mathematics), 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*.

This page uses Creative Commons Licensed content from Wikipedia (view authors). |