← 研踪 PaperTrailarXiv:2501.04151 · v3
Efficient LP warmstarting for linear modifications of the constraint matrix
首次提交 2025-01-08 05:37
版本更新 2026-11-13 06:12
雷达观测 2026-11-17 04:58
摘要
We consider the problem of computing the optimal solution and objective value of a linear program whose constraint matrix changes linearly with a parameter, for a predefined set of values of this parameter. Based on the information given by a precomputed basis, we present three efficient LP warm-starting algorithms, based on the eigenvalue decomposition, the Schur decomposition and the Hessenberg decomposition, to evaluate the optimal solution and optimal objective value of these problems. The three algorithms have an overall complexity of where (resp. ) is the number of constraints (resp. variables) of the original problem and the number of parameter values after an initial preprocessing step. We also provide theorems related to the optimality conditions to verify when a basis is still optimal. When the perturbation of the basis matrix has a low rank , as is often the case in practice, we then reduce all the computations to a matrix built with solves with the factorization of the basis maintained by the simplex solver; with it, we compute, in each direction, an interval on which the basis is guaranteed to remain optimal, together with a bound on the objective. In practice, these intervals are close to the exact ones, and they remain useful for degenerate bases. We also propose a matrix-free method based on shifted Krylov subspaces. Numerical experiments on 398 instances built from real models, with up to 349,120 constraints, assess the accuracy, the cost and the range of applicability of all the methods. On the interval on which a basis remains optimal, once this interval is known, the low-rank and Krylov methods compute the optimal objective value 117 to 304 times faster than a warm start of the solver, in median.
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v3 · 2026-11-13 06:12 · 最新观测版本
Efficient LP warmstarting for linear modifications of the constraint matrix
We consider the problem of computing the optimal solution and objective value of a linear program whose constraint matrix changes linearly with a parameter, for a predefined set of values of this parameter. Based on the information given by a precomputed basis, we present three efficient LP warm-starting algorithms, based on the eigenvalue decomposition, the Schur decomposition and the Hessenberg decomposition, to evaluate the optimal solution and optimal objective value of these problems. The three algorithms have an overall complexity of where (resp. ) is the number of constraints (resp. variables) of the original problem and the number of parameter values after an initial preprocessing step. We also provide theorems related to the optimality conditions to verify when a basis is still optimal. When the perturbation of the basis matrix has a low rank , as is often the case in practice, we then reduce all the computations to a matrix built with solves with the factorization of the basis maintained by the simplex solver; with it, we compute, in each direction, an interval on which the basis is guaranteed to remain optimal, together with a bound on the objective. In practice, these intervals are close to the exact ones, and they remain useful for degenerate bases. We also propose a matrix-free method based on shifted Krylov subspaces. Numerical experiments on 398 instances built from real models, with up to 349,120 constraints, assess the accuracy, the cost and the range of applicability of all the methods. On the interval on which a basis remains optimal, once this interval is known, the low-rank and Krylov methods compute the optimal objective value 117 to 304 times faster than a warm start of the solver, in median.
查看此版本解读 →查看此版本原文 ↗