Towards Implementable Nonlinear Stochastic Programming

L. Sakalauskas ()
Additional contact information
L. Sakalauskas: Institute of Mathematics and Informatics

A chapter in Coping with Uncertainty, 2006, pp 257-279 from Springer

Abstract: Abstract The concept of implementable nonlinear stochastic programming by finite series of Monte-Carlo samples is surveyed addressing the topics related with stochastic differentiation, stopping rules, conditions of convergence, rational setting of the parameters of algorithms, etc. Our approach distinguishes itself by treatment of the accuracy of solution in a statistical manner, testing the hypothese of optimality according to statistical criteria, and estimating confidence intervals of the objective and constraint functions. The rule for adjusting the Monte-Carlo sample size is introduced which ensures the convergence with the linear rate and enables us to solve the stochastic optimization problem using a reasonable number of Monte-Carlo trials. The issues of implementation of the developed approach in optimal decision making, portfolio optimization, engineering are considered, too.

Keywords: stochastic programming; Monte-Carlo method; stopping rules; convergence (search for similar items in EconPapers)
Date: 2006
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:lnechp:978-3-540-35262-4_15

Ordering information: This item can be ordered from
http://www.springer.com/9783540352624

DOI: 10.1007/3-540-35262-7_15

Access Statistics for this chapter

More chapters in Lecture Notes in Economics and Mathematical Systems from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().