Generalized separable programming

A class of $k$-separable problems of mathematical programming is identifier where the objective function and a set of constraints are represented as a sum of functions, each depending on (no more than $k$) variables. Solution of multi-extremum $k$-separable problems by the branch-and-bound technique is reduced to solution of a sequence of estimating convex problems which are formed by construction, of convex hulls for addends of the objective function and constraints. Examples are given of biseparable (2-separable) problems on graphs which describe development of transportation and. electric systems.