The fractional minimal cost flow problem on network

被引:0
|
作者
Cheng Xu
Xiao-ming Xu
Hai-feng Wang
机构
[1] University of Shanghai for Science and Technology,School of Management
[2] Qingdao University,College of Mathematics
来源
Optimization Letters | 2011年 / 5卷
关键词
Fractional minimum cost flow problem; Check number; Dual problem;
D O I
暂无
中图分类号
学科分类号
摘要
A problem and a new algorithm are given for the linear fractional minimal cost flow problem on network. Using a new check number and combining the characteristic of network to extend the traditional theories of minimum cost flow problem, discussed the relation between it and its dual problem. Optimality conditions are derived and a Network Simplex Algorithm is proposed that leads to optimal solution assuming certain properties. Finally, an numerical example test is also developed.
引用
收藏
页码:307 / 317
页数:10
相关论文
共 50 条
  • [31] Solving the convex cost integer dual network flow problem
    Ahuja, RK
    Hochbaum, DS
    Orlin, JB
    INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, 1999, 1610 : 31 - 44
  • [32] A COMPOSITE ALGORITHM FOR A CONCAVE-COST NETWORK FLOW PROBLEM
    BALAKRISHNAN, A
    GRAVES, SC
    NETWORKS, 1989, 19 (02) : 175 - 202
  • [33] Complexity, algorithms and applications of the integer network flow with fractional supplies problem
    Hochbaum, Dorit S.
    Levin, Asaf
    Rao, Xu
    OPERATIONS RESEARCH LETTERS, 2021, 49 (04) : 559 - 564
  • [34] Solving neutrosophic minimal cost flow problem using multi-objective linear programming problem
    Tripathi, Shubham Kumar
    Kumar, Ranjan
    JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES, 2024, 45 (04): : 1093 - 1104
  • [35] A solution approach to minimal average cost flow problem with lower and upper bounds on flows
    Zou, Zhimin
    Xie, Fanrong
    EXPERT SYSTEMS WITH APPLICATIONS, 2022, 187
  • [36] Ranking function-based solutions of fully fuzzified minimal cost flow problem
    Ghatee, Mehdi
    Hashemi, S. Mehdi
    INFORMATION SCIENCES, 2007, 177 (20) : 4271 - 4294
  • [37] An Effective Solution Approach Based on Extension Principle for Fuzzy Minimal Cost Flow Problem
    Niroomand, Sadegh
    Mahmoodirad, Ali
    Keshavarz, Esmaeil
    INTERNATIONAL JOURNAL OF UNCERTAINTY FUZZINESS AND KNOWLEDGE-BASED SYSTEMS, 2018, 26 (06) : 997 - 1015
  • [38] A deterministic annealing algorithm for the minimum concave cost network flow problem
    Dang, Chuangyin
    Sun, Yabin
    Wang, Yuping
    Yang, Yang
    NEURAL NETWORKS, 2011, 24 (07) : 699 - 708
  • [39] An exterior simplex type algorithm for the Minimum Cost Network Flow Problem
    Paparrizos, Konstantinos
    Samaras, Nikolaos
    Sifaleras, Angelo
    COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (04) : 1176 - 1190
  • [40] On the bicriterion - minimal cost/minimal label - spanning tree problem
    Climaco, Joao C. N.
    Captivo, M. Eugenia
    Pascoal, Marta M. B.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 204 (02) : 199 - 205