Sciweavers

66 search results - page 9 / 14
» Scenarios for Multistage Stochastic Programs
Sort
View
JGO
2008
83views more  JGO 2008»
13 years 7 months ago
Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs
Two-stage stochastic mixed-integer programming (SMIP) problems with recourse are generally difficult to solve. This paper presents a first computational study of a disjunctive cut...
Lewis Ntaimo, Matthew W. Tanner
ENTCS
2008
120views more  ENTCS 2008»
13 years 7 months ago
Specifying and Executing Reactive Scenarios With Lutin
This paper presents the language Lutin and its operational semantics. This language specifically targets the domain of reactive systems, where an execution is a (virtually) infini...
Pascal Raymond, Yvan Roux, Erwan Jahier
IOR
2006
118views more  IOR 2006»
13 years 7 months ago
A Stochastic Programming Approach to Power Portfolio Optimization
The DASH model for Power Portfolio Optimization provides a tool which helps decision-makers coordinate production decisions with opportunities in the wholesale power market. The m...
Suvrajeet Sen, Lihua Yu, Talat Genc
ICCS
2004
Springer
14 years 1 months ago
A Dynamic Stochastic Programming Model for Bond Portfolio Management
In this paper we develop a dynamic stochastic programming model for bond portfolio management. A new risk measurement-shortfall cost is put forward. It allows more tangible express...
Liyong Yu, Shouyang Wang, Yue Wu, Kin Keung Lai
CSCLP
2005
Springer
14 years 1 months ago
A Hybrid Benders' Decomposition Method for Solving Stochastic Constraint Programs with Linear Recourse
Abstract. We adopt Benders’ decomposition algorithm to solve scenariobased Stochastic Constraint Programs (SCPs) with linear recourse. Rather than attempting to solve SCPs via a ...
Armagan Tarim, Ian Miguel