Incorporating Promotional Effects in Sales Planning of the Retail Industry Using Geometric Programming

Melika Khandan () and Pooya Hoseinpour ()
Additional contact information
Melika Khandan: Department of Industrial Engineering & Management Systems, Amirkabir University of Technology (Tehran Polytechnic), Tehran 1591634311, Iran; and Stockholm Business School, Stockholm University, SE-106 91 Stockholm, Sweden
Pooya Hoseinpour: Department of Industrial Engineering & Management Systems, Amirkabir University of Technology (Tehran Polytechnic), Tehran 1591634311, Iran

INFORMS Journal on Computing, 2025, vol. 37, issue 5, 1284-1305

Abstract: This paper addresses the challenge faced by managers in the fast-moving consumer goods industry: the joint optimization of promotion prices and the scheduling of promotion vehicles for multiple items to boost total profit. We first propose a general multiplicative demand function that encompasses all crossperiod effects, crossitem effects, promotion vehicle effects, and crossterm effects of promotion vehicles. Then, we formulate the problem of planning sales promotions, simultaneously using price reductions and promotion vehicles, considering several business rules as constraints. To efficiently solve this mixed-integer nonlinear program, we reformulate it as a convex optimization form by using the demand function’s multiplicative structure and the concept of geometric programming. Furthermore, to reduce the running time of the large-scale instances, we develop a Lagrangian decomposition algorithm, dividing the original model into a geometric program and an integer program. The algorithm significantly improves computational efficiency as evidenced by a reduction in running time from 8,125 to 78 seconds for large-scale instances. Finally, utilizing real sales data from a meal delivery company, we demonstrate that applying the convex promotion optimization model allows the company to increase its profits by roughly 21% compared with scenarios where neither price reductions nor promotion vehicles are utilized.

Keywords: promotion optimization; retail operations; convex optimization; geometric programming; Lagrangian decomposition (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/ijoc.2023.0275 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:orijoc:v:37:y:2025:i:5:p:1284-1305

Access Statistics for this article

More articles in INFORMS Journal on Computing from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().