Dynamic deployment of industries. II

A method is described for solution of a nonlinear programming problem on a shrunk set specified by an addition constraint on the sequence of implementing the development projects (determined by permutation of variable indices). For the original nonlinear programming problem two branch-and-bound methods are suggested of which one relies on structural decomposition.