Decomposition Methods for Global Solutions of Mixed-Integer Linear Programs

This paper introduces two decomposition-based methods for two-block mixed-integer linear programs (MILPs), which break the original problem into a sequence of smaller MILP subproblems. The first method is based on the l1-augmented Lagrangian. The second method is based on the alternating direction method of multipliers. When the original problem has a block-angular structure, the subproblems of the first block have low dimensions and can be solved in parallel. We add reversenorm cuts and augmented Lagrangian cuts to the subproblems of the second block. For both methods, we show asymptotic convergence to globally optimal solutions and present iteration upper bounds. Numerical comparisons with recent decomposition methods demonstrate the exactness and efficiency of our proposed methods.

[1]  Manfred Morari,et al.  A decomposition method for large scale MILPs, with performance guarantees and a power system application , 2014, Autom..

[2]  Stochastic Dual Dynamic Programming for Multistage Stochastic Mixed-Integer Nonlinear Optimization. , 2019, 1912.13278.

[3]  M. Hestenes.  Multiplier and gradient methods , 1969 .

[4]  Andrew C. Eberhard,et al.  A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems , 2017, Mathematical Programming.

[5]  Wotao Yin,et al.  A Globally Convergent Algorithm for Nonconvex Optimization Based on Block Coordinate Update , 2014, J. Sci. Comput..

[6]  Xiaoning Zhu,et al.  ADMM-based problem decomposition scheme for vehicle routing problem with time windows , 2019, Transportation Research Part B: Methodological.

[7]  Jefferson G. Melo,et al.  Iteration-Complexity of a Linearized Proximal Multiblock ADMM Class for Linearly Constrained Nonconvex Optimization Problems , 2017 .

[8]  C. Sagastizábal,et al.  Revisiting augmented Lagrangian duals , 2021, Mathematical Programming.

[9]  X. Andy Sun,et al.  A two-level distributed algorithm for nonconvex constrained optimization , 2019, Computational Optimization and Applications.

[10]  R. Tyrrell Rockafellar,et al.  Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming , 1976, Math. Oper. Res..

[11]  Yoshihiro Kanno,et al.  Alternating direction method of multipliers as a simple effective heuristic for mixed-integer nonlinear optimization , 2018 .

[12]  Giuseppe Notarstefano,et al.  A Primal Decomposition Method with Suboptimality Bounds for Distributed Mixed-Integer Linear Programming , 2018, 2018 IEEE Conference on Decision and Control (CDC).

[13]  Ying Xiong.  Nonlinear Optimization , 2014 .

[14]  R. Rockafellar.  The multiplier method of Hestenes and Powell applied to convex programming , 1973 .

[15]  Alfredo N. Iusem,et al.  An Inexact Modified Subgradient Algorithm for Primal-Dual Problems via Augmented Lagrangians , 2013, J. Optim. Theory Appl..

[16]  Bernardo Freitas Paulo da Costa,et al.  Stochastic Lipschitz dynamic programming , 2019, Math. Program..

[17]  Shabbir Ahmed,et al.  Exact augmented Lagrangian duality for mixed integer linear programming , 2017, Math. Program..

[18]  Yoshihiro Kanno,et al.  Alternating direction method of multipliers for truss topology optimization with limited number of nodes: a cardinality-constrained second-order cone programming approach , 2017, Optimization and Engineering.

[19]  Rafail N. Gasimov,et al.  Augmented Lagrangian Duality and Nondifferentiable Optimization Methods in Nonconvex Programming , 2002, J. Glob. Optim..

[20]  Dimitri P. Bertsekas,et al.  Constrained Optimization and Lagrange Multiplier Methods , 1982 .

[21]  Wotao Yin,et al.  Global Convergence of ADMM in Nonconvex Nonsmooth Optimization , 2015, Journal of Scientific Computing.

[22]  Shiqian Ma,et al.  Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis , 2016, Computational Optimization and Applications.

[23]  Maria Prandini,et al.  A decentralized approach to multi-agent MILPs: Finite-time feasibility and performance guarantees , 2017, Autom..

[24]  C. Yalçin Kaya,et al.  On a Modified Subgradient Algorithm for Dual Problems via Sharp Augmented Lagrangian* , 2006, J. Glob. Optim..

[25]  Shabbir Ahmed,et al.  Stochastic dual dynamic integer programming , 2019, Math. Program..

[26]  M. Powell.  A method for nonlinear constraints in minimization problems , 1969 .

[27]  Maria Prandini,et al.  A Distributed Iterative Algorithm for Multi-Agent MILPs: Finite-Time Feasibility and Performance Characterization , 2018, IEEE Control Systems Letters.

[28]  Baoyuan Wu,et al.  $\ell _p$ℓp-Box ADMM: A Versatile Framework for Integer Programming , 2019, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[29]  Stephen P. Boyd,et al.  A simple effective heuristic for embedded mixed-integer quadratic programming , 2015, 2016 American Control Conference (ACC).

[30]  Alborz Alavian,et al.  Improving ADMM-based optimization of Mixed Integer objectives , 2017, 2017 51st Annual Conference on Information Sciences and Systems (CISS).

[31]  Charles E. Blair,et al.  The value function of a mixed integer program: I , 1977, Discret. Math..

[32]  Xiaoqi Yang,et al.  A Unified Augmented Lagrangian Approach to Duality and Exact Penalization , 2003, Math. Oper. Res..

[33]  Upal Mahbub,et al.  New methods for handling binary constraints , 2016, 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[34]  Alfredo N. Iusem,et al.  A primal dual modified subgradient algorithm with sharp Lagrangian , 2010, J. Glob. Optim..

[35]  Alessandro Rucco,et al.  A finite-time cutting plane algorithm for distributed mixed integer linear programming , 2017, 2017 IEEE 56th Annual Conference on Decision and Control (CDC).

[36]  D. Mayne,et al.  Outer approximation algorithm for nondifferentiable optimization problems , 1984 .