MULTI-PRODUCT PRICING MARKDOWN OPTIMIZER

• US 20140200964A1
• Filed: 01/15/2013
• Published: 07/17/2014
• Est. Priority Date: 01/15/2013
• Status: Active Application

• Current Assignee: Oracle International Corporation (Oracle Corporation)
• Original Assignee: Oracle International Corporation (Oracle Corporation)
• Inventors: VAKHUTINSKY, Andrew, PANCHAMGAM, Kiran, HASSANZADEH, Anahita
• Application Number:
  US13/741,817
• Publication Number:
  US 20140200964A1
• Time in Patent Office: Days
• US Class Current: 705/7.35
• CPC Class Codes: G06Q 30/0283 Price estimation or determination

Abstract

A system that determines markdown pricing for a plurality of items over a plurality of time periods receives a non-linear time-dependent problem, where the non-linear time-dependent problem comprises a demand model. The system determines approximate inventory levels for each item in each time period and, for a plurality of pair of items in a product category, determines coefficients for a change in demand of a first product at each of the plurality of time periods when a price of a second product is changed using initial prices and initial approximate inventory levels. The system generates an approximate MILP problem comprising a change of demand based on a sum of the determined coefficients. The system then solves the MILP problem to generate revised prices and revised inventory levels. The functionality is repeated until a convergence criteria is satisfied, and then the system assigns the revised prices as the markdown product pricing.

Claims

1. A computer readable medium having instructions stored thereon that, when executed by a processor, cause the processor to determine markdown product pricing for a plurality of items over a plurality of time periods, the determining comprising:

receiving a non-linear time-dependent problem, wherein the non-linear time-dependent problem comprises a demand model;

determining approximate inventory levels for each item in each time period;

for a plurality of pair of items in a product category, determining coefficients for a change in demand of a first product at each of the plurality of time periods when a price of a second product is changed using initial prices and initial approximate inventory levels;

generating an approximate Mixed Integer Linear Programming (MILP) problem comprising a change of demand based on a sum of the determined coefficients;

solving the MILP problem to generate revised prices and revised inventory levels;

when the generated revised prices and revised inventory levels do not satisfy a convergence criteria after the solving, repeating the determining coefficients, the generating the approximate MILP problem and the solving the MILP problem using the revised prices and the revised inventory levels as the initial prices and initial approximate inventory levels until the convergence criteria is satisfied;

when the convergence criteria is satisfied, assigning the revised prices as the markdown product pricing.

2. The computer readable medium of claim 1, wherein the solving the MILP problem comprises setting a solved price of each item to a non-zero binary variable.

3. The computer readable medium of claim 1, wherein the non-linear time-dependent problem comprises assigning prices on items from a price ladder.

4. The computer readable medium of claim 1, wherein the non-linear time-dependent problem comprises one or more time-dependent constraints.

5. The computer readable medium of claim 4, wherein the time-dependent constraints comprise at least one of:

a maximum number of price changes per item and per time period, a minimum time between consecutive markdowns or a minimum or maximum markdown depth.

6. The computer readable medium of claim 4, wherein the time-dependent constraints comprise a markdown budget.

7. A computer implemented method for determining markdown product pricing for a plurality of items over a plurality of time periods, the method comprising:

receiving a non-linear time-dependent problem, wherein the non-linear time-dependent problem comprises a demand model;

determining approximate inventory levels for each item in each time period;

for a plurality of pair of items in a product category, determining coefficients for a change in demand of a first product at each of the plurality of time periods when a price of a second product is changed using initial prices and initial approximate inventory levels;

generating an approximate Mixed Integer Linear Programming (MILP) problem comprising a change of demand based on a sum of the determined coefficients;

solving the MILP problem to generate revised prices and revised inventory levels;

when the generated revised prices and revised inventory levels do not satisfy a convergence criteria after the solving, repeating the determining coefficients, the generating the approximate MILP problem and the solving the MILP problem using the revised prices and the revised inventory levels as the initial prices and initial approximate inventory levels until the convergence criteria is satisfied;

when the convergence criteria is satisfied, assigning the revised prices as the markdown product pricing.

8. The method of claim 7, wherein the solving the MILP problem comprises setting a solved price of each item to a non-zero binary variable.

9. The method of claim 7, wherein the non-linear time-dependent problem comprises assigning prices on items from a price ladder.

10. The method of claim 7, wherein the non-linear time-dependent problem comprises one or more time-dependent constraints.

11. The method of claim 10, wherein the time-dependent constraints comprise at least one of:

a maximum number of price changes per item and per time period, a minimum time between consecutive markdowns or a minimum or maximum markdown depth.

12. The method of claim 10, wherein the time-dependent constraints comprise a markdown budget.

13. A markdown product pricing system that determines markdown pricing for a plurality of items over a plurality of time periods, the system comprising:

a demand coefficient module that receives a non-linear time-dependent problem, wherein the non-linear time-dependent problem comprises a demand model, determines approximate inventory levels for each item in each time period and for a plurality of pair of items in a product category, determines coefficients for a change in demand of a first product at each of the plurality of time periods when a price of a second product is changed using initial prices and initial approximate inventory levels;

a Mixed Integer Linear Programming (MILP) module that generates an approximate MILP problem comprising a change of demand based on a sum of the determined coefficients and solves the MILP problem to generate revised prices and revised inventory levels;

a convergence module that when the generated revised prices and revised inventory levels do not satisfy a convergence criteria after the solving, causes the demand coefficient module and the MILP module to repeat the determining coefficients, the generate the approximate MILP problem and the solve the MILP problem using the revised prices and the revised inventory levels as the initial prices and initial approximate inventory levels until the convergence criteria is satisfied;

wherein the convergence module, when the convergence criteria is satisfied, assigns the revised prices as the markdown product pricing.

14. The system of claim 13, wherein the solving the MILP problem comprises setting a solved price of each item to a non-zero binary variable.

15. The system of claim 13, wherein the non-linear time-dependent problem comprises assigning prices on items from a price ladder.

16. The system of claim 13, wherein the non-linear time-dependent problem comprises one or more time-dependent constraints.

17. The system of claim 16, wherein the time-dependent constraints comprise at least one of:

a maximum number of price changes per item and per time period, a minimum time between consecutive markdowns or a minimum or maximum markdown depth.

18. The system of claim 16, wherein the time-dependent constraints comprise a markdown budget.