IP Library Granted Patent US 11,334,827
Granted Patent B1
US 11,334,827 · App. 16/886,684 · Granted May 17, 2022

Image-based decomposition for fast iterative solve of complex linear problems

Inventors: Devanand R (Bangalore, IN); Narayan Nandeda (Ujjain, IN); Tushar Shekhar (Bengaluru, IN)
Assignee: Blue Yonder Group, Inc.
G06Q10/06315G06K9/6204G06Q10/04G06Q10/06313
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,334,827
App. No.
16/886,684
Granted
May 17, 2022
Kind
B1
Abstract

A system and method are disclosed for solving a supply chain planning problem modeled as a linear programming (LP) problem. Embodiments include receiving a matrix formulation of at least a portion of the LP problem representing a supply chain planning problem for a supply chain network, generating an image based on the matrix formulation to identify connected components, partitioning the matrix formulation based, at least in part, on the connected components constraint into at least two partitions, formulating an LP subproblem from each of the at least two partitions, and solving the LP subproblems to generate a global solution to the supply chain planning problem.

Claims (76)

1. A system of solving a supply chain planning problem modeled as a linear programming (LP) problem, comprising:

a computer, comprising a processor, memory:

an image rendering engine configured to:

receive a matrix formulation of at least a portion of an LP problem representing a supply chain planning problem for a supply chain network; and

generate pixels of a supply chain problem image, the pixels representing links between constraints and variables of the LP problem;

an image processing engine configured to:

identify one or more contours of the supply chain problem image using a machine-learning model trained using a convolutional neural network (CNN) and contour-labeled images received from the image rendering engine, wherein the one or more contours comprise at least a first contour and a second contour;

the image rendering engine further configured to:

identify one or more first constraints represented by the first contour of the one or more contours;

remove at least one of the one or more first constraints represented by the first contour to determine at least two components linked by the first contour;

identify one or more second constraints represented by the second contour of the one or more contours;

remove at least one of the one or more second constraints represented by the second contour to determine at least two components linked by the second contour;

determine a partition comprising the at least two components linked by the first contour is more balanced than a partition comprising the at least two components linked by the second contour;

select the at least one of the one or more first constraints as the one or more complicating constraints; and

formulate at least two decomposed subproblems sharing one or more complicating constraints associated with at least one of the one or more contours; and

a solver configured to:

solve the decomposed subproblems to generate a solution to the supply chain planning problem.

2. The system of claim 1 , wherein the image rendering engine is further configured to:

identify one or more constraints represented by a first contour of the one or more contours;

remove at least one of the one or more identified constraints represented by the first contour to determine at least two components linked by the first contour; and

select the at least one of the one or more identified constraints as at least one of the one or more complicating constraints.

3. The system of claim 1 , wherein the image processing engine is further configured to:

downscale the supply chain problem image by applying a compression ratio and coordinates scaling to the matrix formulation.

4. The system of claim 1 , wherein the image rendering engine is further configured to:

calculate coordinates of one or more pixels of the one or more contours, wherein the coordinates indicate row-column indices for a constraints-variables sparse matrix; and

identify at least one variable and at least one constraint represented by the one or more pixels of the one or more contours.

5. The system of claim 1 , wherein:

the supply chain network is partitioned into at least two supply chains at an image boundary comprising at least one of the one or more complicating constraints.

6. The system of claim 1 , wherein a balance of a partition is based, at least in part, on a ratio of a number of constraints of the at least two components.

7. A computer-implemented method of solving a supply chain planning problem modeled as linear programing (LP) problem, comprising:

receiving, by an image rendering engine, a matrix formulation of at least a portion of an LP problem representing a supply chain planning problem for a supply chain network;

generating pixels, by the image rendering engine, of a supply chain problem image, the pixels representing links between constraints and variables of the LP problem;

identifying, by an image processing engine, one or more contours of the supply chain problem image using a machine-learning model trained using a convolutional neural network (CNN) and contour-labeled images received from the image rendering engine, wherein the one or more contours comprise at least a first contour and a second contour;

identifying, by the image rendering engine, one or more first constraints represented by the first contour of the one or more contours;

removing, by the image rendering engine, at least one of the one or more first constraints represented by the first contour to determine at least two components linked by the first contour;

identifying, by the image rendering engine, one or more second constraints represented by the second contour of the one or more contours;

removing, by the image rendering engine, at least one of the one or more second constraints represented by the second contour to determine at least two components linked by the second contour;

determining, by the image rendering engine, a partition comprising the at least two components linked by the first contour is more balanced than a partition comprising the at least two components linked by the second contour;

selecting, by the image rendering engine, the at least one of the one or more first constraints as the one or more complicating constraints;

formulating, by the image rendering engine, at least two decomposed subproblems sharing one or more complicating constraints associated with at least one of the one or more contours; and

solving, by a solver, the decomposed subproblems to generate a solution to the supply chain planning problem.

8. The computer-implemented method of claim 7 , further comprising:

identifying, by the image rendering engine, one or more constraints represented by a first contour of the one or more contours;

removing, by the image rendering engine, at least one of the one or more identified constraints represented by the first contour to determine at least two components linked by the first contour; and

