Nothing
The numerical treatment of optimal switching problems in a finite time setting when the state evolves as a controlled Markov chain consisting of a uncontrolled continuous component following linear dynamics and a controlled Markov chain taking values in a finite set. The reward functions are assumed to be convex and Lipschitz continuous in the continuous state. The action set is finite.
Package details |
|
|---|---|
| Author | Jeremy Yee and Juri Hinz |
| Maintainer | Jeremy Yee <jeremyyee@outlook.com.au> |
| License | GPL |
| Version | 1.8 |
| Package repository | View on CRAN |
| Installation |
Install the latest version of this package by entering the following in R:
|
Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.