YALMIP_Wiki_Examples_Unit_Commitment
于 2015-01-16 发布
文件大小:345KB
0 241
下载积分: 1
下载次数: 48
代码说明：
A classical problem in scheduling and integer programming is the unit commitment problem. In this problem, our task is to turn on and off power generating plants, in order to meet a forecasted future power demand, while minimizing our costs. We have several different power plants with different characteristics and running costs, and various constraints on how they can be used. We will start with a very simple model, and then expand this model with more advanced features. To make the code easy to read, we will write it in a verbose non-vectorized format
下载说明：请别用迅雷下载，失败请重下，重下不扣分！
发表评论
