Time-based decomposition for supply chain optimization problem
US11328229B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Dec 20, 2019 |
| Grant date | May 10, 2022 |
| Priority date | — |
| Expiry date | Dec 20, 2039 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06Q10/06315
- WIPO fieldIT methods for management
- WIPO sectorElectrical engineering
Abstract
A system and method are disclosed for solving a supply chain planning problem modeled as a linear programming (LP) problem. Embodiments further include receiving a multi-period matrix formulation of a least a portion of an LP supply chain master planning problem representing a supply chain planning problem for a supply chain network and having a planning horizon divided into time buckets separated by time-bucket boundaries, mapping constraints of the LP supply chain master planning problem and variables of the LP supply chain master planning problem to the time buckets, calculating a quantity of cross-over variables for the constraints and the time buckets, selecting one or more decomposition boundaries from the time-bucket boundaries, and formulating at least two time-based decomposed subproblems by decomposing the LP supply chain master planning problem at the one or more decomposition boundaries.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.