# US 2013/0159045 A1 · Robust inventory management in multi-stage inventory networks with demand shocks

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2013/0159045 A1
- Document ID: US20130159045A1
- Status: Published application
- Kind: A1
- Application number: 13/325,672
- Filed: 2011-12-14
- Published: 2013-06-20
- Earliest claimed: 2011-12-14
- Assignees: International Business Machines Corporation
- Inventors: Markus R. Ettl; Marco Laumanns; Marek Petrik; Rajesh Kumar Ravi; Stefan Woerner
- Web page: https://patentgrep.com/patent/US20130159045A1

## CPC

- G06Q 10/087: Inventory or stock management, e.g. order filling, procurement or balancing against orders
- G06Q 10/0872: {using inventory planning}
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR

## Abstract

Robust inventory management for a supply chain network with multiple nodes may include generating a time-phased inventory deployment plan based on extreme samples and dynamic supply chain structure. The extreme samples of demand and supply chain scenarios, and dynamic supply chain structure including one or more resource constraints associated with one or more nodes in the supply chain network may be received from a user.

## Claims

### Claim 1

A method for inventory management for a supply chain network with multiple nodes, comprising:
receiving extreme samples of demand and supply chain scenarios;
receiving dynamic supply chain structure including one or more resource constraints associated with one or more nodes in the supply chain network;
generating, by a processor, a time-phased inventory deployment plan based on said extreme samples and said dynamic supply chain structure; and
outputting said time-phased inventory deployment plan.

### Claim 2 (depends on 1)

The method of claim 1, further including:
receiving one or more rules defining a coverage of percentage of satisfied demand across the multiple nodes, wherein the generating step is performed based further on said one or more rules.

### Claim 3 (depends on 1)

The method of claim 1, further including:
automatically generating a set of plausible demands based on the received extreme samples.

### Claim 4 (depends on 1)

The method of claim 1, wherein the generating step further includes solving an optimization function that computes an adjustable controller used to respond to demand in the demand and supply chain scenarios.

### Claim 5 (depends on 1)

The method of claim 1, wherein the generating step further includes computing an affine adjustable controller that provides solutions parameterized by uncertainty values.

### Claim 6 (depends on 1)

The method of claim 1, wherein the generating step further includes transforming measure of amount of coverage in demand to a convex optimization problem.

### Claim 7 (depends on 1)

The method of claim 1, wherein the generating step includes solving a linear program:
min
Y
∈
y

max
x
∈
X

μ

(
Y

(
x
)
)
=

min
y
∈
Y

max
x
∈
X

max
q
∈
Q

q
T

Y

(
x
)
-
f
*

(
q
)
=

min
Y
∈
y

max
x
∈
ext


X

max
q
∈
Q

q
T

Y

(
x
)
-
f
*

(
q
)
=
LP
wherein Y represents space of adjustable controllers to be considered, X represents a set of plausible demands, μ is a fairness measure, ext(X) represents the extreme samples of the set of plausible demands X, wherein the linear program computes best possible inventory plan y for worst possible realization of demand x.

### Claim 8

A computer readable storage medium storing a program of instructions executable by a machine to perform a method of inventory management for a supply chain network with multiple nodes, comprising:
receiving extreme samples of demand and supply chain scenarios;
receiving dynamic supply chain structure including one or more resource constraints associated with one or more nodes in the supply chain network;
generating, by a processor, a time-phased inventory deployment plan based on said extreme samples and said dynamic supply chain structure; and
outputting said time-phased inventory deployment plan.

### Claim 9 (depends on 8)

The computer readable storage medium of claim 8, further including:
receiving one or more rules defining a coverage of percentage of satisfied demand across the multiple nodes, wherein the generating step is performed based further on said one or more rules.

### Claim 10 (depends on 8)

The computer readable storage medium of claim 8, further including:
automatically generating a set of plausible demands based on the received extreme samples.

### Claim 11 (depends on 8)

The computer readable storage medium of claim 8, wherein the generating step further includes solving an optimization function that computes an adjustable controller used to respond to demand in the demand and supply chain scenarios.

### Claim 12 (depends on 8)

The computer readable storage medium of claim 8, wherein the generating step further includes computing an affine adjustable controller that provides solutions parameterized by uncertainty values.

### Claim 13 (depends on 8)

The computer readable storage medium of claim 8, wherein the generating step further includes transforming measure of amount of coverage in demand to a convex optimization problem.

### Claim 14 (depends on 8)

The computer readable storage medium of claim 8, wherein the generating step includes solving a linear program:
min
Y
∈
y

max
x
∈
X

μ

(
Y

(
x
)
)
=

min
y
∈
Y

max
x
∈
X

max
q
∈
Q

q
T

Y

(
x
)
-
f
*

(
q
)
=

min
Y
∈
y

max
x
∈
ext


X

max
q
∈
Q

q
T

Y

(
x
)
-
f
*

(
q
)
=
LP
wherein Y represents space of adjustable controllers to be considered, X represents a set of plausible demands, μ is a fairness measure, ext(X) represents the extreme samples of the set of plausible demands X, wherein the linear program computes best possible inventory plan y for worst possible realization of demand x .

### Claim 15

A system for inventory management for a supply chain network with multiple nodes, comprising:
a processor operable to receive extreme samples of demand and supply chain scenarios, and dynamic supply chain structure including one or more resource constraints associated with one or more nodes in the supply chain network, the processor further operable to generate a time-phased inventory deployment plan based on said extreme samples and said dynamic supply chain structure, and output said time-phased inventory deployment plan.

### Claim 16 (depends on 15)

The system of claim 15, wherein the processor is further operable to receive one or more rules defining a coverage of percentage of satisfied demand across the multiple nodes, wherein the processor generate the time-phased inventory deployment plan further based on said one or more rules.

### Claim 17 (depends on 15)

The system of claim 15, wherein the processor automatically generates a set of plausible demands based on the received extreme samples.

### Claim 18 (depends on 15)

The system of claim 15, wherein the processor generates the time-phased inventory deployment plan by solving an optimization function that computes an adjustable controller used to respond to demand in the demand and supply chain scenarios.

### Claim 19 (depends on 15)

The system of claim 15, wherein the processor further computes an affine adjustable controller that provides solutions parameterized by uncertainty values.

### Claim 20 (depends on 15)

The system of claim 15, wherein the processor further transforms a measure of amount of coverage in demand to a convex optimization problem to generate the time-phased inventory deployment plan.

### Claim 21 (depends on 15)

The system of claim 15, wherein the processor generates the time-phased inventory deployment plan by solving a linear program:
min
Y
∈
y

max
x
∈
X

μ

(
Y

(
x
)
)
=

min
y
∈
Y

max
x
∈
X

max
q
∈
Q

q
T

Y

(
x
)
-
f
*

(
q
)
=

min
Y
∈
y

max
x
∈
ext


X

max
q
∈
Q

q
T

Y

(
x
)
-
f
*

(
q
)
=
LP
wherein Y represents space of adjustable controllers to be considered, X represents a set of plausible demands, μ is a fairness measure, ext(X) represents the extreme samples of the set of plausible demands X , wherein the linear program computes best possible inventory plan y for worst possible realization of demand x.
