國立虎尾科技大學 |

Decomposition Algorithms in Stochastic Integer Programming : = Applications and Computations.

紀錄類型:	書目-語言資料,手稿 : Monograph/item
正題名/作者:	Decomposition Algorithms in Stochastic Integer Programming :/
其他題名:	Applications and Computations.
作者:	Saleck Pay, Babak.
面頁冊數:	1 online resource (148 pages)
附註:	Source: Dissertation Abstracts International, Volume: 79-01(E), Section: B.
Contained By:	Dissertation Abstracts International79-01B(E).
標題:	Operations research. -
電子資源:	click for full text (PQDT)
ISBN:	9780355205572

Decomposition Algorithms in Stochastic Integer Programming : = Applications and Computations.
Saleck Pay, Babak.

Decomposition Algorithms in Stochastic Integer Programming :Applications and Computations. - 1 online resource (148 pages)

Source: Dissertation Abstracts International, Volume: 79-01(E), Section: B.

Thesis (Ph.D.)

Includes bibliographical references

In this dissertation we focus on two main topics. Under the first topic, we develop a new framework for stochastic network interdiction problem to address ambiguity in the defender risk preferences. The second topic is dedicated to computational studies of two-stage stochastic integer programs. More specifically, we consider two cases. First, we develop some solution methods for two-stage stochastic integer programs with continuous recourse; second, we study some computational strategies for two-stage stochastic integer programs with integer recourse.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2018

Mode of access: World Wide Web

ISBN: 9780355205572Subjects--Topical Terms:

573517
Operations research.
Index Terms--Genre/Form:

554714
Electronic books.

Decomposition Algorithms in Stochastic Integer Programming : = Applications and Computations.
LDR:04429ntm a2200373Ki 4500 001 910825
005 20180517112611.5
006 m o u
007 cr mn||||a|a||
008 190606s2017 xx obm 000 0 eng d
020 $a 9780355205572
035 $a (MiAaPQ)AAI10620143
035 $a (MiAaPQ)vcu:11708
035 $a AAI10620143
040 $a MiAaPQ $b eng $c MiAaPQ
099 $a TUL $f hyy $c available through World Wide Web
100 1 $a Saleck Pay, Babak. $3 1182300
245 1 0 $a Decomposition Algorithms in Stochastic Integer Programming : $b Applications and Computations.
264 0 $c 2017
300 $a 1 online resource (148 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertation Abstracts International, Volume: 79-01(E), Section: B.
500 $a Adviser: Yongjia Song.
502 $a Thesis (Ph.D.) $c Virginia Commonwealth University $d 2017.
504 $a Includes bibliographical references
520 $a In this dissertation we focus on two main topics. Under the first topic, we develop a new framework for stochastic network interdiction problem to address ambiguity in the defender risk preferences. The second topic is dedicated to computational studies of two-stage stochastic integer programs. More specifically, we consider two cases. First, we develop some solution methods for two-stage stochastic integer programs with continuous recourse; second, we study some computational strategies for two-stage stochastic integer programs with integer recourse.
520 $a We study a class of stochastic network interdiction problems where the defender has incomplete (ambiguous) preferences. Specifically, we focus on the shortest path network interdiction modeled as a Stackelberg game, where the defender (leader) makes an interdiction decision first, then the attacker (follower) selects a shortest path after the observation of random arc costs and interdiction effects in the network. We take a decision-analytic perspective in addressing probabilistic risk over network parameters, assuming that the defender's risk preferences over exogenously given probabilities can be summarized by the expected utility theory. Although the exact form of the utility function is ambiguous to the defender, we assume that a set of historical data on some pairwise comparisons made by the defender is available, which can be used to restrict the shape of the utility function. We use two different approaches to tackle this problem. The first approach conducts utility estimation and optimization separately, by first finding the best fit for a piecewise linear concave utility function according to the available data, and then optimizing the expected utility. The second approach integrates utility estimation and optimization, by modeling the utility ambiguity under a robust optimization framework following [4] and [44]. We conduct extensive computational experiments to evaluate the performances of these approaches on the stochastic shortest path network interdiction problem.
520 $a In third chapter, we propose partition-based decomposition algorithms for solving two-stage stochastic integer program with continuous recourse. The partition-based decomposition method enhance the classical decomposition methods (such as Benders decomposition) by utilizing the inexact cuts (coarse cuts) induced by a scenario partition. Coarse cut generation can be much less expensive than the standard Benders cuts, when the partition size is relatively small compared to the total number of scenarios. We conduct an extensive computational study to illustrate the advantage of the proposed partition-based decomposition algorithms compared with the state-of-the-art approaches. In chapter four, we concentrate on computational methods for two-stage stochastic integer program with integer recourse. We consider the partition-based relaxation framework integrated with a scenario decomposition algorithm in order to develop strategies which provide a better lower bound on the optimal objective value, within a tight time limit.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2018
538 $a Mode of access: World Wide Web
650 4 $a Operations research. $3 573517
650 4 $a Industrial engineering. $3 679492
655 7 $a Electronic books. $2 local $3 554714
690 $a 0796
690 $a 0546
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a Virginia Commonwealth University. $b Mathematical Sciences. $3 1182301
773 0 $t Dissertation Abstracts International $g 79-01B(E).
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10620143 $z click for full text (PQDT)