Skip to Main Content
Frequently Asked Questions
Submit an ETD
Global Search Box
Need Help?
Keyword Search
Participating Institutions
Advanced Search
School Logo
Files
File List
dissertation.pdf (1.03 MB)
ETD Abstract Container
Abstract Header
Polyhedral Approaches to Dynamic Decision Making under Uncertainty
Author Info
Zhang, Minjiao
Permalink:
http://rave.ohiolink.edu/etdc/view?acc_num=osu1373925091
Abstract Details
Year and Degree
2013, Doctor of Philosophy, Ohio State University, Industrial and Systems Engineering.
Abstract
In this dissertation, we conduct both theoretical and computational research on dynamic decision-making problems under uncertainty involving discrete choices. First, we study a multiechelon uncapacitated lot-sizing problem in series with intermediate demands. For the two-echelon case, we give a polynomial-time dynamic programming algorithm and establish a hierarchy between the alternative formulations. For the general multiechelon case, we present a family of valid inequalities and show its strength. Our computational results show that the multicommodity formulation is very effective in solving uncapacitated multi-item two-echelon lot-sizing problem, and the branch-and-cut algorithm is very effective in solving capacitated multi-item multiechelon lot-sizing problem. Second, we study a finite-horizon stochastic decision-making problem involving dynamic decisions under a constraint on the overall performance or reliability of the system. We formulate this problem as a joint chance-constrained program and develop a branch-and-cut method. We illustrate the efficacy of the proposed model and method on a dynamic inventory control problem with stochastic demand in which a specific service level must be met over the entire planning horizon. In the final part, we investigate a class of two-stage stochastic pure integer programs with finitely many realizations of the uncertain parameters. Based on Benders' method, we propose decomposition algorithms with parametric Gomory cuts, and demonstrate our algorithms by examples and prove the finite convergence of the proposed algorithms.
Committee
Simge Kucukyavuz (Advisor)
Nicholas Hall (Committee Member)
Marc Posner (Committee Member)
Subject Headings
Industrial Engineering
;
Operations Research
Recommended Citations
Refworks
EndNote
RIS
Mendeley
Citations
Zhang, M. (2013).
Polyhedral Approaches to Dynamic Decision Making under Uncertainty
[Doctoral dissertation, Ohio State University]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=osu1373925091
APA Style (7th edition)
Zhang, Minjiao.
Polyhedral Approaches to Dynamic Decision Making under Uncertainty.
2013. Ohio State University, Doctoral dissertation.
OhioLINK Electronic Theses and Dissertations Center
, http://rave.ohiolink.edu/etdc/view?acc_num=osu1373925091.
MLA Style (8th edition)
Zhang, Minjiao. "Polyhedral Approaches to Dynamic Decision Making under Uncertainty." Doctoral dissertation, Ohio State University, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=osu1373925091
Chicago Manual of Style (17th edition)
Abstract Footer
Document number:
osu1373925091
Download Count:
866
Copyright Info
© , all rights reserved.
This open access ETD is published by The Ohio State University and OhioLINK.