The fractional minimal cost flow problem on network

DOI10.1007/s11590-010-0210-1zbMath1242.90254OpenAlexW2020780601MaRDI QIDQ537644

Hai-Feng Wang, Cheng Xu, Xiao-Ming Xu

Publication date: 20 May 2011

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-010-0210-1

zbMATH Keywords

dual problemfractional minimum cost flow problemcheck number

Mathematics Subject Classification ID

Fractional programming (90C32) Deterministic network models in operations research (90B10)

Related Items

Time variant multi-objective linear fractional interval-valued transportation problem ⋮ Fractional multi-commodity flow problem: duality and optimality conditions ⋮ Globally minimizing the sum of a convex-concave fraction and a convex function based on wave-curve bounds ⋮ On a fractional minimal cost flow problem on networks ⋮ Some inverse optimization problems on network ⋮ Interval division and linearization algorithm for minimax linear fractional program ⋮ An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems

Uses Software

• LPbook

Cites Work

• Unnamed Item
• Linear fractional programming and duality
• A Parametric Method for Solving the Linear Fractional Programming Problem
• Fractional programming
• Linear programming. Foundations and extensions