Part I. Presents an approach to the study of production sets with indivisibilities and to the programming problems which arise when a factor endowment is specified. Computation of maximization problems; Number of binding constraints for an integer program; Replacement operation.