Abstract
We investigate methods for projecting out 0–1 variables from a system of linear inequalities. After reviewing some special cases like monotone polyhedra and the satisfiability problem, we examine why Fourier elimination cannot be applied to the general case. Finally, we give a procedure based on disjunctive programming for solving the general case. We also discuss a simpler procedure applicable only under certain conditions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Balas, E. (1979). Disjunctive programming. Annals of Discrete Mathematics, 5, 3–51.
Balas, E. (1988). On the convex hull of the union of certain polyhedra. Operations Research Letters, 7, 279–284.
Balas, E. (1998). Disjunctive programming: properties of the convex hull of feasible points. Discrete Applied Mathematics, 89, 1–44. Invited paper.
Balas, E., & Pulleyblank, W. R. (1983). The perfectly matchable subgraph polytope of a bipartite graph. Networks, 13, 495–516.
Balas, E., & Pulleyblank, W. R. (1989). The perfectly matchable subgraph polytope of an arbitrary graph. Combinatorica, 9, 321–337.
Balas, E., Ceria, S., & Cornuéjols, G. (1993). A lift-and-project cutting plane algorithm for mixed 0–1 programs. Mathematical Programming, 58, 295–324.
Ball, M., Liu, W., & Pulleyblank, W. R. (1989). Two terminal Steiner tree polyhedra. In B. Cornet & H. Tulkens (Eds.), Contributions to operations research and economics—The twentieth anniversary of CORE, 1989 (pp. 251–284).
Bienstock, D., & Zuckerberg, M. (2004). Subset algebra lift operators for 0–1 integer programming. SIAM Journal on Optimization, 15, 63–95.
Blair, C. (1990). Representation for multiple righthand sides. Mathematical Programming, 49, 1–5.
Blair, C., Jeroslow, R. G., & Lowe, J. K. (1988). Some results and experiments in programming techniques for propositional logic. Computers and Operations Research, 13, 633–645.
Davis, M., & Putnam, H. (1960). A computing procedure for quantification theory. Journal of the ACM, 7, 201–215.
Hooker, J. N. (1992). Generalized resolution for 0–1 linear inequalities. Annals of Mathematics and Artificial Intelligence, 6, 271–286.
Hooker, J. N. (1992). Logical inference and polyhedral projection. In Lecture notes in computer science (Vol. 626, pp. 184–200). Berlin: Springer.
Jeroslow, R. W. (1988). A simplification for some disjunctive formulations. European Journal of Operational Research, 36, 116–121.
Lovász, L., & Schrijver, A. (1991). Cones of matrices and set functions and 0–1 optimization. SIAM Journal on Optimization, 1, 166–190.
Pochet, Y., & Wolsey, L. (2006). Production planning and mixed integer programming. Berlin: Springer.
Quine, W. V. (1952). The problem of simplifying truth functions. American Mathematical Monthly, 59, 521–531.
Sherali, H., & Adams, W. (1990). A hierarchy of relaxations between the continuous and convex hull representations for 0–1 programming problems. SIAM Journal on Discrete Mathematics, 3, 311–330.
Williams, H. C. (1976). Fourier-Motzkin elimination extension to integer programming problems. Journal of Combinatorial Theory (A), 21, 118–123.
Author information
Authors and Affiliations
Corresponding author
Additional information
Research supported by the National Science Foundation through grant DMI-0352885 and the Office of Naval Research through contract N00014-03-1-0133.
Rights and permissions
About this article
Cite this article
Balas, E. Projecting systems of linear inequalities with binary variables. Ann Oper Res 188, 19–31 (2011). https://doi.org/10.1007/s10479-009-0623-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-009-0623-3