Research Reports from the Department of Operations
Document Type
Report
Publication Date
2-1-1972
Abstract
The mixed integer program is transformed to its equivalent integer program which has a vast number of "z inequality" constraints. A brief description of Benders' partitioning algorithm for the mixed integer program, which is suggested by the transformation, is then given. It is shown that unless a bounding constraint is explicitly introduced, a z inequality (hyperplane) that does not intersect an optimal solution to the integer program which appears in the algorithm cannot be dropped. Furthermore, if the bounding constraint is used in place of keeping not binding inequalities, the algorithm may converge at a slower rate. A small plant location problem is used as an illustration.
Keywords
Operations research, Integer programming, Decomposition (Mathematics), Algorithms, Mathematical optimization
Publication Title
Technical Memorandums from the Department of Operations, School of Management, Case Western Reserve University
Issue
Technical memorandum no. 266
Rights
This work is in the public domain and may be freely downloaded for personal or academic use
Recommended Citation
Salkin, Harvey M., "Binding Inequalities in Benders' Partitioning Algorithm" (1972). Research Reports from the Department of Operations. 59.
https://commons.case.edu/wsom-ops-reports/59