Security-constrained unit commitment based on hybrid benders decomposition and mixed integer non-linear programming

2010 
This paper presents a formulation of security constrained unit commitment (SCUC) with emphasizing on Mixed Integer Nonlinear Programming (MINLP) and Benders Decomposition. The problem is finding a solution which satisfies the constraints and maximizes the objective function. The proposed method is solved using MINLP using solver in GAMS software. As a case study, results on IEEE 30-bus system are presented in this paper.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    10
    References
    4
    Citations
    NaN
    KQI
    []