11429929

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

PublishedAugust 30, 2022
Assigneenot available in USPTO data we have
Technical Abstract

Patent Claims
9 claims

Legal claims defining the scope of protection, as filed with the USPTO.

4

4. The system of claim 3, wherein traverse the material buffers and resource buffers to locate the complicating node comprises moving from upstream nodes to downstream nodes in response to determining the supply chain network is divergent.

5

5. The system of claim 3, wherein traverse the material buffers and resource buffers to locate the complicating node comprises moving from downstream nodes to upstream nodes in response to determining the supply chain network is convergent.

6

6. The system of claim 3, wherein traverse the material buffers and resource buffers to locate the complicating node comprises moving from most connected nodes to least connected nodes.

11

11. The method of claim 10, wherein traversing the material buffers and resource buffers to locate the complicating node comprises moving from upstream nodes to downstream nodes in response to determining the supply chain network is divergent.

12

12. The method of claim 10, wherein traversing the material buffers and resource buffers to locate the complicating node comprises moving from downstream nodes to upstream nodes in response to determining the supply chain network is convergent.

13

13. The method of claim 10, wherein traversing the material buffers and resource buffers to locate the complicating node comprises moving from most connected nodes to least connected nodes.

18

18. The non-transitory computer-readable medium of claim 17, wherein traverses the material buffers and resource buffers to locate the complicating node comprises moving from upstream nodes to downstream nodes in response to determining the supply chain network is divergent.

19

19. The non-transitory computer-readable medium of claim 17, wherein traverses the material buffers and resource buffers to locate the complicating node comprises moving from downstream nodes to upstream nodes in response to determining the supply chain network is convergent.

20

20. The non-transitory computer-readable medium of claim 17, wherein traverses the material buffers and resource buffers to locate the complicating node comprises moving from most connected nodes to least connected nodes.

Patent Metadata

Filing Date

Unknown

Publication Date

August 30, 2022

Inventors

Devanand R.
Narayan Nandeda
Tushar Shekhar

Want to explore more patents?

Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.

Citation & reuse

Analysis on this page is generated by Patentable — an AI-powered patent intelligence platform. AI-generated summaries, explanations, and analysis may be reused with attribution and a visible link back to the canonical URL below. Patent abstracts and claims are USPTO public domain.

Cite as: Patentable. “Domain-Aware Decomposition for Supply Chain Master Planning using Linear Programming” (11429929). https://patentable.app/patents/11429929

© 2026 Patentable. All rights reserved.

Patentable is a research and drafting-assistant tool, not a law firm, and does not provide legal advice. Documents we generate are drafts for review by a licensed patent attorney.