Domain-aware decomposition for supply chain master planning using linear programming
US11429929B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Feb 18, 2020 |
| Grant date | Aug 30, 2022 |
| Priority date | — |
| Expiry date | Jul 28, 2040 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06Q10/04
- WIPO fieldComputer technology
- 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 include receiving an LP problem representing a supply chain planning problem for a supply chain network comprising material buffers and resource buffers, partitioning the supply chain network at a complicating node into at least two supply chains sharing the complicating node, formulating a decomposed subproblem for each of the supply chains, calculating an effective dual based, at least in part, on a mathematical difference of at least two dual values calculated by solving the functional-based decomposed subproblems, and generating a globally-optimal LP solution to the LP problem using subgradient descent with the effective dual.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.