Finite-Horizon Optimal Multiple Switching with Signed Switching Costs

Finite-Horizon Optimal Multiple Switching with Signed Switching Costs

0.00 Avg rating0 Votes
Article ID: iaor20164506
Volume: 41
Issue: 4
Start Page Number: 1432
End Page Number: 1447
Publication Date: Nov 2016
Journal: Mathematics of Operations Research
Authors:
Keywords: networks: scheduling, combinatorial optimization, stochastic processes, heuristics
Abstract:

This paper is concerned with optimal switching over multiple modes in continuous time and on a finite horizon. The performance index includes a running reward, terminal reward, and switching costs that can belong to a large class of stochastic processes. Particularly, the switching costs are modelled by right‐continuous with left‐limits processes that are quasi‐left‐continuous and can take positive and negative values. We provide sufficient conditions leading to a well known probabilistic representation of the value function for the switching problem in terms of interconnected Snell envelopes. We also prove the existence of an optimal strategy in a suitable class of admissible controls, defined iteratively in terms of the Snell envelope processes.

Reviews

Required fields are marked *. Your email address will not be published.