论文信息 - A note on duality in disjunctive programming - 字舞流文

A note on duality in disjunctive programming

We state a duality theorem for disjunctive programming, which generalizes to this class of problems the corresponding result for linear programming.

[1] Fred W. Glover,et al. Polyhedral annexation in mixed integer and combinatorial programming , 1975, Math. Program..

[2] G. Owen. Cutting planes for programs with disjunctive constraints , 1973 .

[3] Egon Balas. Intersection Cuts from Disjunctive Constraints. , 1974 .

[4] E. Balas. DISJUNCTIVE PROGRAMMING: CUTTING PLANES FROM LOGICAL CONDITIONS , 1975 .