Hostname: page-component-cd9895bd7-dk4vv Total loading time: 0 Render date: 2024-12-25T08:07:07.835Z Has data issue: false hasContentIssue false

Stochastic non-linear programming

Published online by Cambridge University Press:  09 April 2009

M. A. Hanson
Affiliation:
Department of Statistics, University of New South Wales
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Although many varied techniques have been proposed for handling deterministic non-linear programming problems there apperars to have been little success in solving the more realistic problem of stochastic non-linear programming, despite the many results that have been obtained for stochastic linear programming. In this paper the stochastic non-linear problem is treated by means of an adaptation of a method used by Berkovitz [1] in obtaining an exiatence theorem for a type of inequality constrained variational problem involving one independent variable. The stochastic programming problem of course involves many independent variables. Necessary conditions are obtained for the existence of a solution of a fairly general type of non-linear problem, and these conditions are shown to be also sufficient for the convex problem. A duality theorem is given for the latter problem.

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1964

References

[1]Berkovitz, L. D., Variational Methods in Problems of Control and Programming, J. Math. Anal. App. 3 (1961) 145169.CrossRefGoogle Scholar
[2]Kuhn, H.W., and Tucker, A. W., Non-Linear Programming, Proc. Second Berkeley Symp. on Math. Stats. and Prob., Univ. Calif. Press 1951.Google Scholar
[3]Bliss, G. A., Lectures on the Calculus of Variations, University of Chicago Press, Phoenix Edition 1961.Google Scholar