Abstract
In this paper, a continuous time optimal stopping problem with general constraints is investigated. The Lagrangian programming problem associated with the original optimal stopping problem is given. Furthermore in order to use convex analysis and deterministic optimization theory, the concept of a weak optimal tactic in addition to an optimal tactic is introduced. Under the non–atomic probability measure and the condition corresponding to the Slater condition in the nonlinear programming theory, the relation between an optimal tactic and a weak optimal tactic and the existence of an optimal tactic are shown. Finally by using perturbing the original optimal stopping problem, the Lagrangian duality theory is developed.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
