A decomposition method for large scale MILPs, with performance guarantees and a power system application

DOI10.1016/J.AUTOMATICA.2016.01.006zbMath1335.93018arXiv1411.1973OpenAlexW1734351387MaRDI QIDQ259426

Peyman Mohajerin Esfahani, Paul J. Goulart, Robin Vujanic, Sébastien Mariéthoz, Manfred Morari

Publication date: 11 March 2016

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1411.1973

zbMATH Keywords

optimizationinteger programminglarge-scale systemsdualitydecomposition methodselectric vehiclespower-system control

Mathematics Subject Classification ID

Mixed integer programming (90C11) Optimality conditions and duality in mathematical programming (90C46) Application models in control theory (93C95) Large-scale systems (93A15)

Related Items (12)

Bounding duality gap for separable problems with linear constraints ⋮ Distributed constraint-coupled optimization via primal decomposition over random time-varying graphs ⋮ Dual decomposition for multi-agent distributed optimization with coupling constraints ⋮ Tracking-ADMM for distributed constraint-coupled optimization ⋮ Augmented Lagrangian tracking for distributed optimization with equality and inequality coupling constraints ⋮ A distributed optimization approach via symmetric group actions under time-varying communication networks ⋮ Distributed online convex optimization with multiple coupled constraints: a double accelerated push-pull algorithm ⋮ Vanishing Price of Decentralization in Large Coordinative Nonconvex Optimization ⋮ A decentralized approach to multi-agent MILPs: finite-time feasibility and performance guarantees ⋮ Hierarchical distributed optimization of constraint-coupled convex and mixed-integer programs using approximations of the dual function ⋮ A feasibility-ensured Lagrangian heuristic for general decomposable problems ⋮ An adaptive online learning algorithm for distributed convex optimization with coupled constraints over unbalanced directed graphs

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two ``well-known properties of subgradient optimization
• Uniqueness of solution in linear programming
• Dual decomposition in stochastic integer programming
• The use of the optimal partition in a linear programming solution for postoptimal analysis
• Portfolio-optimization models for small investors
• Thevenin decomposition and large-scale optimization
• Stochastic programming approaches to stochastic scheduling
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation
• Effective Heuristics for Multiproduct Partial Shipment Models
• A survey of effective heuristics and their application to a variety of knapsack problems
• Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods
• Optimal short-term scheduling of large-scale power systems
• Estimates of the Duality Gap in Nonconvex Optimization
• OR Forum—Modeling the Impacts of Electricity Tariffs on Plug-In Hybrid Electric Vehicle Charging, Costs, and Emissions
• A Primer in Column Generation
• Implementing Mixed Integer Column Generation
• The Traveling-Salesman Problem and Minimum Spanning Trees

This page was built for publication: A decomposition method for large scale MILPs, with performance guarantees and a power system application