A hybrid algorithm for solving network flow problems with side constraints

被引:10
|
作者
Mathies, S [1 ]
Mevert, P [1 ]
机构
[1] Free Univ Berlin, D-14195 Berlin, Germany
关键词
network optimization; side constraints; basis partitioning;
D O I
10.1016/S0305-0548(98)00001-X
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
We consider network flow problems with few additional linear side constraints. Three approaches for solving such problems are presented. The first method is a specialized Simplex Algorithm with primal partitioning of the basis. Secondly, Lagrangean relaxation is used, solving the dual problem by subgradient optimization. Finally, good starting solutions are generated by relaxing the side constraints, solving the resulting pure network problem, and using the solution of the pure network problem as an advanced start for a general LP-optimizer. Numerical tests show that a hybrid combination of Lagrangean relaxation and subsequent optimization by primal partitioning is most efficient. (C) 1998 Elsevier Science Ltd. All rights reserved.
引用
收藏
页码:745 / 756
页数:12
相关论文
共 50 条
  • [31] A Discrete-time Projection Neural Network for Solving Convex Quadratic Programming Problems with Hybrid Constraints
    Fengqiu Liu
    Jianmin Wang
    Hongxu Zhang
    Pengfei Li
    International Journal of Control, Automation and Systems, 2023, 21 : 328 - 337
  • [32] A SEQUENTIAL ALGORITHM FOR SOLVING NONLINEAR OPTIMIZATION PROBLEMS WITH CHANCE CONSTRAINTS
    Curtis, Frank E.
    Waechter, Andreas
    Zavala, Victor M.
    SIAM JOURNAL ON OPTIMIZATION, 2018, 28 (01) : 930 - 958
  • [33] AN EFFICIENT ALGORITHM FOR SOLVING SEMIINFINITE INEQUALITY PROBLEMS WITH BOX CONSTRAINTS
    MAYNE, DQ
    MICHALSKA, H
    POLAK, E
    APPLIED MATHEMATICS AND OPTIMIZATION, 1994, 30 (02): : 135 - 157
  • [34] COMPUTATION EFFICIENCY IN SOLVING FLOW NETWORK PROBLEMS
    MALEK, GJ
    TRANSACTIONS OF THE AMERICAN NUCLEAR SOCIETY, 1969, 12 (02): : 835 - &
  • [35] A new algorithm for solving function optimization problems with inequality constraints
    Guo, Tao
    Kang, Li-Shan
    Li, Yan
    Wuhan Daxue Xuebao/Journal of Wuhan University, 45 (05):
  • [36] A Hybrid Non-strict Implicit Constraints Solving Algorithm
    Yu Haiyan
    He Yuanjun
    Geng Zhaofeng
    ICIC 2009: SECOND INTERNATIONAL CONFERENCE ON INFORMATION AND COMPUTING SCIENCE, VOL 3, PROCEEDINGS: APPLIED MATHEMATICS, SYSTEM MODELLING AND CONTROL, 2009, : 161 - +
  • [37] Optimizing flow rates in a queueing network with side constraints
    Univ of Maryland, College Park, United States
    Eur J Oper Res, 3 (586-591):
  • [38] Optimizing flow rates in a queueing network with side constraints
    Pourbabai, B
    Blanc, JPC
    Schouten, FAV
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 88 (03) : 586 - 591
  • [39] A MODIFIED HYBRID ALGORITHM FOR SOLVING PSEUDOMONOTONE EQUILIBRIUM PROBLEMS
    Suparatulatorn, Raweerote
    UNIVERSITY POLITEHNICA OF BUCHAREST SCIENTIFIC BULLETIN-SERIES A-APPLIED MATHEMATICS AND PHYSICS, 2024, 86 (02): : 25 - 32
  • [40] A Hybrid Immune Algorithm for Solving Dynamic Optimization Problems
    Yang Zhou
    Yuan Yi-chuan
    Luo Ting-xing
    Qin Jin
    PROCEEDINGS OF THE 30TH CHINESE CONTROL AND DECISION CONFERENCE (2018 CCDC), 2018, : 5326 - 5332