Welcome to the InfoSci Platform
Reference Hub1
Polynomial Approximation for Two Stage Stochastic Programming with Separable Objective

Polynomial Approximation for Two Stage Stochastic Programming with Separable Objective

Lijia Chen, Dustin J. Banet
Copyright: © 2010 |Volume: 1 |Issue: 3 |Pages: 14
ISSN: 1947-9328|EISSN: 1947-9336|EISBN13: 9781609609832|DOI: 10.4018/joris.2010070105
Cite Article Cite Article

MLA

Chen, Lijia, and Dustin J. Banet. "Polynomial Approximation for Two Stage Stochastic Programming with Separable Objective." IJORIS vol.1, no.3 2010: pp.75-88. http://doi.org/10.4018/joris.2010070105

APA

Chen, L. & Banet, D. J. (2010). Polynomial Approximation for Two Stage Stochastic Programming with Separable Objective. International Journal of Operations Research and Information Systems (IJORIS), 1(3), 75-88. http://doi.org/10.4018/joris.2010070105

Chicago

Chen, Lijia, and Dustin J. Banet. "Polynomial Approximation for Two Stage Stochastic Programming with Separable Objective," International Journal of Operations Research and Information Systems (IJORIS) 1, no.3: 75-88. http://doi.org/10.4018/joris.2010070105

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

In this paper, the authors solve the two stage stochastic programming with separable objective by obtaining convex polynomial approximations to the convex objective function with an arbitrary accuracy. Our proposed method will be valid for realistic applications, for example, the convex objective can be either non-differentiable or only accessible by Monte Carlo simulations. The resulting polynomial is constructed by Bernstein polynomial and norm approximation models. At a given accuracy, the necessary degree of the polynomial and the replications are properly determined. Afterward, the authors applied the first gradient type algorithms on the new stochastic programming model with the polynomial objective, resulting in the optimal solution being attained.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.