Data envelopment analysis models play an important role in decision making. In this paper, one-stage and two-stage nonlinear programming problems are investigated in order to evaluate the efficiency of two types of network data envelopment analysis model. The first type of network data envelopment analysis model has a series structure with three stages and a feedback between the last step and the middle step, the second model has a three-stage series structure with two feedback between the final step and the first step and the middle step. By examining the overall efficiency of the models based on the one-stage programming problem, a two-stage programming problem is also applied in order to evaluate the efficiency of each step. In order to solve one-stage nonlinear programming problems and two-stage linear and nonlinear programming problems derived from modeling, a linearization method based on coordinate transformation, and constant assumption and gradual growth of some variables is presented. In the last section, the proposed methods have been discussed using some numerical examples.