We develop a theoretical foundation for optimizing transformation pathways in the residential building sector, introducing key concepts necessary for constructing our optimization model. We begin by discussing linear programming and its duality, followed by mixed-integer linear programming (MILP) and relevant solution methods. We then present Benders decomposition as a technique for solving large-scale MILP problems with linking variables, alongside various acceleration methods to enhance its efficiency.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Theoretical Background

  • Roman Delorme

摘要

We develop a theoretical foundation for optimizing transformation pathways in the residential building sector, introducing key concepts necessary for constructing our optimization model. We begin by discussing linear programming and its duality, followed by mixed-integer linear programming (MILP) and relevant solution methods. We then present Benders decomposition as a technique for solving large-scale MILP problems with linking variables, alongside various acceleration methods to enhance its efficiency.