Search arXiv⌕ Search

arXiv · 2610.12665

On the 100% Rule of Linear Programming

Abstract

The so-called ``100% rule'' is a somewhat classical and yet somehow obscure rule that gives some local sensitivity-analysis information based on the very limited local sensitivity-analysis information that is often made available by linear-programming software, derived from an optimal basis that is hidden from the user. Introduced in a classic undergraduate textbook in 1977, half a century ago, it was only picked up on by researchers in a very limited way, and while it appears in some undergraduate textbooks, it tends not to appear in most modern graduate-level textbooks. Our contributions are to celebrate and revive interest in the 100% rule and to extend it in a meaningful way. We introduce a cone rule that certifies primal feasibility for more right-hand sides than the 100% rule does, using the same information, and that can be applied in linear time. We then study when this cone rule is tight, that is, when it captures the entire cone of right-hand sides for which the basis remains feasible. We characterize tightness in every dimension for right-hand sides interior to that cone, make the characterization explicit for m=2 and m=3, and settle the question for tridiagonal bases in every dimension: tightness is impossible once m>=4, and for m=3 we give an explicit criterion in the entries of the basis. We give further results for symmetric, integer and unimodular bases. Finally, when tightness fails, we measure the fraction of the feasibility cone captured by the rule using normalized solid angles. For the autoregressive family at m=3, we obtain a closed-form candidate for the infimum of this fraction over all right-hand sides, whose optimality is supported numerically. We also obtain a closed-form expression for the best case over most of the correlation range, subject to two numerically verified properties, and estimate the best-case value numerically more generally.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Marcia Fampa, Jon Lee. 2026-10-08. On the 100% Rule of Linear Programming. https://arxiv.org/abs/2610.12665

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

KEEP EXPLORING

Related papers

Integer matrices that are not copositive have certificates of less than quadratic complexity

A real symmetric matrix is called copositive if the corresponding quadratic form is non-negative on the closed first orthant. If the matrix fails to be copositive there exists some non-negative certificate for which the quadratic form is negative. Due to the scaling property, we can find such certificates in every neighborhood of the origin but their properties depend on the matrix of course and are hard to describe. If it is an integer matrix however, we are guaranteed certificates of a complexity that is at most a constant times the binary encoding length of the matrix raised to the power 3/2.

math.OC↗

Kernel Metrics and Learning for Borel MDPs: Identifiability and Adaptive Control

We consider a Markov decision process with standard Borel spaces and an unknown transition kernel under the average cost criterion. We do not impose any parametrization on the set of possible kernels. To facilitate our analysis, we first develop implication relations between several topologies on kernels defined by pointwise, continuous, or uniform weak convergence; we then review robustness properties on the space of kernels, and finally we establish compactness conditions on the space of kernels. Building on this regularity analysis, we then present two data-driven identifiability results; the first one being Bayesian and the second one empirical. Our conditions for the Bayesian setting are significantly more relaxed compared with prior work which considered either finite or parametric models, though we do not obtain a rate of convergence. Our analysis is asymptotic and builds on measurability in terms of the tail $σ$-field of the available information. Identifiability results are then used to design near-optimal adaptive control policies which alternate between periods of exploration, where the controller acts according to a policy which is conducive to the identification of the true kernel, and periods of exploitation where the controller's information on the kernel is utilized. We will establish that such policies are near optimal. In summary, our contribution is with regard to the general standard Borel setup where there is no apriori parametric representation.

math.OC↗

Differentiable Nonlinear Model Predictive Control

The efficient computation of parametric solution sensitivities is a key challenge in the integration of learning-enhanced methods with nonlinear model predictive control, as their availability is crucial for many learning algorithms. This paper discusses the computation of solution sensitivities of general nonlinear programs using the implicit function theorem and smoothed optimality conditions treated in interior-point methods (IPM). We introduce sequential barrier quadratic programming (SBQP), which generalizes SQP with an IPM quadratic programming (QP) solver by allowing the barrier parameter to approach a prescribed nonnegative target value, recovering classical SQP when this target is zero. Previous works are limited to convex or unconstrained formulations, or lack an implementation for efficient sensitivity evaluation. The publication is accompanied by an efficient open-source implementation within the `acados` framework, providing both forward and adjoint sensitivities for general optimal control problems, achieving speedups exceeding 3x over the state-of-the-art solvers `mpc.pytorch` and `cvxpygen`.

math.OC↗