Abstarct: Assignment, transportation and shortest path problems are the most important and successful topics in the field related to operations research. These problems are network structured LP problems that arise in several contexts and have deservedly a great deal of attention in the literature. Classical assignment, transportation and shortest path problems, assume that there are unit of cost or profit along an arc. In many occasions, various attributes (various costs and profits) for inputs and outputs are usually considered in these problems. Because of the frequent occurrence of such network structured problems, there is a need to extend an efficient procedure for these problems. Data Envelopment Analysis (DEA) is in this thesis to extend assignment, transportation and shortest path problems and then each extended problem with various attributes transform to equivalent classical linear programing problem with one efficiency index. Therefore, final problem present as an integer linear programing model for determine of a problem with maximum efficiency.