Optimization problem: Difference between revisions

Revision as of 05:57, 19 February 2010

Revision as of 08:43, 19 February 2010

Line 2:

* <math>I</math> is a set of instances;

* given an instance <math>x \in I</math>, <math>f(x)</math> is the set of feasible solutions;

* given an instance <math>x</math> and a feasible solution <math>y</math> of <math>x</math>, <math>m(x, y)</math> denotes the measure of <math>y</math>, which is usualhttp://en.wikipedia.org/w/index.php?title=Optimization_problem&action=submitlyusually a positive real.

* <math>g</math> is the goal function, and is either <math>\min</math> or <math>\max</math>.