.png){kind=icon}
返回
Consensus-based Dantzig-Wolfe decomposition
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2022.10.019.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Dantzig-Wolfe decomposition (DWD) is a classical algorithm for solving large-scale linear programs whose constraint matrix involves a set of independent blocks coupled with a set of linking rows. The algorithm decomposes such a model into a master problem and a set of independent subproblems that can be solved in a distributed manner. In a typical implementation, the master problem is solved cen-trally. In certain settings, solving the master problem centrally is undesirable or infeasible, such as in the case of decentralized storage of data, or when independent agents who are responsible for the subprob-lems desire privacy of information. In this paper, we propose a fully distributed DWD algorithm which relies on solving the master problem using a consensus-based Alternating Direction Method of Multipliers (ADMM) method. We derive error bounds on the optimality gap and feasibility violation of the proposed approach. We provide preliminary computational results for our algorithm using a Message Passing Inter-face implementation on a delivery planning problem, the multi-commodity network flow problem, and synthetic instances where we obtain high quality solutions. An open-source implementation of the algo-rithm is available.(c) 2022 Elsevier B.V. All rights reserved.
Keyword:
Distributed decision making
Dantzig Wolfe decomposition
Column generation
Privacy
Decentralized data storage
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
Beyond the VAD: Human Factors Engineering for Mechanically Assisted Circulation in the 21st Century
PREAI
分享收藏
查看更多内容