Average optimality in infinite horizon optimization.
dc.contributor.author | Park, Yunsun | en_US |
dc.contributor.advisor | Smith, Robert L. | en_US |
dc.contributor.advisor | Bean, James C. | en_US |
dc.date.accessioned | 2014-02-24T16:18:59Z | |
dc.date.available | 2014-02-24T16:18:59Z | |
dc.date.issued | 1990 | en_US |
dc.identifier.other | (UMI)AAI9034493 | en_US |
dc.identifier.uri | http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:9034493 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/104061 | |
dc.description.abstract | We study three classes of infinite horizon optimization problems: the undiscounted homogeneous Markov decision process, the undiscounted nonhomogeneous Markov decision process, and the undiscounted deterministic problem. To solve the undiscounted homogeneous Markov decision process, we give a sufficient condition for the existence of a stationary optimal strategy using the Doeblin coefficient. We also compare this condition with others in the literature. This condition allows transformation of the original problem into an equivalent discounted homogeneous Markov decision process for which a solution method is known. For the undiscounted nonhomogeneous Markov decision process, it is known that an algorithmically optimal strategy is average optimal. Based on it, we present two solution methodologies using transformations into equivalent problems. Both procedures first transform the original problem into an equivalent discounted nonhomogeneous Markov decision process using the Doeblin coefficient. Then, the first (second) procedure transforms it into an equivalent discounted deterministic problem (discounted homogeneous Markov decision process) whose solution method is known. For undiscounted deterministic problems, it is not known whether an algorithmically optimal strategy is average optimal or not. We present sufficient conditions for it, and apply the result to a production planning problem and a Markov decision process. | en_US |
dc.format.extent | 127 p. | en_US |
dc.subject | Engineering, Industrial | en_US |
dc.title | Average optimality in infinite horizon optimization. | en_US |
dc.type | Thesis | en_US |
dc.description.thesisdegreename | PhD | en_US |
dc.description.thesisdegreediscipline | Industrial and Operations Engineering | en_US |
dc.description.thesisdegreegrantor | University of Michigan, Horace H. Rackham School of Graduate Studies | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/104061/1/9034493.pdf | |
dc.description.filedescription | Description of 9034493.pdf : Restricted to UM users only. | en_US |
dc.owningcollname | Dissertations and Theses (Ph.D. and Master's) |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.