Integer dynamic problems of economic planning with network constraints

A general statement is given for a dynamic problem of batch manufacturing is given which recognizes buffers, and constraints on power, network structures (which specify the activity sequences), raw materials, and planned targets. The optimality criterion may be the maximum of a linear functional, nondecreasing with negative variation of the variables or the minimum of a scalar parameter on which the problem conditions depend. The notion of an unpackable feasible solution is introduced and a theorem on the existence of an optimal unpackable solution is proven with the problem solvable.