Fandom

Psychology Wiki

Candidate solution

34,202pages on
this wiki
Add New Page
Talk0 Share

Ad blocker interference detected!


Wikia is a free-to-use site that makes money from advertising. We have a modified experience for viewers using ad blockers

Wikia is not accessible if you’ve made further modifications. Remove the custom ad blocker rule(s) and the page will load as expected.

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


Merge-arrow
It has been suggested that this article or section be merged into Optimization problem. (Discuss)
File:Linear Programming Feasible Region.svg

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.

Arithmetic symbols 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).

Also on Fandom

Random Wiki