We develop a general cutting plane based paradigm for three standard problems: lot-sizing, plant location and general network design, with and without capacity constraints. Other methods for solving these problems like branch and bound and Lagrangean relaxation have not performed well in all cases. We explore some theoretical and computational issues. These methods have wide ranging applications in road and rail transport network designs, irrigation systems and communication networks.