Integration of Sales and Operations: A Dynamic Mixed-Integer Programming Game

被引:0
|
作者
Telha, Claudio [1 ]
Carvalho, Margarida [2 ,3 ]
机构
[1] Univ Los Andes, Fac Ingn & Ciencias Aplicadas, Santiago 12455, Chile
[2] Univ Montreal, CIRRELT, 2920 chemin Tour, Montreal, PQ H3T 1J4, Canada
[3] Univ Montreal, Dept Informat & Rech Operat, 2920 chemin Tour, Montreal, PQ H3T 1J4, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
Game theory; Stackelberg equilibria; Subgame perfect equilibria; Production planning; Sales; LOT-SIZING PROBLEMS; PRODUCTION DECISIONS; COST ALLOCATION; FORMULATIONS; MODEL; ALGORITHM; BEHAVIOR; PRICE;
D O I
10.1007/s13235-024-00582-7
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
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.
引用
收藏
页码:306 / 328
页数:23
相关论文
共 50 条
  • [41] Implementation of Mixed-Integer Programming on Embedded System
    Novak, Jakub
    Chalupa, Petr
    25TH DAAAM INTERNATIONAL SYMPOSIUM ON INTELLIGENT MANUFACTURING AND AUTOMATION, 2014, 2015, 100 : 1649 - 1656
  • [42] SelfSplit parallelization for mixed-integer linear programming
    Fischetti, Matteo
    Monaci, Michele
    Salvagnin, Domenico
    COMPUTERS & OPERATIONS RESEARCH, 2018, 93 : 101 - 112
  • [43] Fuzzy Programming for Mixed-Integer Optimization Problems
    Lin, Yung-Chin
    Lin, Yung-Chien
    Su, Kuo-Lan
    Lin, Wei-Cheng
    Chen, Tsing-Hua
    PROCEEDINGS OF THE SIXTEENTH INTERNATIONAL SYMPOSIUM ON ARTIFICIAL LIFE AND ROBOTICS (AROB 16TH '11), 2011, : 261 - 264
  • [44] HOW TO USE MIXED-INTEGER PROGRAMMING.
    Allen, Derek H.
    Chemical Engineering (New York), 1976, 83 (07): : 114 - 120
  • [45] Robust Quadratic Programming with Mixed-Integer Uncertainty
    Mittal, Areesh
    Gokalp, Can
    Hanasusanto, Grani A.
    INFORMS JOURNAL ON COMPUTING, 2020, 32 (02) : 201 - 218
  • [46] Sequence independent lifting for mixed-integer programming
    Atamtürk, A
    OPERATIONS RESEARCH, 2004, 52 (03) : 487 - 490
  • [47] Extended Formulations in Mixed-Integer Convex Programming
    Lubin, Miles
    Yamangil, Emre
    Bent, Russell
    Vielma, Juan Pablo
    INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, IPCO 2016, 2016, 9682 : 102 - 113
  • [48] Bivium as a Mixed-Integer Linear Programming Problem
    Borghoff, Julia
    Knudsen, Lars R.
    Stolpe, Mathias
    CRYPTOGRAPHY AND CODING, PROCEEDINGS, 2009, 5921 : 133 - 152
  • [49] UNDECIDABILITY AND HARDNESS IN MIXED-INTEGER NONLINEAR PROGRAMMING
    Liberti, Leo
    RAIRO-OPERATIONS RESEARCH, 2019, 53 (01) : 81 - 109
  • [50] Neural benders decomposition for mixed-integer programming
    Monemi, Rahimeh Neamatian
    Gelareh, Shahin
    Maculan, Nelson
    Dai, Yu-Hong
    TOP, 2024,