.png){kind=icon}
.png){kind=icon}
Return
Distributed optimization for mixed integer linear programming on unbalanced directed graphs with row stochasticity
.png){kind=icon}
PRE
AI
DOI：10.1080/18824889.2025.2578881.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper investigates a distributed optimization approach for solving mixed integer linear programming (MILP) problems with a coupling constraint over unbalanced directed networks. The proposed method combines linear programming (LP) relaxation with a dual decomposition technique that uses row stochasticity of the network's weight matrix. A subgradient scaling mechanism is introduced to compensate for the estimation bias arising from asymmetric communication links. We prove that the proposed algorithm guarantees the feasibility of the solution in a finite number of iterations and provide a finite-time suboptimality bound. Numerical experiments also show that the local estimates converge to a feasible and near-optimal solution.
Keywords:
Distributed optimization
mixed integer linear programming
multiagent system
LP relaxation
directed network
Journal
S
IF:
0.5
Papers:
46
Citations:
0