Tight representation of logical constraints as cardinality rules
journal contributionposted on 01.06.2000 by John N. Hooker, Hong Yan, Carnegie Mellon University.Engineering Design Research Center.
Any type of content formally published in an academic journal, usually following a peer-review process.
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."