Constrained optimization: Difference between revisions

Revision as of 18:25, 23 February 2006

Revision as of 19:11, 8 May 2006

Line 17:

===First-choice bounding functions===

One way for evaluating this upper bound for a partial solution is to consider each soft constraint separately. For each soft constraint, the maximal possible value for any assignment to the unassigned variables is assumed. The sum of these values is an upper bound because the soft constraints cannot assume ana higerhigher value. It is exact because the maximal values of soft constraints may derive from different evaluations: a soft constraint may be maximal for <math>x=a</math> while another constraint is maximal for <math>x=b</math>.

===Russian doll search===