What is a Disjunction? - IEOR @IIT Bombay

More documents

Recommendations

Info

Using Formulations for “best” Split Inequalities 64 maximize bound maximize violation 32 Gap (%) closed by inequalities 16 8 4 2 1 1 4 16 64 256 1024 4096 16384 65536 Number of valid split inequalities
Conclusions and Future Work ◮ Selecting the “best” disjunction is N P−hard in the general case and also for several natural restrictions. ◮ These disjunctions can reduce significantly the size of branch-and-bound tree. ◮ Inequalities obtained from such disjunctions can also increase the bound much better than maximally violated inequalities. ◮ However, fast heuristics to discover such disjunctions need to be developed. ◮ What is best way to use a disjunction: branch or generate valid inequalities?
Page 1 and 2: In Search of Optimal Disjunctions i
Page 3 and 4: What is a Disjunction? Given a MIP
Page 5 and 6: Formulation Technique LP 2 DUAL 2 M
Page 7 and 8: Examples * * * * * * * * * * * * *
Page 9 and 10: Computational Complexity The proble
Page 11: Using Formulations for “best” C

What is a Disjunction? - IEOR @IIT Bombay

Create successful ePaper yourself

Delete template?

Save as template?