Sublinear Upper Bounds for Stochastic Programs with Recourse. Revision.

Abstract

Seperable sublinear functions are used to provide upper bounds on the recourse function of a stochastic program. The resulting problem's objective involves the inf-convolution of convex functions. A dual of this problem is formulated to obtain an implementable procedure to calculate the bound. Function evaluations for the resulting convex program only require a small number of single integrations in contrast with previous upper bounds that require a number of function evaluations that grows exponentially in the number of random variables. The sublinear bound can often be used when other suggested upper bounds are intractible. Computational results indicate that the sublinear approximation provides good, efficient bounds on the stochastic program objective value.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1987
Accession Number
ADA186436

Entities

People

  • John R. Birge
  • Roger J. Wets

Organizations

  • University of Michigan

Tags

Communities of Interest

  • C4I
  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Computational Science
  • Computations
  • Computer Programming
  • Computer Programs
  • Computers
  • Engineering
  • Inequalities
  • Information Science
  • Linear Programming
  • Mathematical Programming
  • Mathematics
  • Operations Research
  • Optimization
  • Probability
  • Random Variables
  • Statistics

Fields of Study

  • Computer science
  • Mathematics

Readers

  • Calculus or Mathematical Analysis
  • Operations Research