A problem of finding optimal parameterized path in digraph is considered. A parameterized path is a path each arc of which is assigned a parameter fforn a given set. A superposition of recurrent-monotone functions is accepted as an objective fimction where one of the functions is defined by using max operation. A twolevel decomposition scheme for solving an initial problem is proposed. Methods for solving the obtained after decomposition subproblems are developed
