A series of linear programming constraints on two variables produces a region of possible values for those variables. In Mathematics, linear programming (LP is a technique for optimization of a Linear Objective function, subject to Linear equality Solvable problems will have a feasible region in the shape of a simple polygon. In Geometry, a simple polygon is a polygon whose sides do not intersect

In optimization (a branch of mathematics), a candidate solution is a member of a set of possible solutions to a given problem. In Mathematics, the term optimization, or mathematical programming, refers to the study of problems in which one seeks to minimize or maximize a real function Mathematics is the body of Knowledge and Academic discipline that studies such concepts as Quantity, Structure, Space and In Mathematics, the elements or members of a set (or more generally a class) are all those objects which when collected together make up the A candidate solution does not have to be a likely or reasonable solution to the problem. 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. A genetic algorithm (GA is a Search technique used in Computing to find exact or Approximate solutions to optimization and Search

This applied mathematics-related article is a stub. Applied mathematics is a branch of Mathematics that concerns itself with the mathematical techniques typically used in the application of mathematical knowledge to other domains You can help Wikipedia by expanding it.