Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Lecture at the INFORMS Optimization Section Conference in Miami, February 26, 2012
Suvrajeet Sen Data Driven Decisions Lab Integrated Systems Engineering Ohio State University
d
Data Driven Decisions @ The Ohio State University Industrial and Systems Engineering
Some Historical Remarks Classification of SMIP SMIP Models: Risk, Recourse, Resilience Structural Properties Decomposition: Benders and Beyond Illustrative Computational Results
d)
e)
0 < age 10 10 < age 15 15 < age 20 20 < age 25 age > 25
INFORMS OS was founded at the Spring ORSA/TIMS Meeting in Los Angeles, April 1995.
d d d
Uncertainty
Uncertainty
Linear Programming
Integer Programming
1960s Present
Risk is everywhere Risk is merely a 4-letter word There is a market for information Information has no value Hind sight is 20/20 Foresight is 20/20
d d d
Certainty:
Certainty:
Certainty:
annotated bibliography (Stougie and van der Vlerk) Theory: (7+) papers
Simple Integer Recourse: 2 Structural Properties of Expected Recourse Function: 4 Complexity: (1+) Benders-type methods: 5 Grobner-basis methods: 2 Convex Approximations for Simple Integer Recourse: 2 Other: 8 (Sampling with first-stage integer, disjunctive cuts)
d d
Books/Surveys: 6 altogether
Dissertations: 3-4 (1 prior to 2000 in North America) Habilitation: 1 Published surveys: 3 (includes hierarchical planning) Production Planning/Scheduling: 3 Network and Routing: 11 Location: 7 Other: 4
Schultz, R (2003) Stochastic Programming with Integer Variables, Mathematical Programming-B, 285-309 Stougie, L. and M.H. van der Vlerk (2005) Approximation in Stochastic Integer Programming Sen, S. (2005) Stochastic Mixed-Integer Programming Algorithms, Handbook of Discrete Optimization, (Aardal, Nemhauser, Weismantel, eds.) . Some newer surveys are also available .
And you know were serious because of applications with realistic data
Manufacturing Supply Chain: Two-stage Design (IBM, Intel) Biofuel Supply Chain: Multi-stage Design (Fan et al) Homeland Security Defender/Attacker/Defender (Wood et al NPS, Ordonez/Tambe, Smith) Electric Power Unit Commitment (Birge/Takriti, Philpott, Guan/Zhang), Fuel Price Hedging (Sen et
al)
Military Prioritizing Choices (Morton), UAV/MAV (Evers et al) Fighting Forest Fire (Ntaimo)
d d
Describing SMIP Problems B = Set of stages with Binary Vars. C = Set of stages with Continuous Vars. D = Set of stages with Discrete Vars.
(arbitrary integers, not just binary)
Louveaux has proposed a notation that covers all SP problems (e.g. notation includes whether random variables are cont/discrete) Above notation helps clarify domain of applicability of results/algorithms etc.
d d d
Traditional Benders Decomposition SLP: B = {}, C={1,2}, D ={} Wollmer, Norkin et al, Poojari/Mitra: B = {1}, C={1,2}, D ={1} Special Structure: Simple Integer Recourse: B = {2}, C={1}, D ={2} + structure of second stage Global Optimization and IP Ahmed, Tawarmalani, Sahinidis: B = {2}, C={1,2}, D ={2} ; + Fixed Tenders Grossman & Co. (E = Y)
d d d
Caroe/Tind, Sherali/Fraticelli, Sen/Higle, Sen/Sherali: B = {1,2}, C={2}, D ={} Ntaimo/Sen: B = {1,2}, C={1,2}, D ={}
Multi-stage SMIPs: Caroe/Schultz, Roemisch et al, Alonso-Ayuso et al, Lulli/Sen, Guan et al B = {1,2, N}, C={1,2 N}, D ={1,2 N}b
SMIP Models
Special Structured IP (Knapsack, Mixing etc.) See Prkopa, Dentcheva, Ruszczynski Leudtke et al (2010), Kkyavuz (2010), Saxena et al (2009), Shen et al (2010)
d d d
Risk in SMIP
We have only stated models via Expected Values Is the reliance on Expectation a handicap? Of course! But many risk measures (e.g. down-side risk, mean absolute deviation, CVaR, etc.) can be re-formulated using expectation of a slightly modified, though mathematically similar function.
We have only stated models via Expected Values Is the reliance on Expectation a handicap? Of course! But many risk measures (e.g. down-side risk, mean absolute deviation, CVaR, etc.) can be re-formulated using expectation of a slightly modified, though mathematically similar function Important: Inequalities are indispensible for risk modeling
d d
r
Similar to non-convex piecewise linear programming.
Each piece requires a binary (switch variable)
d d d
This SCO has two sets of decisions: 1. Choose server locations (e.g. bases) 2. Once demand nodes (e.g threats) appear, then assign servers to demand nodes
Min j cjxj E[ijqijyij() + j QjYj()] subject to: constraints on supply-side, j xj v, j J(z) xj wz, z demand-side, jyij() + Yj() = i, i supply/demand: i yij() Yj() ujxj, j Plus: All variables are binary
Modeling Resilience
y1jk xj
d d d
Structural Properties
Most structural properties and algorithms for SMIP assume relatively complete and sufficiently expensive recourse.
Under the above assumption, the expected recourse function is real-valued and lower semi-continuous.
Two-stage stochastic programs with recourse having finitely many scenarios is #P-hard
(The class #P asks for the count (i.e. how many, rather than are there any?) The proof reduces any graph reliability problem to a two-stage stochastic combinatorial optimization problem
What Do we Need?
A Potent Brew! Decomposition (SP) and Convexification (IP)
Hot off the Printer! First stage 0-1, Second-stage General Integer,
First stage: 0-1 Second-stage: mixed 0-1
Subproblems are Integer Programs Master Problems are required to Optimize Nonconvex functions
Each iteration will involve only LP solutions in the second-stage Solve LP relaxation TWICE
Once solve with an Old Convexification Derive a Cut to Update the Convexification First-stage is same as Benders original proposal Second-stage are LPs.
d d d
We will have
Scen
4 9 36 121
Vars
22 47 182 607
Cons
24 54 216 726
GDD-S
7 (13) 7 (39) 10 (183) 9 (526)
GDD-R
7 (32) 6 (76) 6 (384) 6 (1032)
B&B Nodes
54 306 1.55E7 7.60E6
Convergence for Disjunctive Decomposition (Set Convexification) Assumptions Complete recourse All integer variables are 0-1 Maintain all cuts in Wk Certain rules of order hold (a la lexicographic dual simplex in Gomorys proof) Under these assumptions, the D2 method results in a convergent algorithm (Sen and Higle).
d d d
0(x,)
There will be one piece per node of a truncated BAC tree in the second-stage Disjunctive Programming lets us convexify the function (for each outcome )
d
CPU Time (secs.) D2 78.25 171.49 248.81 295.95 480.46 1902.20 5410.10 9055.29
L2
Computational Results for Problem Instance SSLP_15_45 Scenarios 5 10 15 Binaries Constraints 3,390 301 6,765 601 10,140 901 % ZIP Gap Iterations 6.88 146 6.53 454 5.62 814 D Cuts 145 453 813
2
SCALABILITY: D2 scales well with increase in number of scenarios (linear) D2 does not scale well with increase in size of master 55 program (x)
d
1500 S
2000
2500
Number of Scenarios
56
d
Conclusions
Decomposition (SP) + Valid Inequalities (IP) provide a potent potion! But Stochastic MIP still needs a lot of work
Specially structured cuts (already at play in Chance Constrained SP) Multi-stage extensions (very rich area) Real-world Applications .
d d d