We show that, under certain conditions, instead of solving stochastic capacity expansion problems, we will obtain the same optimal solution by solving deterministic equivalent problems. Since only the first decision must be implemented immediately, knowing the optimal first decision is nearly as good as knowing the entire optimal sequences. Hence if we can solve the problem with 'big enough' finite horizon such that the first decision remains optimal for longer than this finite horizon, then we identify the 'big enough' finite horizon as forecast horizon. The forward dynamic programming recursion can be used to solve a finite horizon problem. An efficient forward algorithm has been developed to obtain the first optimal decision and forecast horizon. A heuristic algorithm also has been derived to prove an initial decision is within known error bound of the optimal first decision. Several examples are examined to investigate how a decision will be affected by randomness. (Abstract shortened with permission of author.)
| Identifer | oai:union.ndltd.org:arizona.edu/oai:arizona.openrepository.com:10150/292045 |
| Date | January 1987 |
| Creators | Huang, Chih-yüan |
| Contributors | Higle, Julia L. |
| Publisher | The University of Arizona. |
| Source Sets | University of Arizona |
| Language | en_US |
| Detected Language | English |
| Type | text, Thesis-Reproduction (electronic) |
| Rights | Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author. |
Page generated in 0.002 seconds