arrow
返回

A reformulation strategy for mixed-integer linear bi-level programming problems

delete2021-10-01
delete8
delete
OA
AI
S
Sergio Medina-González
L
Lazaros G. Papageorgiou
V
Vivek Dua *
DOI:10.1016/j.compchemeng.2021.107409delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Bi-level programming has been used widely to model interactions between hierarchical decision-making problems, and their solution is challenging, especially when the lower-level problem contains discrete decisions. The solution of such mixed-integer linear bi-level problems typically need decomposition, approximation or heuristic-based strategies which either require high computational effort or cannot guarantee a global optimal solution. To overcome these issues, this paper proposes a two-step reformulation strategy in which the first part consists of reformulating the inner mixed-integer problem into a nonlinear one, while in the second step the well-known Karush-Kuhn-Tucker conditions for the nonlinear problem are formulated. This results in a mixed-integer nonlinear problem that can be solved with a global optimiser. The computational and numerical benefits of the proposed reformulation strategy are demonstrated by solving five examples from the literature. (c) 2021 Elsevier Ltd. All rights reserved.
Keyword:
Mixed integer bi-level programming
Lower-level discrete variables
Nonlinear reformulation
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

C
Computers and Chemical Engineering
IF:
3.9
论文数:
8.1K
被引数:
2.1W

机构

U
University of London
学者数:
1.7K
论文数: 757
被引数: 14.7W
引用论文

引用论文

err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
err分享
err收藏
err分享
err收藏
err分享
err收藏
学者 查看更多内容