| Article ID: | iaor20043025 |
| Country: | Netherlands |
| Volume: | 31 |
| Issue: | 6 |
| Start Page Number: | 420 |
| End Page Number: | 428 |
| Publication Date: | Nov 2003 |
| Journal: | Operations Research Letters |
| Authors: | Ball Michael O., Chen Chien-Yu, Zhao Zhen-Ying |
| Keywords: | programming: integer |
This paper defines a set of material compatibility constraints for use in order promising mixed integer programs. The constraints always represent a necessary condition for compatibility and, in certain cases, are both necessary and sufficient. The underlying analysis represents incompatibilities using bipartite graphs and applies results from the perfectly matchable subgraph polytope.