期刊
COMPUTERS & CHEMICAL ENGINEERING
卷 125, 期 -, 页码 98-113出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.compchemeng.2019.01.021
关键词
Bilevel programming; Multi parametric programming; Mixed-integer programming
资金
- National Science Foundation [CBET-1705423 [PAROC], 1739977 [INFEWS]]
- U.S. Department of Energy under RAPID SYNOPSIS Project [DE-EE0007888-09-03]
- Texas AM University
- Texas A&M Energy Institute
Optimization problems involving two decision makers at two different decision levels are referred to as bi-level programming problems. In this work, we present novel algorithms for the exact and global solution of two classes of bi-level programming problems, namely (i) bi-level mixed-integer linear programming problems (B-MILP) and (ii) bi-level mixed-integer convex quadratic programming problems (B-MIQP) containing both integer and bounded continuous variables at both optimization levels. Based on multi-parametric programming theory, the main idea is to recast the lower level problem as a multiparametric programming problem, in which the optimization variables of the upper level problem are considered as bounded parameters for the lower level. The resulting exact multi-parametric mixed-integer linear or quadratic solutions are then substituted into the upper level problem, which can be solved as a set of single-level, independent, deterministic mixed-integer optimization problems. Extensions to problems including right-hand-side uncertainty on both lower and upper levels are also discussed. Finally, computational implementation and studies are presented through test problems. (C) 2019 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据