An observation on the structure of production sets with indivisibilities.
A subset of the constraints of an integer programming problem is said to be binding if, when the remaining constraints are eliminated, the smaller problem has the same optimal solution as the original problem. It is shown that an integer programming problem with n variables has a set of binding constraints of cardinality less than or equal to 2(n)-1. The bound is sharp.
Scarf
H E
HE
Cowles Foundation for Research in Economics at Yale University, Box 2125, Yale Station, New Haven, Connecticut 06520.