On a fractional minimal cost flow problem on networks

On a fractional minimal cost flow problem on networks

0.00 Avg rating0 Votes
Article ID: iaor20127295
Volume: 6
Issue: 8
Start Page Number: 1945
End Page Number: 1949
Publication Date: Dec 2012
Journal: Optimization Letters
Authors:
Keywords: networks, networks: flow, programming: linear
Abstract:

In a recent paper, (Xu et al. , 2011) presented an algorithm for solving linear fractional programming problems over networks, and proposed and analyzed a dual formulation for this problem. This note shows that the algorithm of Xu et al. is precisely that of Gilmore and Gomory (1963), and the related duality results follow directly by adopting the transformation of Charnes and Cooper (1962) to equivalently rewrite the linear fractional program as a linear program and then applying linear programming duality.

Reviews

Required fields are marked *. Your email address will not be published.