.png){kind=icon}
.png){kind=icon}
Return
Nonlinear stochastic programming-With a case study in continuous switching
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2016.01.007.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The optimal solution, as well as the objective of stochastic programming problems vary with the underlying probability measure. This paper addresses stability with respect to the underlying probability measure and stability of the objective. The techniques presented are employed to make problems numerically tractable, which are formulated by involving numerous scenarios, or even by involving a continuous probability measure. The results justify clustering techniques, which significantly reduce computation times while guaranteeing a desired approximation quality. The second part of the paper highlights Newton's method to solve the reduced stochastic recourse problems. The techniques presented exploit the particular structure of the recourse function of the stochastic optimization problem. The tools are finally demonstrated on a benchmark problem, which is taken from electrical power flows. (C) 2016 Elsevier B.V. All rights reserved.
Keywords:
Stochastic optimization
Nonlinear programming
Risk measures
Robust optimization
Wasserstein metrics
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available