# Constraint optimization problem

### From Glossary

The general aim for constraint optimization problem is to find an optimal solution to a set of constraints subject to some objective function *obj*. For example, consider a CSP together with a function . is a mapping from solutions to (i.e., all elements the set ) to the set of real numbers, .

A solution, , to a constraint optimization problem is a complete assignment of variables that satisfies all constraints and for which the value is optimal (either minimal or maximal, depending on the sense of the optimization).

See also constraint satisfaction problem.