What is a Disjunction? - IEOR @IIT Bombay

More documents

Recommendations

Info

The Formulation Lower bound after “application” of a disjunction can be at least K if and only if pA − s L c − π = 0 qA − s R c + π = 0 pb − s L K − π 0 ≥ δ (2) qb − s R K + π 0 ≥ −1 + δ p, q, s L , s R ≥ 0 (π, π 0 ) ∈ Z d × {0} n−d × Z 1 , is feasible for some δ > 0. Solve (2) over different values of K to get the best one.
Examples * * * * * * * * * * * * * * 1 * * S 1 S 2 * * * * * * * * of disjunctions: 4) (No. of disjunctions: 1) Tree size for selected instances: Instance Variable Gen. Disj. Improvement 10teams 115 12 9.58 bell3a 16387 259 63.27 flugpl 394 6 65.67 gt2 340 10 34 mod008 2840 68 41.76 vpm1 263111 20 13155.55 (No.
Page 1 and 2: In Search of Optimal Disjunctions i
Page 3 and 4: What is a Disjunction? Given a MIP
Page 5: Formulation Technique LP 2 DUAL 2 M
Page 9 and 10: Computational Complexity The proble
Page 11 and 12: Using Formulations for “best” C
Page 13: Conclusions and Future Work ◮ Sel

What is a Disjunction? - IEOR @IIT Bombay

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?