MILP 求解UC问题的缺点

本文探讨了使用混合整数线性规划(MILP)解决安全约束 Unit Commitment (UC) 问题所存在的不足。研究指出,MILP方法可能对问题的构建不够关注,特别是在确保解的可行性方面。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

It should be noted that MILP-based approach is becoming a
mainstream method for solving SCUC problems based on commercial
MILP solvers [8], [17]–[19]. However, the LR-based
approaches are still useful in many cases. This is because to
apply MILP-based methods efficiently, one of the most important
issues is to convert the problem objective and constraints
into a good linear formulation. Therefore, many ancillary variables
and constraints must be introduced to handle minimum
up/down time constraints, variable start-up costs, nonlinear fuel
costs, etc. In some cases, the computation efficiency would be
a serious issue. The approximation error is another important
issue seldom discussed.
On the other hand, one can use a more
natural and concise formulation for the LR-based methods and

cares less on the problem formation.


引自:A Systematic Method for Constructing  Feasible Solution to SCUC Problem With Analytical Feasibility Conditions
Hongyu Wu, Xiaohong Guan, Fellow, IEEE, Qiaozhu Zhai, Member, IEEE, and Hongxing Ye

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值