The paper deals with an application of the network (dichotomous) programming method forsolving multi-extremal problems and discrete optimization problems. The concept of a generalizeddual problem is introduced and a theorem on its convexity is proved. Network programming methodis used to build a business-forming project portfolio as well as an algorithm for solving completelydependent related projects is developed. Also, this method is used to solve the problem of building abusiness-supporting project portfolio for which the lower cost estimate is obtained. A computationalexperiment is carried out to evaluate the suggested algorithm, which showed that for largedimensions of the problem it is more effective than for solving the problem by linear programmingmethods.