TY - JOUR
T1 - Integration of Sales and Operations
T2 - A Dynamic Mixed-Integer Programming Game
AU - Telha, Claudio
AU - Carvalho, Margarida
N1 - Publisher Copyright:
© The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024.
PY - 2024
Y1 - 2024
N2 - We define a framework to investigate and assess the impact of prompt and dynamic reactions to market competition in production planning problems. It depicts two firms that produce and sell substitutable products over a finite time horizon. Each firm optimizes its sales and production costs, and has sufficient market power to affect the sales of the other firm. The framework can capture several production and market competition features. We model production plans using mixed-integer programs and market competition using sequential Stackelberg games. Under certain conditions, we can solve the models in our framework in polynomial-time. We provide examples to illustrate how the framework can match the requirements of production planning and sales. Then, we perform a computational study to analyze a planning problem that features the possibility of technological investments to reduce the variable production costs. We draw insights on the value of our polynomial-time method to compute subgame perfect equilibria by comparing its optimal production plans against a static model, where firms fix the entire production plan at the beginning of the planning horizon, and a myopic model, where firms ignore the impact that current decisions will have in future periods.
AB - We define a framework to investigate and assess the impact of prompt and dynamic reactions to market competition in production planning problems. It depicts two firms that produce and sell substitutable products over a finite time horizon. Each firm optimizes its sales and production costs, and has sufficient market power to affect the sales of the other firm. The framework can capture several production and market competition features. We model production plans using mixed-integer programs and market competition using sequential Stackelberg games. Under certain conditions, we can solve the models in our framework in polynomial-time. We provide examples to illustrate how the framework can match the requirements of production planning and sales. Then, we perform a computational study to analyze a planning problem that features the possibility of technological investments to reduce the variable production costs. We draw insights on the value of our polynomial-time method to compute subgame perfect equilibria by comparing its optimal production plans against a static model, where firms fix the entire production plan at the beginning of the planning horizon, and a myopic model, where firms ignore the impact that current decisions will have in future periods.
KW - Game theory
KW - Production planning
KW - Sales
KW - Stackelberg equilibria
KW - Subgame perfect equilibria
UR - http://www.scopus.com/inward/record.url?scp=85199994190&partnerID=8YFLogxK
U2 - 10.1007/s13235-024-00582-7
DO - 10.1007/s13235-024-00582-7
M3 - Article
AN - SCOPUS:85199994190
SN - 2153-0785
JO - Dynamic Games and Applications
JF - Dynamic Games and Applications
ER -