Integer dynamic problems of economic planning with network constraints. II

A method is proposed for solving the problem in continuous time whereby the sequence of partial non-packable solutions is selected, sets of such solutions are estimated, and non-pomising sets are eliminated. The method may lead to a solution with a specified (absolute or relative) accuracy in the functional or the objective parameter. A special list is proposed for branching and the logic of transition from one possible solution to another is introduced so as to insure completeness and eliminate duplication in the selection. The solution algorithms are described and an iffustrative example is given.