Unit commitment by dynamic programming method

unit commitment (plant scheduling) based on the forward DP method
8,8K Downloads
Aktualisiert 5. Jul 2011

Lizenz anzeigen

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.

Zitieren als

Vladimir Stanojevic (2026). Unit commitment by dynamic programming method (https://de.mathworks.com/matlabcentral/fileexchange/32073-unit-commitment-by-dynamic-programming-method), MATLAB Central File Exchange. Abgerufen.

Kompatibilität der MATLAB-Version
Erstellt mit R2008a
Kompatibel mit allen Versionen
Plattform-Kompatibilität
Windows macOS Linux
Kategorien
Mehr zu Quadratic Programming and Cone Programming finden Sie in Help Center und MATLAB Answers
Version Veröffentlicht Versionshinweise
1.0.0.0