Nonlinear Programming Problems with Stochastic Objective Functions

O. L. Mangasarian
Additional contact information
O. L. Mangasarian: Shell Development Company, Emeryville, California

Management Science, 1964, vol. 10, issue 2, 353-359

Abstract: In many optimization problems the objective function may depend on a random set of coefficients that have some known distribution. For example, a profit function may depend on certain market conditions which can at best be estimated by a set of random variables with some given distribution. An important question to be answered in such problems is: What is the expected value of the maximum profit? On the answer to this question may hinge certain very important decisions that an organization may have to make. It may also provide good estimates of future profits. While the problem of determining the expected value of the maximum may be very difficult at times, a number of related problems, some quite important in their own right, may be considerably easier to solve and also may provide bounds for the expected value of the maximum. In this work, one upper and three lower bounds are given in terms of the solutions of related problems. In addition a convexity property for a class of parametric nonlinear programming problems is obtained. This property is also used in deriving some of the bounds.

Date: 1964
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.10.2.353 (application/pdf)

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:inm:ormnsc:v:10:y:1964:i:2:p:353-359

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().