selecting, by the image rendering engine, the at least one of the one or more identified constraints as at least one of the one or more complicating constraints.

9. The computer-implemented method of claim 7 , further comprising:

downscaling, by the image processing engine, the supply chain problem image by applying a compression ratio and coordinates scaling to the matrix formulation.

10. The computer-implemented method of claim 7 , further comprising:

calculating, by the image rendering engine, coordinates of one or more pixels of the one or more contours, wherein the coordinates indicate row-column indices for a constraints-variables sparse matrix; and

identifying, by the image rendering engine, at least one variable and at least one constraint represented by the one or more pixels of the one or more contours.

11. The computer-implemented method of claim 7 , wherein:

the supply chain network is partitioned into at least two supply chains at an image boundary comprising at least one of the one or more complicating constraints.

12. The computer-implemented method of claim 7 , wherein a balance of a partition is based, at least in part, on a ratio of a number of constraints of the at least two components.

13. A non-transitory computer-readable medium embodied with software providing solving of supply chain planning problems modeled as linear programing (LP) problems, the software when executed:

receives, by an image rendering engine, a matrix formulation of at least a portion of an LP problem representing a supply chain planning problem for a supply chain network;

generates, by the image rendering engine, pixels of a supply chain problem image, the pixels representing links between constraints and variables of the LP problem;

identifies, by an image processing engine, one or more contours of the supply chain problem image using a machine-learning model trained using a convolutional neural network (CNN) and contour-labeled images received from the image rendering engine, wherein the one or more contours comprise at least a first contour and a second contour;

identifies, by the image rendering engine, one or more first constraints represented by the first contour of the one or more contours;

removes, by the image rendering engine, at least one of the one or more first constraints represented by the first contour to determine at least two components linked by the first contour;

identifies, by the image rendering engine, one or more second constraints represented by the second contour of the one or more contours;

removes, by the image rendering engine, at least one of the one or more second constraints represented by the second contour to determine at least two components linked by the second contour;

determines, by the image rendering engine, a partition comprising the at least two components linked by the first contour is more balanced than a partition comprising the at least two components linked by the second contour;

selects, by the image rendering engine, the at least one of the one or more first constraints as the one or more complicating constraints;

formulates, by the image rendering engine, at least two decomposed subproblems sharing one or more complicating constraints associated with at least one of the one or more contours; and

solves, by a solver, the decomposed subproblems to generate a solution to the supply chain planning problem.

14. The non-transitory computer-readable medium of claim 13 , the software when executed further:

identifies one or more constraints represented by a first contour of the one or more contours;

removes at least one of the one or more identified constraints represented by the first contour to determine at least two components linked by the first contour; and

selects the at least one of the one or more identified constraints as at least one of the one or more complicating constraints.

15. The non-transitory computer-readable medium of claim 13 , the software when executed further:

downscales the supply chain problem image by applying a compression ratio and coordinates scaling to the matrix formulation.

16. The non-transitory computer-readable medium of claim 13 , the software when executed further:

calculates coordinates of one or more pixels of the one or more contours, wherein the coordinates indicate row-column indices for a constraints-variables sparse matrix; and

identifies at least one variable and at least one constraint represented by the one or more pixels of the one or more contours.

17. The non-transitory computer-readable medium of claim 13 , wherein

the supply chain network is portioned into at least two supply chains at an image boundary comprising at least one of the one or more complicating constraints.

Assignments (4)
RELEASE OF SECURITY INTEREST IN PATENTS PREVIOUSLY RECORDED AT REEL/FRAME (053383/0117) Recorded Nov 3, 2021
From: U.S. BANK NATIONAL ASSOCIATION, AS COLLATERAL AGENT
To: BLUE YONDER GROUP, INC.
Reel/Frame 058794/0776 →
RELEASE OF SECURITY INTEREST Recorded Sep 16, 2021
From: JPMORGAN CHASE BANK, N.A.
To: BLUE YONDER GROUP, INC.; BLUE YONDER, INC.; JDA SOFTWARE SERVICES, INC.; I2 TECHNOLOGIES INTERNATIONAL SERVICES, LLC; MANUGISTICS SERVICES, INC.; MANUGISTICS HOLDINGS DELAWARE II, INC.; REDPRAIRIE COLLABORATIVE FLOWCASTING GROUP, LLC; JDA SOFTWARE RUSSIA HOLDINGS, INC.; REDPRAIRIE SERVICES CORPORATION; BY BOND FINANCE, INC.; BY NETHERLANDS HOLDING, INC.; BY BENELUX HOLDING, INC.
Reel/Frame 057724/0593 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 23, 2021
From: R, DEVANAND; NANDEDA, NARAYAN; SHEKHAR, TUSHAR
To: BLUE YONDER GROUP, INC.
Reel/Frame 056640/0523 →
SECURITY AGREEMENT Recorded Aug 3, 2020
From: BLUE YONDER GROUP, INC.
To: U.S. BANK NATIONAL ASSOCIATION
Reel/Frame 053383/0117 →
Continuity (2)
Provisional Application 62895866 · Sep 4, 2019
Provisional Application 62856360 · Jun 3, 2019
Cited By (1)
US 12,632,822