文件名称:YALMIP_Wiki_Examples_Unit_Commitment
-
所属分类:
- 标签属性:
- 上传时间:2015-01-16
-
文件大小:345.35kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
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
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
(系统自动生成,下载前可以参看下载内容)
下载文件列表
YALMIP_Wiki_Examples_Unit_Commitment_2015_01_15_21_01_44_163.pdf
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.