Retail reverse supply chain optimization under profit–loss budgetary limitation
Mehmet Erdem Coşkun , Elkafi Hassini , Engin Kepenek
An International Journal of Optimization and Control: Theories & Applications ›› 2026, Vol. 16 ›› Issue (2) : 732 -751.
Retailers increasingly need decision-support tools to manage unsold inventory under operational and fiscal constraints. In this paper, we develop a reverse supply chain (RSC) model for retailers under profit–loss budgetary limitation. The retail RSC consists of multiple stores, a warehouse, and multiple vendors. Each store carries inventory that is not selling as hoped, and they want to get rid of these unwanted products to replace the space with more productive items. Our model considers two options for how a store can get rid of these products: the retailer can send the products to its warehouse if there is demand at other stores, or send them back to their vendor if there are available vendor funds. However, the retailer operates under a predetermined profit–loss budget that should be utilized as closely as possible within the fiscal cycle. The budgetary limitation is the result of profit–loss that will be incurred due to relocating products within and out of its supply chain system. This budgetary limitation, also known as the “P&L effect” in industry, is decided a year prior to an RSC activity for financial, planning, and/or taxation reasons. We model this problem as a mixed integer linear program and solve test problems using CPLEX. We then develop a heuristic solution algorithm and compare the CPLEX solution results and times with our heuristic. We summarize useful insights into our heuristic and how it can be further developed for similar optimization problems with budgetary constraints. Eventually, we outline future research topics and suggestions for RSC models for retailers.
Profit–loss / Product returns / Retail returns / Returns management / Reverse supply chain
| [1] |
|
| [2] |
|
| [3] |
|
| [4] |
|
| [5] |
|
| [6] |
|
| [7] |
|
| [8] |
|
| [9] |
|
| [10] |
|
| [11] |
|
| [12] |
|
| [13] |
|
| [14] |
|
| [15] |
|
| [16] |
|
| [17] |
|
| [18] |
|
| [19] |
|
| [20] |
|
| [21] |
|
| [22] |
|
| [23] |
|
| [24] |
|
| [25] |
|
| [26] |
|
| [27] |
|
| [28] |
|
| [29] |
|
| [30] |
|
| [31] |
|
| [32] |
|
| [33] |
|
| [34] |
|
| [35] |
|
| [36] |
|
| [37] |
|
/
| 〈 |
|
〉 |