This paper introduces a new approach for scheduling security constraint unit commitment (SCUC) including wind farms. Because of uncertainty in wind power production, we tried to develop a new method for incorporating wind power generation in power plant scheduling. For this, wind power generation modeled with unit commitment in a non-linear optimization problem and simulated by submitting diffe...

From the optimization point of view, an optimum solution of the unit commitment problem with reliability constraints can be achieved when all constraints are simultaneously satisfied rather than sequentially or separately satisfying them. Therefore, the reliability constraints need to be appropriately formulated in terms of the conventional unit commitment variables. In this paper, the reli...

In this paper, a new method to review the role of wind units as an energy-producer in the scheduling problem of unit commitment is presented. Today, renewable energy sources due to lack of environmental pollution, absence of dependence on fossil fuels, and consequently a very low marginal cost, have been receiving considerable attention in power system. But these sources are associated with unc...

As an energy market transforms from a regulated market to a deregulated one, the demands for a power plant are highly uncertain. In this paper, we study a two-stage robust optimization formulation and provide a tractable solution approach for the problem. The computational experiments show the effectiveness of our approach.

The profit based unit commitment problem involves determining the time intervals at which a particular generating unit should be online and available for generation, and the associated generation or dispatch, the aim being to maximize its total profits based on a given price profile. This problem can be attacked by various techniques like single unit dynamic programming, lagrangian relaxation, ...

The unit commitment (UC) problem aims to find an optimal schedule of generating units subject to demand and operating constraints for an electricity grid. The majority of existing algorithms for the UC problem rely on solving a series of convex relaxations by means of branch-and-bound and cuttingplanning methods. The objective of this paper is to obtain a convex model of polynomial size for pra...