An additive non-linear programming problem☆

Abstract AN ADDITIVE non-linear programming problem on a tree is considered. A solution algorithm using a specific form of the optimality principle of this problem is proposed and investigated. The volumes of the scanning and memory of the algorithm are estimated.