| Article ID: | iaor1990661 |
| Country: | Netherlands |
| Volume: | 9 |
| Issue: | 1 |
| Start Page Number: | 1 |
| End Page Number: | 7 |
| Publication Date: | Jan 1990 |
| Journal: | Operations Research Letters |
| Authors: | Gottlieb Elsie Sterbin . |
Facet defining inequalities for an equivalent form of the dichotomous knapsack problem (DKP) are derived. All nontrivial canonical facets associated with DKP are characterized and for a special case of DKP the class of facets are characterized which will guarantee that the corresponding linear programming relaxation has an integral optimal solution.