Calendrier

ANNULÉ - Séminaire Fondation HEC/GERAD : When data analytics meets promotion planning

ANNULÉ - Séminaire Fondation HEC/GERAD : When data analytics meets promotion planning

Ce séminaire est annulé et remis à une date ultérieure.

<hr>

 

Séminaire Fondation HEC conjoint avec la Chaire de théorie des jeux et gestion et le GERAD

Titre :   When data analytics meets promotion planning 

Conférencier :  Georgia Perakis – Sloan School of Management, MIT, États-Unis 

Résumé :

In many important settings, promotions are a key instrument for driving sales and profits. Important examples include promotions in grocery retail among others. The Promotion Optimization Problem (POP) is a challenging problem as the retailer needs to decide which products to promote, what is the depth of price discounts, when to schedule the promotions and how to promote the product. In this talk we discuss our ongoing collaboration over the past few years with Oracle RGBU where we introduce and discuss how optimization can play a key role in determining promotion planning and capture several important business requirements for grocery retail.

An important consumer behavior that is a direct consequence of promotions in grocery retail is that consumers stockpile the products on promotion and then experience promotion fatigue after the promotion ends. Therefore, as a first step, we propose and study two general classes of demand functions that capture this effect and can be directly estimated from data. Using these demand functions, we model and study the promotion planning problem. Unfortunately, the underlying formulation even for a single product is NP-hard and highly nonlinear (with neither a concave nor a convex objective). We propose a linear approximation and by showing the integrality of the feasible region in the formulation, we are able to solve the problem efficiently as a linear programming (LP) problem. For the classes of demand we introduce, we develop analytical bounds on the accuracy of the LP relative to the optimal (but intractable) POP solution. We also consider a graphical representation of the problem which allows us to employ a Dynamic Programming (DP) solution approach as an alternative. We discuss the tradeoffs between the two approaches (LP vs DP).

Furthermore, we illustrate how our approach generalizes to consider multiple products within a category that are substitutes and/or complementary. We discuss the tradeoffs when there are also cross product effects.

Entrée gratuite

Bienvenue à tous.

Date

Mardi 24 mars 2015
Débute à 11h00

Prix

gratuit

Contact

514-340-6053 x6991

Lieu

Université de Montréal - Pavillon André-Aisenstadt
2920, chemin de la Tour
Montréal
QC
Canada
H3T 1N8
514 343-6111
4488

Catégories