Accelerated Benders decomposition for bi-objective mixed integer programming

Duleabom An; Chungmok Lee; Sophie N. Parragh

Home/Archive/arXiv

arXiv · 2610.04070

Accelerated Benders decomposition for bi-objective mixed integer programming

Duleabom An·Chungmok Lee·Sophie N. Parragh

View original source ↗Read source document ↗Export metadata ↓

Abstract

We investigate bi-objective mixed integer programming to which Benders decomposition can be applied, a widely used technique for exploiting problem structures in real-world applications. Our study focuses on a sustainable supply chain network design problem that aims to minimise both economic and environmental objectives. To address the bi-objective nature, we employ the weighted sum method, which requires solving similar problems repeatedly with different weight values. To tackle this, we propose a straightforward acceleration technique that reuses Benders cuts generated in previous iterations of the weighted sum method. This approach enables the Benders decomposition master problem to be initialised with pre-generated cuts. Our computational experiments demonstrate that reusing these cuts significantly reduces computing time.

Explore related subjects

math.OC

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Duleabom An, Chungmok Lee, Sophie N. Parragh. 2026-10-02. Accelerated Benders decomposition for bi-objective mixed integer programming. https://arxiv.org/abs/2610.04070

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Perturbed Iterate SGD for Lipschitz Continuous Loss Functions with Numerical Error and Adaptive Step Sizes

Motivated by neural network training in finite-precision arithmetic environments, this work studies the convergence of perturbed iterate SGD using adaptive step sizes in an environment with numerical error. Considering a general stochastic Lipschitz continuous loss function, an asymptotic convergence result to a Clarke stationary point is proven as well as the non-asymptotic convergence to an approximate stationary point in expectation. It is assumed that only an approximation of the loss function's stochastic gradient can be computed, in addition to error in computing the SGD step itself.

math.OC↗

arXiv2026

Sharp bounds in perturbed smooth optimization

This paper studies the problem of perturbed convex and smooth optimization. The main results describe how the solution and the value of the problem change if the objective function is perturbed. Examples include linear, quadratic, and smooth additive perturbations. Such problems naturally arise in statistics and machine learning, stochastic optimization, stability and robustness analysis, inverse problems, optimal control, etc. The results provide accurate expansions for the difference between the solution of the original problem and its perturbed counterpart with an explicit error term.

math.OC↗

arXiv2026

Controllability Allocation Scores for Targeted Network Intervention

We introduce the controllability allocation score (CAS), a framework for determining how intervention intensity should be distributed among prescribed candidate input directions with respect to designated target variables, together with the target controllability score (TCS) as its nodewise specialization. We establish existence of the CASs and develop a general uniqueness theory based on restricted injectivity of the allocation-to-Gramian map, including generic uniqueness with respect to the time horizon. We show that restricting attention to target variables can fundamentally alter the optimal intervention allocation compared with the standard full-state setting. To enable scalability, we develop a general surrogate-Gramian framework and derive objective-performance guarantees from relative Gramian errors without requiring uniqueness or closeness of the CASs. For the TCS specialization, we further construct a target-only reduced virtual system and derive explicit bounds showing how the approximation error depends on the coupling between target and non-target nodes and on the dynamical growth rate. Experiments on human brain networks show that the reduced formulation accurately approximates the TCS at short horizons, whereas the two controllability criteria exhibit markedly different approximation accuracy at long horizons.

math.OC↗