Solving some Multistage Robust Decision Problems with Huge Implicitly Defined Scenario Trees

Authors

  • Michel Minoux University Paris 6

Abstract

This paper describes models and solution algorithms for solving robust multistage decision problems under a special type of uncertainty model referred to here as parsimonious. The main interest of such a model is to provide compact representations of potentially huge scenario trees, leading to efficient dynamic programming-based computation of optimal strategies. Also, contrary to the case of most previously published work on similar problems, which essentially require an independence assumption (on the occurrences of uncertain events in different time periods ) our model handles - and properly exploits - some form of dependence over time via a concept of uncertainty budget constraints. Examples of application are discussed including optimal inventory management and the search for robust shortest paths in directed acyclic graphs. Computational results illustrating and validating the proposed approach are also presented.

Author Biography

Michel Minoux, University Paris 6

Departement of Computer Sc, Professor

Downloads

Published

2009-02-03

How to Cite

Minoux, M. (2009). Solving some Multistage Robust Decision Problems with Huge Implicitly Defined Scenario Trees. Algorithmic Operations Research, 4(1), Pages 1 – 18. Retrieved from https://journals.lib.unb.ca/index.php/AOR/article/view/2728

Issue

Vol. 4 No. 1 (2009)

Section

Articles

License

The copyright of the submitted article is hereby transferred to “Preeminent Academic Facets Inc. (the “publisher”) to the extent possible by the laws in the respective countries of the author(s). The author(s) retain all other rights including the following: 1. Any patents and trademark rights. 2. Right to post a pre-print version of the paper on the author’s personal website which is not used for commercial purposes. The author(s) warrant that the work is original, it has not been published elsewhere, it is not currently under consideration for publication in any form, and it does not infringe any copyright laws. The signing author or agent further warrants that all authors, if applicable, have been informed of the terms of this agreement and obtained the approval and authority to sign the agreement.