Constrained optimization

In constraint satisfaction, constraint optimization seeks for a solution maximizing or minizing a cost function.

Definition

A constraint optimization problem can be defined as a regular constraint satisfiaction problem in which constraints are weighted and the goal is to find a solution maximizing the weight of satisfied constraints.

Alternative, a constraint optimization problem can be defined as a regular constraint satisfaction problem augumented with a number of "local" cost functions. The aim of constraint optimization is to find a solution to the problem whose cost, evaluated as the sum of the cost functions, is maximized or minimized. The regular constraints are called hard constraints, while the cost functions are called soft constraints. These names illustrate that hard constraints are to be necessarily satisfied, while soft constraints only express a preference of some solutions (those having an high or low cost) over other ones (those having lower/higher cost).

Reference

• Dechter, Rina (2003). Constraint Processing. Morgan Kaufmann. ISBN 1-55860-890-7.