Part I of this paper introduces a general framework for the discussion of discrete production sets and the associated programming problems which arise when a particular endowment of factors is specified. In this part of the paper we shall apply these ideas to integer programming problems with two activities and bring to bear some of the basic considerations of the theory of computational complexity. The numbering of sections, figures, and equations will follow those used in Part I.