Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Constraint satisfaction dual problem
open-in-new
<p>The dual problem is a reformulation of a <a href="/facts/Constraint_satisfaction_problem/oKCeIV2L">constraint satisfaction problem</a> expressing each constraint of the original problem as a variable. Dual problems only contain <a href="/facts/Binary_constraint/KRRtowt4">binary constraints</a>, and are therefore solvable by <a href="/facts/Algorithm/fnl5NmRt">algorithms</a> tailored for such problems. The join graphs and join trees of a constraint satisfaction problem are <a href="/facts/Graph_(graph_theory)/kw3eIBUe">graphs</a> representing its dual problem or a problem obtained from the dual problem removing some redundant constraints. </p>