MARC보기
LDR00000nam u2200205 4500
001000000434786
00520200227105216
008200131s2019 ||||||||||||||||| ||eng d
020 ▼a 9781085664783
035 ▼a (MiAaPQ)AAI27536580
035 ▼a (MiAaPQ)umichrackham002337
040 ▼a MiAaPQ ▼c MiAaPQ ▼d 247004
0820 ▼a 658
1001 ▼a Zhang, Yiling.
24510 ▼a Convex Nonlinear and Integer Programming Approaches for Distributionally Robust Optimization of Complex Systems.
260 ▼a [S.l.]: ▼b University of Michigan., ▼c 2019.
260 1 ▼a Ann Arbor: ▼b ProQuest Dissertations & Theses, ▼c 2019.
300 ▼a 177 p.
500 ▼a Source: Dissertations Abstracts International, Volume: 81-02, Section: B.
500 ▼a Advisor: Jiang, Ruiwei
5021 ▼a Thesis (Ph.D.)--University of Michigan, 2019.
506 ▼a This item must not be sold to any third party vendors.
506 ▼a This item must not be added to any third party search indexes.
520 ▼a The primary focus of the dissertation is to develop distributionally robust optimization (DRO) models and related solution approaches for decision making in energy and healthcare service systems with uncertainties, which often involves nonlinear constraints and discrete decision variables. Without assuming specific distributions, DRO techniques solve for solutions against the worst-case distribution of system uncertainties. In the DRO framework, we consider both risk-neutral (e.g., expectation) and risk-averse (e.g., chance constraint and Conditional Value-at-Risk (CVaR)) measures. The aim is twofold: i) developing efficient solution algorithms for DRO models with integer and/or binary variables, sometimes nonlinear structures and ii) revealing managerial insights of DRO models for specific applications.We mainly focus on DRO models of power system operations, appointment scheduling, and resource allocation in healthcare. Specifically, we first study stochastic optimal power flow (OPF), where (uncertain) renewable integration and load control are implemented to balance supply and (uncertain) demand in power grids. We propose a chance-constrained OPF (CC-OPF) model and investigate its DRO variant which is reformulated as a semidefinite programming (SDP) problem. We compare the DRO model with two benchmark models, in the IEEE 9-bus, 39-bus, and 118-bus systems with different flow congestion levels. The DRO approach yields a higher probability of satisfying the chance constraints and shorter solution time. It also better utilizes reserves at both generators and loads when the system has congested flows.Then we consider appointment scheduling under random service durations with given (fixed) appointment arrival order. We propose a DRO formulation and derive a conservative SDP reformulation. Furthermore, we study a scheduling variant under random no-shows of appointments and derive tractable reformulations for certain beliefs of no-show patterns. One preceding problem of appointment scheduling in the healthcare service operations is the surgery block allocation problem that assigns surgeries to operating rooms. We derive an equivalent 0-1 SDP reformulation and a less conservative 0-1 second-order cone programming (SOCP) reformulation for its DRO model.Finally, we study distributionally robust chance-constrained binary programs (DCBP) for limiting the probability of undesirable events, under mean-covariance information. We reformulate DCBPs as equivalent 0-1 SOCP formulations under two moment-based ambiguity sets. We further exploit the submodularity of the 0-1 SOCP reformulations under diagonal and non-diagonal matrices. We derive extended polymatroid inequalities via submodularity and lifting, which are incorporated into a branch-and-cut algorithm incorporated for efficiently solving DCBPs. We demonstrate the computational efficacy and solution performance with diverse instances of a chance-constrained bin packing problem.
590 ▼a School code: 0127.
650 4 ▼a Operations research.
650 4 ▼a Industrial engineering.
690 ▼a 0546
690 ▼a 0796
71020 ▼a University of Michigan. ▼b Industrial & Operations Engineering.
7730 ▼t Dissertations Abstracts International ▼g 81-02B.
773 ▼t Dissertation Abstract International
790 ▼a 0127
791 ▼a Ph.D.
792 ▼a 2019
793 ▼a English
85640 ▼u http://www.riss.kr/pdu/ddodLink.do?id=T15494293 ▼n KERIS ▼z 이 자료의 원문은 한국교육학술정보원에서 제공합니다.
980 ▼a 202002 ▼f 2020
990 ▼a ***1008102
991 ▼a E-BOOK