A nonlinear bi-level programming approach for product portfolio management

被引:12
|
作者
Ma, Shuang [1 ]
机构
[1] Beijing Inst Technol, Sch Management & Econ, Beijing 100081, Peoples R China
来源
SPRINGERPLUS | 2016年 / 5卷
关键词
Product portfolio management; Nonlinear bi-level programming; Leader-follower joint optimization; Bi-level nested genetic algorithm; OPTIMIZATION; ALGORITHMS; DECISIONS; DESIGN; MODEL;
D O I
10.1186/s40064-016-2421-0
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
Product portfolio management (PPM) is a critical decision-making for companies across various industries in today's competitive environment. Traditional studies on PPM problem have been motivated toward engineering feasibilities and marketing which relatively pay less attention to other competitors' actions and the competitive relations, especially in mathematical optimization domain. The key challenge lies in that how to construct a mathematical optimization model to describe this Stackelberg game-based leader-follower PPM problem and the competitive relations between them. The primary work of this paper is the representation of a decision framework and the optimization model to leverage the PPM problem of leader and follower. A nonlinear, integer bi-level programming model is developed based on the decision framework. Furthermore, a bi-level nested genetic algorithm is put forward to solve this nonlinear bi-level programming model for leader-follower PPM problem. A case study of notebook computer product portfolio optimization is reported. Results and analyses reveal that the leader-follower bi-level optimization model is robust and can empower product portfolio optimization.
引用
收藏
页数:18
相关论文
共 50 条
  • [21] Bi-level programming and algorithm on the location of arterial highway management station
    Cheng, Xue-Qing
    Jia, Jiang-Tao
    Li, Yue
    Liu, Xing-Wen
    Jiaotong Yunshu Xitong Gongcheng Yu Xinxi/Journal of Transportation Systems Engineering and Information Technology, 2016, 16 (03): : 207 - 213
  • [22] A Bi-level Programming Approach for Pre-positioning Emergency Warehouses
    Saghehei, E.
    Memariani, A.
    Bozorgi-Amiri, A.
    INTERNATIONAL JOURNAL OF ENGINEERING, 2021, 34 (01): : 128 - 139
  • [23] Ordinary Kriging approach for spatial interpolation based on bi-level programming
    Huang B.
    He F.
    Jiang H.
    Xitong Gongcheng Lilum yu Shijian, 2020, 5 (1317-1325): : 1317 - 1325
  • [24] A bi-level programming approach for global investment strategies with financial intermediation
    Benita, Francisco
    Lopez-Ramos, Francisco
    Nasini, Stefano
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 274 (01) : 375 - 390
  • [25] A Bi-level programming approach for pre-positioning emergency warehouses
    Saghehei E.
    Memariani A.
    Bozorgi-Amiri A.
    Memariani, A. (memariani@khu.ac.ir), 1600, Materials and Energy Research Center (34): : 128 - 139
  • [26] A Bi-Level Programming Approach for Optimal Design of EV Charging Station
    Zeng, Bo
    Dong, Houqi
    Wei, Xuan
    Xu, Fuqiang
    Sioshansi, Ramteen
    Zhang, Min
    2019 IEEE INDUSTRY APPLICATIONS SOCIETY ANNUAL MEETING, 2019,
  • [27] Production and work force assignment problem: A bi-level programming approach
    Zhou, Xiaoyang
    Tu, Yan
    Lev, Benjamin
    INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE AND ENGINEERING MANAGEMENT, 2015, 10 (01) : 50 - 61
  • [28] A Royalty Negotiation Model for BOT Projects: A Bi-level Programming Approach
    Kang, Chao-Chung
    Feng, Cheng-Min
    Kuo, Chiu-Yen
    IEEM: 2008 INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT, VOLS 1-3, 2008, : 1764 - +
  • [29] Fuzzy rough bi-level multi-objective nonlinear programming problems
    Elsisy, M. A.
    El Sayed, M. A.
    ALEXANDRIA ENGINEERING JOURNAL, 2019, 58 (04) : 1471 - 1482
  • [30] Distribution LMP-Based Demand Management in Industrial Park via a Bi-Level Programming Approach
    Wei, Jingdong
    Zhang, Yao
    Wang, Jianxue
    Wu, Lei
    IEEE TRANSACTIONS ON SUSTAINABLE ENERGY, 2021, 12 (03) : 1695 - 1706