An interior point method in Dantzig-Wolfe decomposition

被引:9
|
作者
Martinson, RK [1 ]
Tind, J [1 ]
机构
[1] Univ Copenhagen, Inst Math Sci, Dept Operat Res, DK-2100 Copenhagen O, Denmark
关键词
Dantzig-Wolfe decomposition; infeasible-interior-point method; central path; central solutions; analytic center;
D O I
10.1016/S0305-0548(98)00101-4
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This paper studies the application of interior point methods in Dantzig-Wolfe decomposition. The main idea is to develop strategies for finding useful interior points in the dual of the restricted:master problem as an alternative to finding an optimal solution or the analytic center. The method considers points on the central path between the optimal solution and the analytic center, and thus it includes the previous instances as extreme cases. For a given duality gap there exists a unique primal-dual solution on the central path. We use this solution for some choice of the duality gap. The desired duality gap is either kept fixed in all master iterations or it is updated according to some strategy. We test the method On a number of randomly generated problems of different sizes and with different numbers of subproblems. For most problems our method requires fewer master iterations than the classical Dantzig-Wolfe and the analytic center method. This result is especially true for problems requiring many master iterations. In addition to experiments using an interior point method on the master problems, we have also performed some experiments with an interior point method on the subproblems. Instead of finding an optimal solution for the problems we have developed a strategy that selects a feasible solution having a reduced cost below some prescribed level; Our study focuses on comparative experiments.
引用
收藏
页码:1195 / 1216
页数:22
相关论文
共 50 条
  • [1] An interior point method in Dantzig-Wolfe decomposition
    Martinson, Ruben Kirkeby
    Tind, Jørgen
    [J]. Computers and Operations Research, 1999, 26 (12): : 1195 - 1216
  • [2] DANTZIG-WOLFE DECOMPOSITION ALGORITHM
    APPA, GM
    GONCALVE.AS
    [J]. OPERATIONAL RESEARCH QUARTERLY, 1969, 20 (02): : 275 - &
  • [3] A stabilized structured Dantzig-Wolfe decomposition method
    Frangioni, Antonio
    Gendron, Bernard
    [J]. MATHEMATICAL PROGRAMMING, 2013, 140 (01) : 45 - 76
  • [4] A COOPERATIVE VARIANT OF DANTZIG-WOLFE DECOMPOSITION METHOD
    AHN, BH
    [J]. JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 1989, 32 (04) : 462 - 474
  • [5] Dantzig-Wolfe decomposition of variational inequalities
    Fuller J.D.
    Chung W.
    [J]. Computational Economics, 2005, 25 (4) : 303 - 326
  • [6] Decomposition Algorithms for Mathematical Programming and Generalization of the Dantzig-Wolfe Method
    Oskorbin, Nikolai
    Khvalynskiy, Dmitriy
    [J]. CYBERNETICS APPROACHES IN INTELLIGENT SYSTEMS: COMPUTATIONAL METHODS IN SYSTEMS AND SOFTWARE 2017, VOL. 1, 2018, 661 : 31 - 37
  • [7] A data driven Dantzig-Wolfe decomposition framework
    Basso, Saverio
    Ceselli, Alberto
    [J]. MATHEMATICAL PROGRAMMING COMPUTATION, 2023, 15 (01) : 153 - 194
  • [8] Agent-Based Dantzig-Wolfe Decomposition
    Holmgren, Johan
    Persson, Jan A.
    Davidsson, Paul
    [J]. AGENT AND MULTI-AGENT SYSTEMS: TECHNOLOGIES AND APPLICATIONS, PROCEEDINGS, 2009, 5559 : 754 - 763
  • [9] Consensus-based Dantzig-Wolfe decomposition
    El Tonbari, Mohamed
    Ahmed, Shabbir
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2023, 307 (03) : 1441 - 1456
  • [10] SOLVING TRANSPORTATION NETWORK EQUILIBRIUM MODELS WITH THE DANTZIG-WOLFE DECOMPOSITION METHOD
    Chung, William
    [J]. TRANSPORTATION AND MANAGEMENT SCIENCE, 2008, : 845 - 854