V. G. Mednitskii ,   Yu. V. Mednitskii Journal of Computer and System Sciences Intrnational , Vol.38 No.3 , 01.1999 , p. 436-443, language: английский ISSN 1064-2307  Аннотация This paper is devoted to the description and analysis of decomposition of one of possible schemes of the global optimal planning problem, for which the branch optimization problem arises at one of the blocks. It is shown that the decomposition can be only three-level. Both models are defined in one and the same class of nonlinear convex programming problems.  Ключевые слова decomposition, optimal planning, branch optimization, convex programming