Abstract
We state a duality theorem for disjunctive programming, which generalizes to this class of problems the corresponding result for linear programming.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Balas, E.,Intersection Cuts from Disjunctive Constraints, Carnegie-Mellon University, Management Science Research Report No. 330, 1974.
Balas, E.,Disjunctive Programming: Cutting Planes from Logical Conditions, Nonlinear Programming 2, Edited by O. L. Mangasarian, R. R. Meyer, and S. M. Robinson, pp. 279–312, Academic Press, New York, New York, 1975.
Glover, F.,Polyhedral Annexation in Mixed Integer and Combinatorial Programming, Mathematical Programming, Vol. 9, pp. 161–188, 1975.
Jeroslow, R. G.,Cutting Planes for Relaxations of Integer Programs, Carnegie-Mellon University, Management Science Research Report No. 347, 1974.
Owen, G.,Cutting Planes for Programs with Disjunctive Constraints, Journal of Optimization Theory and Applications, Vol. 11, pp. 49–55, 1973.
Balas, E.,Disjunctive Programming: Properties of the Convex Hull of Feasible Points, Carnegie-Mellon University, Management Science Research Report No. 348, 1974.
Bergthaller, C.,On the Duality Theorem of Linear Programming, Revue Roumaine de Mathématiques Pures et Appliquées, Vol. 12, pp. 611–616, 1967.
Author information
Authors and Affiliations
Additional information
Communicated by G. L. Nemhauser
This work was supported by the National Science Foundation under Grant No. MPS73-08534 A02 and by the US Office of Naval Research under Contract No. N00014-75-C-0621-NR047-048.
Rights and permissions
About this article
Cite this article
Balas, E. A note on duality in disjunctive programming. J Optim Theory Appl 21, 523–528 (1977). https://doi.org/10.1007/BF00933095
Issue Date:
DOI: https://doi.org/10.1007/BF00933095