Post on 13-Jul-2020
transcript
1
Capacity expansion using stochastic programming with
Decision Dependent Probabilities
Lars Hellemo
Asgeir Tomasgard
Paul I. Barton
ICSP XIII 2013
2
Decision dependent distribution
3
Outline
Decision dependent uncertainty in stochastic programs - taxonomy
Decision dependent probabilities
Capacity expansion application
Some numerical results
Original motivation:
1) How can we reformulate DDP problems to recourse models?
2) Can we use a generalization of Generalized Benders to solve them?
4
Decision dependent probabilities
The underlying problem is stochastic with decision dependent uncertainty
Formulated as large scale non-convex stochastic program
Ax0 £ b
ps(y)s
å =1
Wsxs = Ts
T x0 - Hs, "s
5
Real world versus problem I Take a problem where a dam in a river is to be built, and the dimensions to be determined.
The risk of a dam break has to be balanced against the extra cost of further reinforcing the dam. Depending on how it is built, the dam will resist different amounts of inflow. Inflows vary stochastically from year to year.
If you think there is a deterministic link between the inflow and the risk of breakage, this is exogenous uncertainty. The stochastic inflow is not influenced by the way the dam is build, rather the dam's resistance to various inflows is (deterministically) .
However, the relationship between the dam dimensions and the probability of a break based on stochastic inflows can be difficult to include in an optimization model. The modeller can choose to model this with endogenous uncertainty .
Here the probability of breakage depends on how strong we build the dam, possibly hiding some of the underlying stochastic phenomena.
6
Real world versus problem II
Consider uncertainty about the properties of an oil reservoir. For example, where to drill wells, when (and if) to drill the wells
The reserves in the reservoir are deterministic (in the short term...). But we do not know what they are.....How should we model?
Our decision to drill a well does normally not change the size of the reservoir as such (that is deterministic!), but it will provide more information about the true state of the reservoir. This information, is however not revealed unless we pay the substantial cost of drilling the well (endogenous uncertainty in the information process of the problem ).
Some drilling approaches may also jeopardize the reservoir itself by introducing leaks between layers in the ground, something that could leave parts of the reservoir unrecoverable (endogenous uncertainty in the real world and in the problem).
7
Mapping of real world to model
Deterministic
Exogenous
Endogenous
Real world
Deterministic
Exogenous
Endogenous
Problem Model class
Non-linear (non-
convex)
MIP
LP
Example: Reformulation to Stochastic programs with recourse
in discrete time and with discrete distributions.
8
T. Jonsbråten, R. Wets, and D. Woodruff. A class of stochastic programs with decision dependent random
elements. Annals of Operations Research, 82:83, 106, 1998.
J. Dupačová. Optimization under exogenous and endogenous uncertainty. L. Lukáš (Ed.), Proc. of MME06,
University of West Bohemia in Pilsen (2006)
Taxonomy suggested extension
Decision
Dependent
Dynamics &
Distribution
(Type 3)
9
Modify probability distribution
Adjusting scenario probabilities Many earlier approaches based on MILP and distribution
selection with binary y
We want to study y continuous and more general formulations
|( )p y
K. Viswanath, S. Peeta, and S. Salman. Investing in the Links of a Stochastic Network to Minimize Expected
Shortest Path. Length. Purdue University Economics Working Papers, 2004.
10
Other relevant litterature
G. Pflug. Optimization of stochastic models: the interface between simulation and optimization. Kluwer Academic Pub, 1996.
G. C. Pflug. On-line optimization of simulated Markovian processes. Mathematics of Operations Research, 15(3):381{395, August 1990.
R. Rubinstein and A. Shapiro. Discrete event systems: Sensitivity analysis and stochastic optimization by the score function method. 1993.
Z. Artstein and R. Wets. Stability results for stochastic programs and sensors, allowing for discontinuous objective functions. SIAM Journal on Optimization, 4:537, 1994.
11
Formulation 1: Scaling
In the special case where the original distribution is
uniform, this gives the function
12
Formulation 2: Convex combination
Example of mixture distribution of normal distributions
13
Discreteization of distribution function
14
Form. 3: Optimization over parameters in the distribution
f (x | a,b) = abxa-1(1- xa)b-1
F(x | a,b) =1- (1- xa)b
15
Kumaraswamy distribution
16
Kumaraswamy distribution
17
Form 4: Approximation of distribution + parameter opt.
18
Standard distribition
19
Standard distribution
20
Example: Change of parameters
21
Branch-and-bound
To guarantee convergence for these non-convex non-linear models: Continuous branch-and-bound
Branching strategy is essential
In addition integer B&B depending on the model.
Gams versions 23.6.2 and 23.7.2 with Baron using CPLEX in combination with CONOPT or MINOS.
GBD inspired decomposition at first seemed to work well in many cases . Until we tried strategic branching....
Baron using intelligent branching outperformed the GBD inspired decomposition
22
Test Case, application from energy
Inspired by Louveaux and Smeers (1988)
Invest in energy producing technologies (i)
Serve demand in modes (j) approximating a load curve
Technology/activity (y) available to modify probability. This is our addition
F. V. Louveaux and Y. Smeers. Optimal investments for electricity generation: A stochastic model and a test
problem. In Y. Ermoliev and R. J.-B. Wets, editors, Numerical Techniques for Stochastic Optimization,
pages 445-454. Springer-Verlag, 1988.
23
Base model
24
Scalable subset of scenarios uniform distribution
25
Convex combination of distributions
26
Computational results
27
Probabilities from solution of Gams implementation of model using 100 scenarios and Kumaraswamy distribution
28
Probabilities from optimal solution of Gams implementation of model using 100 scenarios and approximation of normal distribution
29
Research
Structural properties
Decomposition
New formulations
30
References [1] S. Ahmed. Strategic Planning under Uncertainty { Stochastic Integer Programming Approaches. PhD thesis, Graduate College, University of Illinois at Urbana-Champaign, Urbana, IL, USA, 2000. [2] K. Ariyawansa, A. Felt, W. S. U. P. D. O. PURE, and A. MATHEMATICS. A Collection of Multistage Stochastic Linear Programming Test Problems (Version 1). 2000. [3] Z. Artstein and R. Wets. Stability results for stochastic programs and sensors, allowing for discontinuous objective functions. SIAM Journal on Optimization, 4:537, 1994. [4] J. F. Benders. Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4(1):238{252, December 1962. [5] J. R. Birge and F. V. Loveaux. Introduction to Stochastic Programming. Springer-Verlag, New York, 1997. [6] N. Boland, I. Dumitrescu, and G. Froyland. A multistage stochastic programming approach to open pit mine production scheduling with uncertain geology. 2008. [7] M. Colvin and C. Maravelias. A Branch and Cut Framework for Multi-Stage Stochastic Programming Problems Under Endogenous Uncertainty. Computer Aided Chemical Engineering, 7:255{260, 2009. [8] J. Dupacova. Optimization under exogenous and endogenous uncertainty. University of West Bohemia in Pilsen, 2006. [9] S. Dye, L. Stougie, and A. Tomasgard. The stochastic single resource service provision problem. Naval Research Logistics, 50(8):869{887, December 2003. [10] A. Georion. Generalized Benders Decomposition. Journal of optimization theory and applications, 10(4):237{260, 1972. [11] V. Goel and I. Grossmann. A stochastic programming approach to planning of offshore gas field developments under uncertainty in reserves. Computers and Chemical Engineering, 28(8):1409{1429, 2004. [12] V. Goel and I. Grossmann. A class of stochastic programs with decision dependent uncertainty. Mathematical Programming, 108(2):355{394, 2006. [13] V. Gupta and I. Grossmann. Solution strategies for multistage stochastic programming with endogenous uncertainties. Submitted for publication, 2010. [14] H. Held and D. Woodru. Heuristics for multi-stage interdiction of stochastic networks. Journal of heuristics, 11(5):483{500, 2005. [15] T. Jonsbraten. Oil eld optimization under price uncertainty. Journal of the Operational Research Society, 49(8):811{818, 1998. [16] T. Jonsbraten, R. Wets, and D. Woodru. A class of stochastic programs withdecision dependent random elements. Annals of Operations Research, 82:83{106, 1998. [17] F. V. Louveaux and Y. Smeers. Optimal investments for electricity generation: A stochastic model and a test problem. In Y. Ermoliev and R. J.-B. Wets, editors, Numerical Techniques for Stochastic Optimization, pages 445{454. Springer-Verlag, 1988. [18] A. Mitsos, B. Chachuat, and P. Barton. McCormick-based relaxations of algorithms. SIAM Journal on Optimization, 20(2009):573{601, 2009. [19] G. Pflug. Optimization of stochastic models: the interface between simulation and optimization. Kluwer Academic Pub, 1996. [20] G. C. Pflug. On-line optimization of simulated markovian processes. Mathematics of Operations Research, 15(3):381{395, August 1990. [21] R. Rubinstein and A. Shapiro. Discrete event systems: Sensitivity analysis and stochastic optimization by the score function method. 1993. [22] S. Solak. Ecient solution procedures for multistage stochastic formulations of two problem classes. PhD thesis, 2007. [23] B. Tarhan, I. Grossmann, and V. Goel. Stochastic programming approach for the planning of oshore oil or gas eld infrastructure under decision-dependent uncertainty. Industrial & Engineering Chemistry Research, 48(6):3078{3097, 2009. [24] P. Varaiya and R. Wets. Stochastic dynamic optimization approaches and computation. Citeseer, 1988. [25] K. Viswanath, S. Peeta, and S. Salman. Investing in the Links of a Stochastic Network to Minimize Expected Shortest Path. Length. Purdue University Economics Working Papers, 2004