This is the authors' abstract. We don't add key points for this paper.
Unit Commitment (UC) problem with non-linear functions and probabilistic constraints are difficult to solve by standard optimization methods. This paper provides an introduction to mixed integer programming problem formulation techniques and its applications to UC problem. Use of binary variables to convert nonlinear functions and probabilistic constraints to a Mixed Integer linear programming (MILP) form are presented. This conversion helps in solving the UC problem by using commercially available MILP solvers.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Viswanath et al. (2012) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: