Azarbaijan Shahid Madani University Communications in Combinatorics and Optimization 2538-2128 8 1 2023 03 01 Further study on "an extended shortest path problem A data envelopment analysis approach" 253 259 14352 10.22049/cco.2022.27510.1280 EN Javad Tayyebi Birjand university of technology Alireza Amirteymoori Full professor in Applied Mathematics & Operations Research, Islamic Azad University of Rasht, Iran. Journal Article 2021 11 10 Amirteimoori proposed an approach based on data envelopment analysis (DEA) for  multi-objective path problems on networks whose arcs contain multiple positive and negative attributes [A. Amirteimoori, An extended shortest path problem: A data envelopment analysis approach, Applied Mathematics Letters 25 (2012) 1839-1843]. The approach is to define a relative efficiency for each arcs using DEA models, and then to solve a longest path problem for obtaining a path with maximum efficiency. In this note, we focus on two drawbacks of the approach and illustrate them using examples. Then, we propose remedies to eliminate them. https://comb-opt.azaruniv.ac.ir/article_14352_daae7c08673222d8d10445fb190c76f1.pdf