Carnegie Mellon University
Browse
Tight representation of logical constraints as cardinality rules.pdf.pdf' (783.58 kB)

Tight representation of logical constraints as cardinality rules

Download (783.58 kB)
journal contribution
posted on 2000-06-01, 00:00 authored by John N. Hooker, Hong Yan, Carnegie Mellon University.Engineering Design Research Center.
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."

History

Date

2000-06-01

Usage metrics

    Categories

    Keywords

    Proposition (Logic) Mathematical models.

    Licence

    In Copyright

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC