Stochastic Optimization Problems with Incomplete Information on Distribution Functions
TL;DR: Numerical procedures that avoid the difficulties associated with solving the “inner” problem with respect to probability measures are proposed for stochastic extremal problems in which the distribution function is only partially known.
read more
Abstract: The main purpose of this paper is to discuss numerical optimization procedures, based on duality theory, for stochastic extremal problems in which the distribution function is only partially known. We formulate such problems as minimax problems in which the “inner” problem involves optimization with respect to probability measures. The latter problem is solved using generalized linear programming techniques. Then we state the dual problem to the initial stochastic optimization problem. Numerical procedures that avoid the difficulties associated with solving the “inner” problem are proposed.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems
Erick Delage,Yinyu Ye +1 more
TL;DR: This paper proposes a model that describes uncertainty in both the distribution form (discrete, Gaussian, exponential, etc.) and moments (mean and covariance matrix) and demonstrates that for a wide range of cost functions the associated distributionally robust stochastic program can be solved efficiently.
Optimal Inequalities in Probability Theory: A Convex Optimization Approach
Dimitris Bertsimas,Ioana Popescu +1 more
TL;DR: It is shown that it is NP-hard to find tight bounds for k = 2 and $\Omega={\cal R}^n$, and an efficient algorithm for finding tight bounds when S is a union of convex sets, over which convex quadratic functions can be optimized efficiently.
On Complexity of Stochastic Programming Problems
Alexander Shapiro,Arkadi Nemirovski +1 more
- 01 Jan 2005
TL;DR: It is argued that two-stage (linear) stochastic programming problems with recourse can be solved with a reasonable accuracy by using Monte Carlo sampling techniques, while multistage Stochastic programs, in general, are intractable.
Stochastic programming approach to optimization under uncertainty
TL;DR: It is argued that two stage (say linear) stochastic programming problems can be solved with a reasonable accuracy by Monte Carlo sampling techniques while there are indications that complexity of multistage programs grows fast with increase of the number of stages.
Appointment Scheduling with Limited Distributional Information
TL;DR: In this paper, the authors developed distribution-free models that solve the appointment sequencing and scheduling problem by assuming only moments information of job durations, and derived the optimal time allowances in closed form and proved that it is optimal to sequence jobs in increasing order of job duration variance.
196
References
Convex sets and their applications
TL;DR: In this paper, the authors present families of Convex sets and characterizations of convex sets, as well as solutions, hints, and references for exercises for different types of sets.
382
Cutting-plane methods without nested constraint sets
TL;DR: General conditions for the convergence of a class of cutting-plane algorithms without requiring that the constraint sets for the sub-problems be sequentially nested are given.
53
Related Papers (5)
John R. Birge,Franois Louveaux +1 more
- 27 Jun 2011
R. T. Rockafellar,S Uryasev +1 more
Herbert E. Scarf
- 01 Jan 1957