Professional Documents
Culture Documents
fundamental constraints are denominated nonanticipativity functions with saddle points. These schemes have been
constraints. applied to the scheduling of large-scale hydropower systems
Finally, it is important to characterize the decision in competitive framework in more than thirty countries,
attained using appropriate quality metrics, being particularity including detailed modeling of stochastic system components
relevant the VSS (Value of the Stochastic Solution) index that (inflows and prices) and transmission networks [17,18].
measures the advantage obtained as a result of properly On the other hand, if the stochastic programming problem
modeling the uncertainty involved. is formulated as a mixed-integer linear programming problem,
scenario reduction techniques [19] might allow reducing
IV. STOCHASTIC PROGRAMMING APPROACH drastically the number of scenarios considered without
Stochastic programming (where “programming” means reducing significantly the stochastic information embedded in
“planning”) is mathematical programming under uncertainty, the scenario tree. If this is the case, the resulting reduced
that is, any mathematical program where one or more of the problem can be directly attacked using state-of-the-art mixed-
coefficients are not fully known at the time of decision integer linear programming solvers, such as GAMS-CPLEX
making. The randomness may stem from the uncertainties [20].
described in Section II, such as unknown prices, uncertain
demand, varying quality of raw materials or random behavior VI. CONCLUSIONS
of operators, to mention but a few examples. So, stochastic This paper provides an introduction to the use of stochastic
programming is a problem class. programming techniques for decision making under
Three mathematical modeling approaches are generally uncertainty in electricity markets. Uncertainty sources are
considered to solve stochastic programs, namely, (i) identified, main ingredients of the decision making process are
mathematical programs with recourse, (ii) deterministic reviewed, and the features of the mathematical approaches to
programs that incorporate penalties to diminish infeasibilities achieve optimal decisions are described. Tutorial as well as
and (iii) programs with probabilistic constraints. Among those recent relevant references are provided.
approaches, the first one is the more versatile and widely used. This work serves as the basis for discussion in a panel
Mathematical programs with recourse allow determining session on “Decision Making under Uncertainty in Electricity
here-and-now first stage decisions and policies for wait-and- Markets”, organized by the authors and held at the IEEE PES
see second (and subsequent) stage decisions. That is, wait- 2006 General Meeting. The main objective of this panel
and-see decisions allow improving here-and-now decisions session is to discuss recent modeling issues and the supporting
once scenarios materialize. In other words, while deterministic mathematical methodologies that would be useful to deal with
multiperiod optimization yields decisions for all periods, a uncertainty in decision making. Presentations will address
stochastic approach only yields policies or strategies. The more specific models and their applications as well as a
well-known Stochastic Dynamic Programming (SDP) description of the numerical procedures and strategies that
technique has been widely applied as a flexible solution have been developed for certain classes of stochastic
procedure in the context of stochastic recourse problems. programming problems. The panel will be centered on energy
The deterministic programs with penalties to diminish problems where the uncertainty is of a technological nature; in
infeasibilities use the expected values of the random variables particular as it comes up in the production of energy, risk
to formulate a deterministic problem that incorporates management, power system planning and dynamic decision
penalties in the objective function to minimize infeasibilities making in electricity markets.
due to scenario realizations different from expected values.
Programs with probability constraints include constraints REFERENCES
that should be satisfied with a certain probability value, not [1] S. Sen and J. L. Higle, “An introductory tutorial on stochastic linear
always. programming models,” Interfaces, vol. 29, no. 2, pp. 33---61, March---
April 1999.
[2] J. R. Birge and F. Louveaux, Introduction to Stochastic Programming.
V. COMPUTATIONAL ISSUES New York: Springer-Verlag, 1997.
The greatest challenge of stochastic programming is indeed [3] J. L. Higle, and S. Sen, Stochastic Decomposition: A Statistical Method
for Large Scale Stochastic Linear Programming. New York: Springer-
the increase of the computational effort and scale of problems Verlag, 1996.
with the number of scenarios, with the number of probabilistic [4] P. Kall, J. Mayer, Stochastic Linear Programming: Models, Theory, and
constraints, number of stages, etc. In this context, the use of Computation. New York: Springer-Verlag, 2005.
[5] P. Kall and S. Wallace, Stochastic Programming, Chichester: John Wiley
stochastic programming techniques has been recently (late 80s & Sons, 1994” (Available at http://home.himolde.no/~wallace/).
and 90s) mixed with decomposition approaches in a step [6] A. Baillo, M. Ventosa, M. Rivier, and A. Ramos, “Optimal offering
forward to overcome the “curse of dimensionality” of strategies for generation companies operating in electricity spot
stochastic problems. For example, among these techniques, markets,” IEEE Trans. Power Syst., vol. 19, no. 2, pp. 745---753, May
2004.
we can mention the Stochastic Dual Dynamic Programming [7] M. V. Pereira, S. Granville, M. Fampa, R. Dix, and L. A. Barroso,
(SDDP) [15] – a technique that makes a “bridge” between “Strategic bidding under uncertainty: A binary expansion approach,”
SDP and multi-stage Benders Decomposition – and hybrid IEEE Trans. Power Syst., vol. 20, no. 1, pp. 180---188, Feb. 2005.
SDP/SDDP schemes [16] to accommodate stochastic
3
BIOGRAPHIES
Luiz Augusto Barroso has a BSc in Mathematics and a MSc and PhD in
optimization from UFRJ. He joined PSR in 1999, where he has been working
and researching on power systems economics, planning and operation,
focusing on hydrothermal systems. He has been a speaker on those subjects in
Latin America, Europe and US/Canada.
Antonio J. Conejo (F'04) received the M.S. degree from MIT, Cambridge,
MA, in 1987, and a Ph.D. degree from the Royal Institute of Technology,
Stockholm, Sweden in 1990. He is currently a full Professor at the
Universidad de Castilla-La Mancha, Ciudad Real, Spain. His research interests
include control, operations, planning and economics of electric energy
systems, as well as statistics and optimization theory and its applications.