Abstract

Sample-path optimization is a method for optimizing limit functions occurring in stochastic modeling problems, such as steady-state functions in discrete-event dynamic systems. It is closely related to retrospective optimization techniques and to M-estimation. The method has been computationally tested elsewhere on problems arising in production and in project planning, with apparent success. In this paper we provide a mathematical justification for sample-path optimization by showing that under certain assumptions—which hold for the problems just mentioned—the method will almost surely find a point that is, in a specified sense, sufficiently close to the set of optimizers of the limit function.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.