Example: barber
5 CONSTRAINT SATISFACTION PROBLEMS

5 CONSTRAINT SATISFACTION PROBLEMS

Back to document page

PROGRAMMING straints must be linear inequalities forming a convex region. Linear programming problems can be solved in time polynomial in the number of variables. Problems with different types of constraints and objective functions have also been studied—quadratic programming, second-order conic programming, and so on.

  Programming, Satisfaction, Constraints, Constraint satisfaction

Download 5 CONSTRAINT SATISFACTION PROBLEMS


Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Advertisement

Related search queries