Tight representation of logical constraints as cardinality rules

Abstract: "We address the problem of finding a 'tight' representation of complex logical constraints in a mixed integer programming model by describing a convex hull representation of cardinality rules. A cardinality rule asserts that if at least k of the propositions AΓéü,...,A[subscript m] are true, then at least l of the propositions BΓéü,...,B[subscript n] are true."