G. Tohidi - Department of Mathematics, Central Tehran Branch, Islamic Azad University, Tehran, Iran
H. Hassasi - Department of Mathematics, Central Tehran Branch, Islamic Azad University, Tehran, Iran
H. Taherzade - Department of Mathematics, Central Tehran Branch, Islamic Azad University, Tehran, Iran

This paper considers the procedure that converts the minimal cost network flow problem into the transportation problem and, then uses Data Envelopment Analysis (DEA) to suggest an extension of the new minimal cost network flow problem.