Abstract
We derive by means of disjunctive programming the convex hull representation of logical conditions called cardinality rules given by Hong and Hooker (1999), and specify an efficient separation algorithm for the family of inequalities defining the convex hull. We then extend both the convex hull characterization and the efficient separation procedure to more general logical conditions.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
