Publication | Closed Access
Generating Unit Commitment by Dynamic Programming
224
Citations
0
References
1966
Year
Mathematical ProgrammingUnit CommitmentEngineeringStraightforward FormulationInteger OptimizationEnergy ManagementUnit Commitment ProblemBusinessDynamic ProgrammingSystems EngineeringDynamic Programming1Computer ScienceCombinatorial OptimizationDiscrete OptimizationMechanism DesignQuantitative ManagementDynamic OptimizationOperations Research
The objective of this study was to determine the feasibility of using Dynamic Programming1 to solve the generating unit commitment problem. The main difficulty connected with this problem, is that factorial N, a large number for even a relatively small N, plays a central role in any straightforward formulation of the problem.