Document Type
Article
Publication Date
2026
Publication Title
Operations Research Letters
Keywords
supply chain disruptions, cardinality computation, dynamic programming (DP), risk quantification, combinatorial optimization
Abstract
We study the problem of counting disruption scenarios in a supply chain network (SCN), modeled as combinatorial link failures, that violate a performance threshold. Using duality, the violation set is represented as a union of threshold-defined subsets, each characterized by a linear inequality, enabling exact dynamic programming for counting. Under rational coefficients, we derive a pseudo-polynomial dynamic program conditional on the generated inequalities and, for nonnegative coefficients, an exact capped variant. Computational experiments on four-echelon SCNs demonstrate the approach’s effectiveness.
Funding Source
This article was published open access thanks to a transformative agreement between Milner Library and Elsevier.
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.
DOI
10.1016/j.orl.2026.107570
Recommended Citation
Chandra, A. (2026). Exact counting via duality: Applications to supply chain networks. Operations Research Letters 71, 107570. https://doi.org/10.1016/j.orl.2026.107570
Comments
First published in Operations Research Letters (2026): https://doi.org/10.1016/j.orl.2026.107570