Combinatorial Optimization with Rational Objective Functions: A Communication
Ravindra K. Ahuja, J.L. Batra, Sanjeev Gupta · Mathematics of Operations Research · 1983
Megiddo (Megiddo, N. 1979. Combinatorial optimization with rational objective functions. Math. Oper. Res. 4 414–424.) has proposed an algorithm to solve a class of combinatorial optimization problems with rational objective functions in polynomial time. The minimum ratio path problem is claimed to be one such problem. This claim is not correct as indicated below.