Journal
COMPUTERS & CHEMICAL ENGINEERING
Volume 102, Issue -, Pages 81-95Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.compchemeng.2016.07.026
Keywords
Supply chain optimization; Game theory; Mixed-integer bilevel programming; Reformulation and decomposition algorithm; Biofuel
Funding
- National Science Foundation (NSF) CAREER Award [CBET-1643244]
- Directorate For Engineering
- Div Of Chem, Bioeng, Env, & Transp Sys [1643244] Funding Source: National Science Foundation
Ask authors/readers for more resources
While Stackelberg leader-follower games and bilevel programming have become increasingly prevalent in game-theoretic modeling and optimization of decentralized supply chains, existing models can only handle linear programming or quadratic programming followers' problems. When discrete decisions are involved in the follower's problem, the resulting lower-level mixed-integer program prohibits direct transformation of the bilevel program into a single-level mathematical program using the MKT conditions. To address this challenge, we propose a mixed-integer bilevel programming (MIBP) modeling framework and solution algorithm for optimal supply chain design and operations, where the follower is allowed to have discrete decisions, e.g. facility location, technology selection, and opening/shutting-down of production lines. A reformulation-and-decomposition algorithm is developed for global optimization of the MIBP problems. A case study on an integrated forestry and biofuel supply chain is presented to demonstrate the application, along with comparisons to conventional centralized modeling and optimization methods. (C) 2016 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available