Domain-Aware Decomposition for Supply Chain Master Planning using Linear Programming

    公开(公告)号:US20240119413A1

    公开(公告)日:2024-04-11

    申请号:US18543678

    申请日:2023-12-18

    CPC classification number: G06Q10/087 G06F17/12 G06F17/13 G06Q10/04

    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.

Patent Agency Ranking