Distributed optimization method for real-time omnichannel retail operations
US9626646B1 · kind B1 · utility
6Cited by
3References
13Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Nov 25, 2015 |
| Grant date | Apr 18, 2017 |
| Priority date | — |
| Expiry date | Nov 25, 2035 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06Q30/0206
- WIPO fieldIT methods for management
- WIPO sectorElectrical engineering
Abstract
Embodiments are directed to a computer implemented method of generating inventory valuation data for an omnichannel (OC) retail operation. The method starts with an unsolvable OC nonlinear nonconvex problem, applies transformations to generate a mixed-integer program (MIP) that is a tractable linear nonconvex form, solves the MIP, fixes prices at optimal values to achieve dimensionality reduction and eliminate all non-convexity by eliminating the pricing dimension. The method further obtains inventory flow linear programming (LP) that is linear convex, and solves the LP to recover a dual solution as initial inventory valuations.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.