✨
AI Summary & Key Takeaways
AI Insight⚡ TL;DR(Too Long; Didn't Read)
This problem is solved by means of the Snell envelope of processes
📌 3 Key Takeaways
🎯
Objective & Hypothesis:This work studies the problem of optimal multiple switching in finite horizon, when the switching costs functions are continous and belong to class D.
📊
Key Findings & Data:This work studies the problem of optimal multiple switching in finite horizon, when the switching costs functions are continous and belong to class D.
💡
Conclusion & Impact:This problem is solved by means of the Snell envelope of processes
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Real options · snell envelope · stopping time
Abstract
This work studies the problem of optimal multiple switching in finite horizon, when the switching costs functions are continous and belong to class D. This problem is solved by means of the Snell envelope of processes
🔖
Cite This Article
Hassairi, I. (2017). An optimal multiple switching problem under weak assumptions. Communication in Mathematical Modeling and Applications, Cilt: 2 Sayı: 2, 18–22. https://ajindex.com/articles/984297