.png){kind=icon}
.png){kind=icon}
Return
Product line optimization with multiples sites
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2022.105978.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider the problem faced by a retail chain that must select what mutual-substitute items to display each one of its stores to maximize revenues. The number of items cannot exceed the limit space capacity of each store. Customers purchase the one product that maximizes their utility, which depends on the product price, travel cost to the store, and reservation price, known to the retailer. The retailer can set different price markdowns at different stores and products. The retailer considers the decisions of customers, and solves mixed-integer bilevel optimization problem, which can be formulated as a single-level optimization problem by using optimality conditions for the lower level. We propose Branch and Cut and Cut and Branch methods and include a family of valid inequalities to solve the problem. We compare the results with those of a Benders decomposition method. Our computational results show that the proposed Cut and Branch method obtains the best performance and improves the current state of the art.
Keywords:
Location
Product allocation to multiple stores
Bilevel programming
Cut and Branch
Branch and Cut
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
View more organizations