Stochastic programming with incomplete information:a surrey of results on postoptimization and sensitivity analysis
OptimizationPublished 1 January 1987
Jitka Dupačová
Citations50
SJR quartileQ2
SJR score0.70
SNIP1.37
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
The possibility of successful applications of stochastic programming decision models has been limited by the assumed complete knowledge of the distribution Fof the random parameters as well as by the limited scope of the existing numerical procedures. We shall give a survey of selected methods which can be used to deal with the incomplete knowledge of the distribution F, namely to study robustness of the optimal solution and the optimal value of the objective function relative to small changes of the underlying distribution and to get error bounds in approximation schemes.
Keywords
Decision SciencesEconomics, Econometrics and Finance
Wiley series in probability and statisticsLinear Statistical Inference and its Applications
10,509 Citations1973C. Radhakrishna Rao
Wiley series in probability and statisticsApproximation Theorems of Mathematical Statistics
5,946 Citations1980Robert Serfling
Journal of the American Statistical AssociationThe Influence Curve and its Role in Robust Estimation
2,481 Citations1974Frank R. Hampel
Mathematics of Operations ResearchStrongly Regular Generalized Equations
981 Citations1980Stephen M. Robinson
A regularity condition is introduced for generalized equations and it is shown to be in a certain sense the weakest possible condition under which the stated properties will hold.
Journal of the American Statistical AssociationThe Influence Curve and Its Role in Robust Estimation
502 Citations1974Frank R. Hampel
Mathematical ProgrammingSensitivity analysis for nonlinear programming using penalty methods
382 Citations1976Anthony V. Fiacco
A theoretical basis is established for utilizing a penalty-function method to estimate sensitivity information of a localsolution and its associated Lagrange multipliers of a large class of nonlinear programming problems with respect to a general parametric variation in the problem functions.
The Annals of StatisticsAsymptotic Behavior of Statistical Estimators and of Optimal Solutions of Stochastic Optimization Problems
267 Citations1988Jitka Dupačová, Roger J.‐B. Wets
Management ScienceInequalities for Stochastic Linear Programming Problems
261 Citations1960Albert Madansky
Mathematical ProgrammingPerturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
254 Citations1974Stephen M. Robinson
Mathematical programming studiesDesigning approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse
248 Citations1986John R. Birge, Roger J.‐B. Wets
Various approximation schemes for stochastic optimization problems involving either approximating of the probability measures and/or approximates of the objective functional, are investigated and their potential implementation as part of general procedures for solving Stochastic programs with recourse is discussed.
Stochastic Programming: Solution Techniques and Approximation Schemes
202 Citations1983Roger J.‐B. Wets
Mathematical programming studiesSolution point differentiability without strict complementarity in nonlinear programming
182 Citations1984Krisorn Jittorntrum
The Annals of Mathematical StatisticsThe General Moment Problem, A Geometric Approach
161 Citations1968J. H. B. Kemperman
StochasticsThe minimax approach to stochastic programming and an illustrative application
158 Citations1987Jitka Dupačová
The minimax approach to stochastic programming with recourse deals with the case of incomplete knowledge of the distribution F of the random coefficients and leads to the deterministic program [ILM0001] where x is a given set of admissible solutions, φ is a recourse function and f is aGiven set of distributions.
Mathematical programming studiesDirectional differentiability of the optimal value function in a nonlinear programming problem
101 Citations1984R. T. Rockafellar
Journal of Applied ProbabilityMore bounds on the expectation of a convex function of a random variable
90 Citations1972Aharon Ben‐Tal, Eithan Hochman
SIAM Journal on Control and OptimizationStochastic Optimization Problems with Incomplete Information on Distribution Functions
85 Citations1985Y. Ermoliev, Alexei A. Gaivoronski +1 more
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.
Zeitschrift für angewandte Mathematik und PhysikComputational methods for solving two-stage stochastic linear programming problems
82 Citations1979Peter Kall
Mathematische Operationsforschung und Statistik Series OptimizationSolving Stochastic Programming Problems with Recourse Including Error Bounds
82 Citations1982P. Kall, Dietrich Stoyan
Under suitable convexity and integrability assumptions, for the stochastic programming problem with recourse statements, error bounds are proved very easily and lower bounds for approximations using discrete random vectors are proved.
Operations ResearchTechnical Note—Minimax Procedure for a Class of Linear Programs under Uncertainty
55 Citations1977R. Jagannathan
This work considers a stochastic linear programming problem with random RHS elements and obtains a minimax solution of the problem as an optimal solution of an equivalent deterministic convex separable programming problem.
Mathematical ProgrammingComputational experience in sensitivity analysis for nonlinear programming
47 Citations1974Robert L. Armacost, Anthony V. Fiacco
A method for sensitivity analysis in nonlinear programming has recently been developed using the sequential unconstrained minimization technique and is applied here to perform sensitivity analyses on four example problems to demonstrate the computational feasibility and characteristics of the approach.
Minimax procedure for a class of linear programs under uncertainty.
44 Citations1977R. Jagannathan
Mathematical ProgrammingStability in stochastic programming with recourse-estimated parameters
40 Citations1984Jitka Dupačová
Stability of the optimal solution of stochastic programs with recourse with recourse under assumption of strict complementarity known from the theory of nonlinear programming is studied.
Mathematical programming studiesRobustness against dependence in PERT: An application of duality and distributions with known marginals
39 Citations1986Willem K. Klein Haneveld
Mathematical programming studiesStability in stochastic programming with recourse. Contaminated distributions
34 Citations1986Jitka Dupačová
ComputingA globally convergent algorithm based on imbedding and parametric optimization
31 Citations1983Helmut Gfrerer, J. Guddat +1 more
The globally convergent algorithm, well-established for the solution of nonlinear equations is extended to restricted optimization problems, and the hypotheses for the convergence of the algorithm may be secured for the class of convex problems.
Mathematical programming studiesLinearization methods for optimization of functionals which depend on probability measures
29 Citations1986Alexei A. Gaivoronski
On a Class of Moment Problems
22 Citations1972J. H. B. Kemperman
Operations ResearchRestricted Bayes Strategies for Programs with Simple Recourse
7 Citations1980Raymond Nadeau, Radu Theodorescu
This paper presents a linear stochastic program with partial information, where the confidence in this joint probability distribution is expressed by a parameter varying from 0 to 1.
IIASA PURE (International Institute of Applied Systems Analysis)Stochastic Programming with Incomplete Information
7 Citations1986Jitka Dupačová
Methods which can be used to deal with the incomplete knowledge of the distribution F, to study robustness of the optimal solution and the optimal value of the objective function relative to small changes of the underlying distribution and to get error bounds in approximation schemes are introduced.