이 제출물을 팔로우합니다
- 팔로우하는 게시물 피드에서 업데이트를 확인할 수 있습니다
- 정보 수신 기본 설정에 따라 이메일을 받을 수 있습니다
Unit commitment based on an advanced forward DP technique. The user can choose to keep track of more than one predecessor (or even all) thus overcoming the drawback of DP method that it cannot "see" the optimal solution in some cases.
Program constraints are min. and max. power output of generators, their min. up and down times, ramp rates, required reserve. Start-up costs can be constant (cold), hot/cold or exponential. Production cost function can be either linear or quadratic. The results can be printed in summarized or in detailed form. Program works in time resolution of 1 hour.
인용 양식
Vladimir Stanojevic (2026). Unit commitment by dynamic programming method (https://kr.mathworks.com/matlabcentral/fileexchange/32073-unit-commitment-by-dynamic-programming-method), MATLAB Central File Exchange. 검색 날짜: .
| 버전 | 퍼블리시됨 | 릴리스 정보 | Action |
|---|---|---|---|
| 1.0.0.0 |