A MIN-MAX REGRET ROBUST OPTIMIZATION APPROACH FOR LARGE SCALE FULL FACTORIAL SCENARIO DESIGN OF DATA UNCERTAINTY

Size: px
Start display at page:

Download "A MIN-MAX REGRET ROBUST OPTIMIZATION APPROACH FOR LARGE SCALE FULL FACTORIAL SCENARIO DESIGN OF DATA UNCERTAINTY"

Transcription

1 A MIN-MAX REGRET ROBST OPTIMIZATION APPROACH FOR ARGE SCAE F FACTORIA SCENARIO DESIGN OF DATA NCERTAINTY Travat Assavapokee Department of Industra Engneerng, nversty of Houston, Houston, Texas , SA, travat.assavapokee@ma.uh.edu Matthew J. Reaff Department of Chemca and Bomoecuar Engneerng, Georga Insttute of Technoogy, Atanta, Georga, , SA, matthew.reaff@chbe.gatech.edu Jane C. Ammons Department of Industra and Systems Engneerng, Georga Insttute of Technoogy, Atanta, Georga, , SA, ane.ammons@sye.gatech.edu Ths paper presents a three-stage optmzaton agorthm for sovng two-stage robust decson makng probems under uncertanty wth mn-max regret obectve. The structure of the frst stage probem s a genera mxed nteger (bnary) near programmng mode wth a specfc mode of uncertanty that can occur n any of the parameters, and the second stage probem s a near programmng mode. Each uncertan parameter can take ts vaue from a fnte set of rea numbers wth unknown probabty dstrbuton ndependenty of other parameters settngs. Ths structure of parametrc uncertanty s referred to n ths paper as the fu-factora scenaro desgn of data uncertanty. The proposed agorthm s shown to be effcent for sovng arge-scae mn-max regret robust optmzaton probems wth ths structure. The agorthm coordnates three mathematca programmng formuatons to sove the overa optmzaton probem. The man contrbutons of ths paper are the theoretca deveopment of the three-stage optmzaton agorthm, and mprovng ts computatona performance through mode transformaton, decomposton, and pre-processng technques based on anayss of the probem structure. The proposed agorthm s apped to sove a number of robust facty ocaton probems under ths structure of parametrc uncertanty. A resuts ustrate sgnfcant mprovement n computaton tme of the proposed agorthm over exstng approaches. Keywords: Robust optmzaton, Scenaro based decson makng, Decson makng under uncertanty, Mn-max regret robust approach, Fu-factora scenaro desgn

2 . Introducton In ths paper we address the two-stage decson makng probem under uncertanty, where the uncertanty can appear n the vaues of any parameters of a genera mxed nteger near programmng formuaton. T T max c x + q y x, y s.t. Wy h + Tx Wy = h + Tx x x {0,}, y 0 In ths paper, ower case etters wth vector cap such as x represent vectors and the notaton x represents the th eement of the vector x. The correspondng bod upper case etters such as W denote matrces and the notaton W represents the (, ) th eement of the matrx W. In the formuaton, the vector x represents the frst-stage bnary decsons that are made before the reazaton of uncertanty and the vector y represents the second-stage contnuous decsons that are made after the uncertanty s resoved. It s worth emphaszng that many practca two-stage decson probems can often be represented by ths mathematca formuaton. For exampe n a facty ocaton probem under uncertanty n a gven network G = ( N, A), the frst-stage decson x {0,} N represents the decson of whether or not a facty w be ocated at each node n the network G. These facty ocaton decsons are consdered as ong-term decsons and have to be made before the reazaton of uncertan parameters n the mode. Once a vaues of uncertan parameters n the mode are reazed, the second-stage decson y 0 can be made. These second-stage decsons represent the fow of each matera transported on each arc n the network G. In ths paper, we consder the probem such that each uncertan parameter n the mode s restrcted to ndependenty take ts vaue from a fnte set of rea numbers wth unknown probabty dstrbuton. Ths captures stuatons where decson makers have to make the ong term decson under uncertanty when there s very mted or no hstorca nformaton about the probem and the ony avaabe nformaton s the possbe vaue of each uncertan parameter based on expert opnon. For exampe, expert opnon may gve the decson makers three possbe vaues for a gven uncertan parameter based on optmstc, average, and pessmstc estmatons. nder ths stuaton, decson makers cannot search for the frststage decsons wth the best ong run average performance, because there s a ack of knowedge about the probabty dstrbuton of the probem parameters. Instead, decson

3 makers are assumed to requre frst-stage decsons that perform we across a possbe nput scenaros: robust frst-stage decsons usng a devaton robustness defnton (mn-max regret robust souton) defned by Kouves and Yu (997). Two-stage mn-max regret robust optmzaton addresses optmzaton probems where some of the mode parameters are uncertan at the tme of makng the frst stage decsons. The crteron for the frst stage decsons s to mnmze the maxmum regret between the optma obectve functon vaue under perfect nformaton and the resutng obectve functon vaue under the robust decsons over a possbe reazatons of the uncertan parameters (scenaros) n the mode. The work of Kouves and Yu (997) summarzes the state-of-the-art n mn-max regret optmzaton up to 997 and provdes a comprehensve dscusson of the motvaton for the mn-max regret approach and varous aspects of appyng t n practce. Ben-Ta and Nemrovsk (998, 999, 000) address robust soutons (mnmax/max-mn obectve) by aowng the uncertanty sets for the data to be epsods, and propose effcent agorthms to sove convex optmzaton probems under data uncertanty. However, as the resutng robust formuatons nvove conc quadratc probems, such methods cannot be drecty apped to dscrete optmzaton. Mausser and aguna (998, 999a, 999b) presents the mxed nteger near programmng formuaton to fndng the maxmum regret scenaro for a gven canddate robust souton of one-stage near programmng probems under nterva data uncertanty for obectve functon coeffcents. They aso deveop an teratve agorthm for fndng the robust souton of one-stage near programmng probems under reatve robust crteron and a heurstc agorthm under the mn-max absoute regret crteron wth the smar type of uncertanty. Averbakh (000, 00) shows that poynoma sovabty s preserved for a specfc dscrete optmzaton probem (seectng p eements of mnmum tota weght out of a set of m eements wth uncertanty n weghts of the eements) when each weght can vary wthn an nterva under the mn-max regret robustness defnton. Bertsmas and Sm (003, 004) propose an approach to address data uncertanty for dscrete optmzaton and network fow probems that aows the degree of conservatsm of the souton (mn-max/max-mn obectve) to be controed. They show that the robust counterpart of an NP-hard α -approxmabe 0- dscrete optmzaton probem remans α -approxmabe. They aso propose an agorthm for robust network fows that soves the robust counterpart by sovng a poynoma number of nomna mnmum cost fow probems n a modfed network. Assavapokee et a. (007a) present a scenaro reaxaton agorthm for sovng scenaro-based mn-max regret and mnmax reatve regret robust optmzaton probems for the mxed nteger near programmng 3

4 (MIP) formuaton. Assavapokee et a. (007b) present a mn-max regret robust optmzaton agorthm for two-stage decson makng probems under nterva data uncertanty n parameter vectors ch,, h and parameter matrxes T and T of the MIP formuaton. They aso demonstrate a counter-exampe ustratng the nsuffcency of the robust souton obtaned by ony consderng scenaros generated by a combnatons of upper and ower bounds of each uncertan parameter for the nterva data uncertanty case. Ths resut s aso true for the fu factora scenaro desgn of data uncertanty case. As of our best knowedge, there exsts no agorthm for sovng two-stage mn-max regret robust decson makng probems under nterva data uncertanty n parameter vector q and parameter matrxes W and W of the genera MIP formuaton. Because the proposed agorthm n ths paper can sove the smar robust two-stage probems under fu factora scenaro desgn of data uncertanty n any parameter of the genera MIP formuaton, the proposed agorthm can aso be used as one aternatve to approxmatey sove the devaton robust two-stage probems under nterva data uncertanty n parameter vector q and parameter matrxes W and W of the genera MIP formuaton by repacng the possbe range of each uncertan parameter wth a fnte set of rea vaues. Tradtonay, a mn-max regret robust souton can be obtaned by sovng a scenarobased extensve form mode of the probem, whch s aso a mxed nteger near programmng mode. The extensve form mode s expaned n deta n secton. The sze of ths extensve form mode grows rapdy wth the number of scenaros used to represent uncertanty, as does the requred computaton tme to fnd optma soutons. nder fufactora scenaro desgn, the number of scenaros grows exponentay wth the number of uncertan parameters and the number of possbe vaues for each uncertan parameter. For exampe, a probem wth 0 uncertan parameters each wth 3 possbe vaues has over 3.4 bon scenaros. Sovng the extensve form mode drecty obvousy s not the effcent way for sovng ths type of robust decson probems even wth the use of Benders decomposton technque (J.F. Benders, 96). For exampe, f the probem contans 3.4 bon scenaros and a sub-probem of Benders decomposton can be soved wthn 0.0 second, the agorthm woud requre approxmatey one year of computaton tme per teraton to generate a set of requred cuts. Because of the faure of the extensve form mode and the Benders decomposton agorthm for sovng a arge scae probem of ths type, the three-stage optmzaton agorthm s proposed n ths paper for sovng ths type of robust optmzaton probems 4

5 under mn-max regret obectve. The agorthm s desgned expcty to effcenty hande a combnatora szed set of possbe scenaros. The agorthm sequentay soves and updates a reaxaton probem unt both feasbty and optmaty condtons of the overa probem are satsfed. The feasbty and optmaty verfcaton steps nvove the use of b-eve programmng, whch coordnates a Stackeberg game (Von Stackeberg, 943) between the decson envronment and decson makers, whch s expaned n deta n secton. The agorthm s proven to termnate at an optma mn-max regret robust souton f one exsts n a fnte number of teratons. Pre-processng procedures, probem transformaton steps, and decomposton technques are aso derved to mprove the computatona tractabty of the agorthm. In the foowng secton, we present the theoretca methodoogy of the proposed agorthm. The performance of the proposed agorthm s demonstrated through a number of facty ocaton probems n secton 3. A resuts ustrate mpressve computatona performance of the agorthm on exampes of practca sze.. Methodoogy Ths secton begns by revewng key concepts of scenaro based mn-max regret robust optmzaton. The methodoogy of the proposed agorthm s then summarzed and expaned n deta, and each of ts three stages s specfed. The secton concudes wth the proof that the proposed agorthm aways termnates at the mn-max regret robust optma souton f one exsts n a fnte number of teratons. We address the probem where the basc components of the mode s uncertanty are represented by a fnte set of a possbe scenaros of nput parameters, referred as the scenaro set Ω. The probem contans two types of decson varabes. The frst stage varabes mode bnary choce decsons, whch have to be made before the reazaton of uncertanty. The second stage decsons are contnuous recourse decsons, whch can be made after the reazaton of uncertanty. et vector x denote bnary choce decson varabes and et vector y denote contnuous recourse decson varabes and et c, q, h, h, W, W, T, and T denote mode parameters settng for each scenaro Ω. If the reazaton of mode parameters s known to be scenaro a pror, the optma choce for the decson varabes x and y can be obtaned by sovng the foowng mode (). 5

6 T T O = max cx + qy x, y s.t. W y T x h W y T x = h x {0,} and 0 x y When parameters uncertanty exsts, the search for the mn-max regret robust souton comprses fndng bnary choce decsons, x, such that the functon max( O Z ( x)) s Z x = q y W y h + T x W y = h + T x + c x. It s aso mnmzed where ( ) max { T, } T y 0 worth mentonng that the vaue of O Z ( x) s nonnegatve for a scenaros Ω. In the case when the scenaro set Ω s a fnte set, the optma choce of decson varabes x under mn-max regret obectve can be obtaned by sovng the foowng mode (). mn δ, xy, s.t. δ T T δ O qy cx W T y x h Ω y T x = h W y 0 x {0,} x Ths mode () s referred to as the extensve form mode of the probem. If an optma souton for the mode () exsts, the resutng bnary souton s the optma settng of the frst stage decson varabes x. nfortunatey, the sze of the extensve form mode can become unmanageaby arge as does the requred computaton tme to fnd the optma settng of x. Because of the faure of the extensve form mode and the Benders decomposton agorthm for sovng a arge scae probem of ths type, a new agorthm whch can effectvey overcome these mtatons of these approaches s proposed n the foowng subsecton. A key nsght of ths agorthm s to recognze that, for a fntey arge set of a possbe scenaros, t s possbe to dentfy a smaer subset of mportant scenaros that actuay need to be consdered as part of the teraton scheme to sove the overa optmzaton probem wth the use of b-eve programmng. Ω () () Mn-Max Regret Robust Agorthm for Fu-Factora Scenaro Desgn We start ths secton by defnng some addtona notatons whch are extensvey used n ths secton of the paper. The uncertan parameters n the mode () can be cassfed nto 6

7 eght maor types. These uncertan parameters can be combned nto a random vector ξ = ( cqh,,, h, T, T, W, W ). In ths paper, we assume that each component of ξ can ndependenty take ts vaues from a fnte set of rea numbers wth unknown probabty dstrbuton. Ths means that for any eement p of the vector ξ, p can take any vaue from the set of { p(), p(),..., p ( p) } such that p() < p() <... < p( p) where the notaton p denotes the number of possbe vaues for the parameter p. For smpcty, notatons p = p() and p = p w be used to represent the ower bound and upper bound vaues of the parameter ( p) p ξ. The scenaro set Ω s generated by a possbe vaues of the parameter vector ξ. et us defne ξ( ) as the specfc settng of the parameter vector ξ under scenaro Ω and Ξ= { ξ ( ) Ω } as the support of the random vector ξ. As descrbed beow, we propose a three-stage optmzaton agorthm for sovng the mn-max regret robust optmzaton probem under scenaro set Ω that utzes the creatve dea based on the foowng nequaty where Ω Ω. = max{ O Z( x)} mn max{ O Z( x)} mn max{ O Z( x)} = Ω x Ω x Ω In the consdered probem, we woud ke to sove the mdde probem ( mn max{ O Z ( x)} ), whch s ntractabe because Ω s extremey arge. Instead, we x Ω successvey sove the eft and rght probems for and. The eft probem s soved by utzng a reformuaton as a tractabe B-eve mode. The rght probem s soved by utzng the Benders decomposton based on the fact that Ω s reatvey sma compared to Ω. The proposed agorthm proceeds as foows. Three-Stage Agorthm Step 0: (Intazaton) Choose a subset Ω Ω and set =, and = 0. et x opt denote the ncumbent souton. Determne the vaue of ε 0, whch s a pre-specfed toerance. Step : (Sovng the Reaxaton Probem and Optmaty Check) Sove the mode () to obtan O Ω. If the mode () s nfeasbe for any scenaro n the scenaro set Ω, the agorthm s termnated; the probem s -posed. 7

8 Otherwse the optma obectve functon vaue to the mode () for scenaro s desgnated as O. By usng the nformaton on O Ω, Appy the Benders decomposton agorthm expaned n deta n Secton. to sove the smaer verson of the mode () by consderng ony the scenaro set Ω nstead of Ω. Ths smaer verson of the mode () s referred to as the reaxed mode () n ths paper. If the reaxed mode () s nfeasbe, the agorthm s termnated wth the confrmaton that no robust souton exsts for the probem. Otherwse, set x x whch s an optma souton from the reaxed mode () and set = Ω = max{ O Z( x )} Ω If { - } ε, x opt whch s the optma obectve functon vaue of the reaxed mode (). s the gobay ε-optma robust souton and the agorthm s termnated. Otherwse the agorthm proceeds to Step. Step : (Feasbty Check) Sove the B-eve- mode descrbed n deta n Secton. by usng the x Ω nformaton from Step. If the optma obectve functon vaue of the Beve- mode s nonnegatve (feasbe case), proceed to Step 3. Otherwse (nfeasbe case), Ω Ω { } where s the nfeasbe scenaro for x Ω generated by the B-eve- mode n ths teraton and return to Step. Step 3: (Generate the Scenaro wth Maxmum Regret Vaue for x Ω and Optmaty Check) Sove the B-eve- mode specfed n deta n Secton.3 by usng the x Ω nformaton from Step. et arg m ax{ O Z ( x )} and = max{ O Z ( x )} generated by the Ω Ω B-eve- mode respectvey n ths teraton. If <, then set xopt = x Ω and set =. If { - } ε, x opt s the gobay ε-optma robust souton and the agorthm s termnated. Otherwse, Ω Ω { } and return to Step. We defne the agorthm Steps,, and 3 as the frst, second, and thrd stages of the agorthm respectvey. Fgure ustrates a schematc structure of ths agorthm. Each of the three stages of the agorthm s detaed n the foowng subsectons. Ω Ω 8

9 O ptm aty check and G enerate x arg m n m ax{ O Z ( x )} Ω Frst Stage x Ω = mn max{ O Z ( x )} x Ω x Ω and Second Stage and Thrd Stage O ptm aty check and G enerate arg m ax{ O Z ( x Ω )} Ω = mn{max{ O Z ( x )}, } Ω (B-eve- mode). Ω Feasbty check (B-eve- mode) x Ω and Fgure : Schematc Structure of the Agorthm... The Frst Stage Agorthm = The purposes of the frst stage are () to fnd arg mn{ max{ } xω O Z( x)} mn max{ O Z( x)} x Ω x Ω, () to fnd, and (3) to determne f the agorthm has dscovered an optma robust souton for the probem. The frst stage utzes two man optmzaton modes: the mode () and the reaxed mode (). The mode () s used to cacuate O for a scenaros Ω Ω. If the mode () s nfeasbe for any scenaro Ω, the agorthm s termnated wth the concuson that there exsts no robust souton to the probem. Otherwse, once a requred vaues of O Ω are obtaned, the reaxed mode () s soved. In ths paper, we recommend sovng the reaxed mode () by utzng the Benders decomposton technques as foow. The reaxed mode () has the foowng structure. T T mn ( max ( O cx qy)) xy, Ω s.t. W y x h T W y T x = h Ω y 0 x x {0,} Ths mode can aso be rewrtten as T mn f( x) where f( x) = max( O Q( x) cx) and x Ω { 0,} x T Q ( x) = max q y y 0 s.t. W y h + T x ( π,, x ) W y = h + T x ( π ),, x 9

10 where the symbos n parenthess next to the constrants denote to the correspondng dua varabes. The resuts from the foowng two emmas are used to generate the master probem and sub probems of the Benders decomposton for the reaxed mode (). emma : f ( x ) s a convex functon on x. Proof: f x O Q x c x s a convex functon on x because of the foowng reasons. () Q ( x) T ( ) = max( ( ) ) Ω and c T x are concave functons on x ; () ( )concave functon s a convex functon; (3) Summaton of convex functons s aso a convex functon; and (4) Maxmum functon of convex functons s aso a convex functon. T ( ) T ( ) T f( x ( )) where T T T emma : ( c() π, (), x() π ( ), (), x() ( ) ) T () argmax{ O c x() Q( x())} Ω, f ( x ( )) s sub-dfferenta of the functon f at x() and ( π, ( ), x( ), π, ( ), x( ) ) s the optma souton of the dua probem n the cacuaton of Q ( x) when = ( ) and x = x ( ). Proof: From duaty theory: T T Q() ( x( )) = ( π, (), x ()) ( h () + T x( )) + ( π (), (), x ()) ( h () + T() x( )) T T and Q() ( x) ( π, (), x ()) ( h () + T x) + ( π (), (), x ()) ( h () + T() x) for arbtrary x. Thus, Q () ( x ) Q () ( x ( )) ( T T π, ( ), x( ) ) T ( x x ( )) + ( π (), ( ), x( ) ) T() ( x x ( )) and ( ) T T O() Q() x O() Q () ( x ( )) (( π, (), x() ) T + ( () π, (), x() ) T() )( x x ( )). T c x = c x() c ( x x()) and f ( x) = max( O Q ( x) c x), T T T From () () () Ω T f ( x) O() Q() ( x) c() x T T T T () () () () π, (), x() T π (), (), x() T() ( ) O Q ( x ( )) c x ( ) + c ( ) ( ) ( x x ( )) T From () argmax{ O c x() Q ( x())}, f ( x) Ω f ( x ( )) + c ( ) ( ) ( x x ( )) T T T ( () π, (), x() T π (), (), x() T() ) Based on the resuts of the emma and, we brefy state the genera Benders decomposton agorthm as t appes to the reaxed mode (). Benders Decomposton Agorthm for the Reaxed Mode (): Step 0: Set ower and upper bounds b = and ub = + respectvey. Set the teraton counter k = 0. et 0 Y ncudes a cuts generated from a prevous teratons of the 0

11 proposed three-stage agorthm. A these cuts are vad because the proposed agorthm aways add more scenaros to the set Ω and ths causes the feasbe regon of the reaxed mode () to shrnk from one teraton to the next. et x denote the ncumbent souton. Step : Sove the master probem b = mn θ θ, x T s.t. θ a x+ b =,,..., k k ( θ, x) Y If the master probem s nfeasbe, stop and report that the reaxed mode () s nfeasbe. Otherwse, update k = k + and et x( k) be an optma souton of the master probem. Step : For each Ω, sove the foowng sub probem: T Q ( x( k)) = max q y y 0 s.t. W y h + T x( k) ( π,, x( k) ) W y = h + T x( k) ( π ),, x( k) where the symbos n parenthess next to the constrants denote to the correspondng dua varabes. If the sub probem s nfeasbe for any scenaro Ω, go to Step 5. Otherwse, usng the sub probem obectve vaues, compute the obectve functon vaue T f ( xk ( )) = O( k) c( k) xk ( ) Q( k) ( xk ( )) correspondng to the current feasbe souton x( k) T where ( k) argmax{ O c x( k) Q ( x( k))}. If ub > f ( xk ( )), update the upper bound Ω ub = f ( x( k)) and the ncumbent souton x = xk ( ). Step 3: If ub b λ, where λ 0 s a pre-specfed toerance, stop and return x optma souton and ub as the optma obectve vaue; otherwse proceed to Step 4. T Step 4: For the scenaro ( k) argmax{ O c x( k) Q ( x( k))}, et ( π, π Ω be the optma dua soutons for the sub probem correspondng to x( k), ( k), x( k) as the, ( k), x( k) and ( k) soved n T T Step. Compute the cut coeffcents ( T T ak = c ( k) + ( π, ( k), x( k) ) T + ( π ( k), ( k), x( k) ) T ( k) ), T and b = a x( k) + f( x( k)), and go to Step. k k Step 5: et ˆ Ω be a scenaro such that the sub probem s nfeasbe. Sove the foowng optmzaton probem where 0 and represent the vector wth a eements equa to zero and one respectvey. )

12 mn( h + T x( k)) v + ( h + T x( k)) v v, v T T s.t. Wˆv+ W ˆv 0 0 v, v T T ˆ ˆ ˆ ˆ et v and v be the optma souton of ths optmzaton probem. Set k = k and k k T T Y Y { x ( h + T x) v + ( h + T x) v 0} and go to Step. ˆ ˆ ˆ ˆ If the reaxed mode () s nfeasbe, the agorthm s termnated wth the concuson that there exsts no robust souton to the probem. Otherwse, ts resuts are the canddate robust decson, x x, and the ower bound on mn-max regret vaue, max{ = O Z ( x )} Ω = obtaned from the reaxed mode (). The optmaty condton s then checked. The optmaty condton w be satsfed when ε, where ε 0 s pre-specfed toerance. If the optmaty condton s satsfed, the agorthm s termnated wth the ε - optma robust souton. Otherwse the souton x Ω and the vaue of second stage... The Second Stage Agorthm The man purpose of the second stage agorthm s to dentfy a scenaro admts no feasbe souton to Z ( x ) for Ω Ω are forwarded to the Ω whch =. To acheve ths goa, the agorthm soves a b-eve programmng probem referred to as the B-eve- mode by foowng two man steps. In the frst step, the agorthm starts by pre-processng mode parameters. At ths pont, some mode parameters vaues n the orgna B-eve- mode are predetermned at ther optma settng by foowng some smpe preprocessng rues. In the second step, the B-eve- mode s transformed from ts orgna form nto a snge-eve mxed nteger near programmng structure. Next we descrbe the key concepts of each agorthm step and the structure of the B-eve- mode. One can fnd a mode parameters settng or a scenaro souton to Z ( x ) for Ω Ω whch admts no feasbe = by sovng the foowng b-eve programmng probem referred to as the B-eve- mode. The foowng mode (3) demonstrates the genera structure of the B-eve- mode.

13 mn ξ s.t. max yss,,, s, s.t. δ ξ Ξ δ δ Wy+ s = h + TxΩ W y+ s = h + T xω Wy+ s = h Tx Ω δ s, δ s, δ s, y 0 (3) In the B-eve- mode, the eader s obectve s to make the probem nfeasbe by controng the parameters settngs. The foower s obectve s to make the probem feasbe by controng the contnuous decson varabes, under the fxed parameters settng from the eader probem, when the settng of bnary decson varabes s fxed at x Ω. In the mode (3), δ represents a scaar decson varabe and 0 and represent the vector wth a eements equa to zero and one respectvey. The current form of the mode (3) has a nonnear beve structure wth a set of constrants restrctng the possbe vaues of the decson vectors ξ = ( cqh,,, h, T, T, W, W ). Because the structure of the foower probem of the mode (3) s a near program and t affects the eader s decsons ony through ts obectve functon, we can smpy repace ths foower probem wth expct representatons of ts optmaty condtons. These expct representatons ncude the foower s prma constrants, the foower s dua constrants and the foower s strong duaty constrant. Furthermore, from the speca structure of the mode (3), a eements n decson varabe matrxes T, Wand vector h can be predetermned to ether one of ther bounds even before sovng the mode (3). For each eement of the decson matrx W n the mode (3), the optma settng of ths decson varabe s the upper bound of ts possbe vaues. The correctness of these smpe rues s obvous based on the fact that y 0. Smary, for each eement of the decson vector h and matrx T, the optma settng of ths decson varabe n the mode (3) s the ower bound of ts possbe vaues. emma 3: The mode (3) has at east one optma souton T, h, W, T, h, and W n whch each eement of these vectors takes on a vaue at one of ts bounds. Proof: Because the optma settng of each eement of T, h, and W aready takes ts vaue from one of ts bounds. We ony need to prove ths emma for each eement of T, h, and W. Each of these varabes T, h, and W appears n ony two constrans n the mode 3

14 W y + s = h + T x Ω and W y + s = h T x Ω (3):. It s aso easy to see that s = s and mn{ s, s} = s s /. Ths fact mpes that the optma settng of y whch maxmzes mn{ s, s } w aso mnmze s s / and vse versa under the fxed settng of ξ. Because s s /= h + TxΩ Wy, the optma settng of T, h, andw w maxmze mn h + T xω W y y χ ( x Ω ) where χ( x Ω ) = { y 0 Wy h+ Tx Ω, Wy h + T x Ω }. In ths form, t s easy to see that the optma settng of varabes T, h andw w take on one of ther bounds. et us defne the notatons and E to represent sets of row ndces assocatng wth essthan-or-equa-to and equaty constrants n the mode () respectvey. et us aso defne the notatons w, w + and w E to represent dua varabes of the foower probem n the mode (3). Even though there are sx sets of foower s constrants n the mode (3), ony three sets of dua varabes are requred. Because of the structure of dua constrants of the foower probem n the mode (3), dua varabes assocated wth the frst three sets of the foower s constrants are exacty the same as those assocated wth the ast three sets. After repacng the foower probem wth expct representatons of ts optmaty condtons, we encounter wth a number of nonnear terms n the mode ncudng: W y, Ww +, Ww, hw +, h w, Tw +, and T w. By utzng the resut form emma 3, we can repace + these nonnear terms wth the new set of varabes WY, WW, WW, HW + HW,, TW +, and TW wth the use of bnary varabes. We ntroduce bnary varabes,, and,, and bt bh bw whch take the vaue of zero or one f varabes T h W respectvey take the ower or the upper bound vaues. The foowng three sets of constrants (4), (5), and (6) w be used to reate these new varabes wth nonnear terms n the mode. In these constrants, the notatons varabes y, w + and w y, w + and w constructng these bounds of the prma and dua varabes. represent the upper bound vaue of the respectvey. Teraky (996) descrbes some technques on 4

15 T = T + ( T T ) bt Tw TW Tw Tw TW Tw TW Tw ( T + T )( w )( bt ) E, TW Tw + ( T + T )( w )( bt ) TW Tw ( T + T )( w )( bt ) TW Tw + ( T + T )( w )( bt ) bt {0,} (4) h = h + ( h h) bh hw HW hw hw HW hw HW hw ( h + h )( w )( bh) HW hw + ( h + h )( w )( bh) HW hw ( h + h )( w )( bh ) HW hw + ( h + h )( w )( bh) bh {0,} E (5) W = W + ( W W ) bw W y WY W y WY W y W W y bw WY W y W W y bw W w WW W w W w WW W w E, WW ( )( )( ) WW W w W W w bw WW W w ( W W )( w )( bw ) ( + )( )( ) + ( + )( )( ) W w W + W w bw ( + )( )( ) + + ( + )( )( ) WW W w W W w bw bw {0,} (6) After appyng pre-processng rues, the foower probem transformaton, and the resut from emma 3, the mode (3) can be transformed from a b-eve nonnear structure to a snge-eve mxed nteger near structure presented n the mode (7). The tabe n the mode (7) s used to dentfy some addtona constrants and condtons for addng these constrants 5

16 to the mode (7). These resuts greaty smpfy the souton methodoogy of the B-eve- mode. If the optma settng of the decson varabe δ s negatve, the agorthm w add scenaro, whch s generated by the optma settng of h, h, T, T, W, and W from the mode (7) and any feasbe combnaton of c and q, to the scenaro set Ω and return to the frst stage agorthm. Otherwse the agorthm w forward the souton x Ω and the vaue of to the thrd stage agorthm. mn s.t. δ W y + s = h + T x Ω WY + s = h + T x E Ω WY + s = h T x E Ω δ s, δ s E, δ s E W w + WW WW 0 E ( + ) ( + ) w + w + w = E + + δ = h + TxΩ w + HW HW + ( TW TW) xω E w 0, w 0 E, w 0 E, y 0 + Condton to Add the Constrants Constrant Reference Constrant Index Set Aways (4) For a E, For a Aways (5) For a E Aways (6) For a E, For a.3. The Thrd Stage Agorthm The man purpose of the thrd stage s to dentfy a scenaro { arg max O Z( xω )} The mathematca mode utzed by ths stage to perform ths task s aso a b-eve program referred to as the B-eve- mode. The eader s obectve s to fnd the settng of the decson vector ξ = ( cqh,,, h, T, T, W, W ) and decson vector ( x, y) that resut n the maxmum regret vaue possbe, max{ O Z( xω )} Ω Ω (7), for the canddate robust souton x Ω. The foower s obectve s to set the decson vector y to correcty cacuate the vaue of Z ( x ) under the fxed settng of decson vector ξ estabshed by the eader. The genera Ω structure of the B-eve- mode s represented n the foowng mode (8).. 6

17 The souton methodoogy for sovng the mode (8) can be structured nto two man steps. These two man steps ncude () the parameter pre-processng step and () the mode transformaton step. Each of these steps s descrbed n deta n the foowng subsectons. max { q y + c x q y c x )} x x {0,}, y 0, ξ s.t. T T T T ξ Ξ W y h + Tx W y = h + Tx T m ax q y y 0 s.t. W y h + T x W y = h + T x Ω Ω Ω (8).3.. Parameter Pre-Processng Step From the structure of the mode (8), many eements of decson vector ξ can be predetermned to attan ther optma settng at one of ther bounds. In many cases, smpe rues exst n dentfyng the optma vaues of these eements of decson vector ξ when the nformaton on x Ω s gven even before sovng the mode (8). The foowng secton descrbes these smpe pre-processng rues for eements of vector c and matrx T n the vector ξ. Pre-Processng Step for c The eements of decson vector c represent the parameters correspondng to coeffcents of bnary decson varabes n the obectve functon of the mode (). Each eement c of vector c s represented n the obectve functon of the mode (8) as: ( cx cx Ω ). From any gven vaue of x Ω, the vaue of c can be predetermned by the foowng smpe rues. If x Ω s, the optma settng of c s c = c. Otherwse the optma settng of c s c = c. Pre-Processng Step for T The eements of decson vector T represent the coeffcents of the bnary decson varabes ocated n the ess-than-or-equa-to constrants of the mode (). Each eement T of matrx T s represented n the constrant of the mode (8) as: W y h + T x + T x and W y h + T xω + T x k k k. From any gven k Ωk k 7

18 vaue of x Ω, the vaue of T can be predetermned at T = T f x Ω = 0. In the case when x Ω =, the optma settng of T satsfes the foowng set of constrants ustrated n (9) where the new varabe TX repaces the nonnear term T x n the mode (8). The nsght of ths set of constrants (9) s that f the vaue of x s set to be zero by the mode, the optma settng of T s T and TX = 0. Otherwse the optma settng of T can not be predetermned and TX = T. TX T + T ( x ) 0 TX + T T ( x ) 0 T x TX T x T T T + x ( T T ) (9).3.. Probem Transformaton Step In order to sove the mode (8) effcenty, the foowng two man tasks have to be accompshed. Frst, a modeng technque s requred to propery mode the constrant ξ Ξ. Second, an effcent transformaton method s requred to transform the orgna formuaton of the mode (8) nto a computatonay effcent formuaton. The foowng two subsectons descrbe technques and methodooges for performng these two tasks Modeng Technque for the Constrant ξ Ξ Consder a varabe p whch ony takes ts vaue from p dstnct rea vaues, p (), p (),, p ( p). Ths constrant on the varabe p can be formuated n the mathematca programmng mode as: p = p() b, p = p b =, b 0 =,..., p = and { b, b,..., b } s SOS. A Speca Ordered Set of type One (SOS) s defned to be a set of varabes for whch not more than one member from the set may be non-zero. When these nonnegatve varabes, b =,..., p, are defned as SOS, there are ony p branches requred n the searchng tree for these varabes Fna Transformaton Steps for the B-eve- Mode Because the structure of the foower probem n the mode (8) s a near program and t affects the eader s decsons ony through ts obectve functon, the fna transformaton steps start by repacng the foower probem wth expct representatons of ts optmaty condtons. These expct representatons ncude the foower s prma constrants, the foower s dua constrants and the foower s strong duaty constrant. The mode (0) p 8

19 ustrates the formuaton of the mode (8) after ths frst transformaton where decson varabes w and w E represent the dua varabe assocated wth foower s constrants. The mode (0) s a snge-eve mxed nteger nonnear optmzaton probem. By appyng resuts from parameter pre-processng steps and modeng technque prevousy dscussed, the fna transformaton steps are competed and are summarzed beow. max{ q y + c x q y c x } s.t. Ω ξ Ξ W y h + T x W y h + T x Ω W y = h + T x E W y = h + T x E Ω W w + W w q E h + T x w + h + T x w = q y w 0, y 0, y 0, x {0,} Ω Ω E (0) Fna Transformaton Steps Parameter c : By appyng the preprocessng rue, each varabe c can be fxed at Parameter T : By appyng prevous resuts, f the parameter T can be preprocessed, then fx ts vaue at the approprate vaue of c. T. Otherwse, frst add a decson varabe TX and a set of constrants ustrated n (9) to repace the nonnear term T x n the mode (0), then add a set of varabes and constrants ustrated n () to repace part of the constrant ξ Ξ for T n the mode (0), and fnay add a varabe TW and a set of varabes and constrants ustrated n () to repace the nonnear term T w n the mode (0), where w and w represent the upper bound and the ower bound of dua varabe respectvey. w T T () T = T bt, bt =, bt 0 s {,,..., T } and { bt } s SOS ( s) ( s) ( s) ( s) ( s) s s= s= T TW = T ( s) ZTW ( s) s= w bt ( s) ZTW ( s) w bt ( s), ZTW ( s) w w ( bt ( s) ), ZTW ( s) w w ( bt ( s) ) s {,..., T } () 9

20 Parameter T : We frst add a decson varabe TX and a set of constrants ustrated n (3) to repace the nonnear term T x n the mode (0), then add a set of varabes and constrants ustrated n (4) to repace part of the constrant ξ Ξ for T n the mode (0), and fnay add a varabe TW and a set of varabes and constrants ustrated n (5) to repace the nonnear term T w n the mode (0), where w and w represent the upper bound and the ower bound of varabe w respectvey. T TX = T ( s) ZTX ( s) s= 0,,, {,..., } ZTX ( s) ZTX ( s) bt ( s) ZTX ( s) x ZTX ( s) bt ( s) + x s T (3) T T (4) T = T bt, bt =, bt 0 s {,,..., T } and { bt } s SOS ( s) ( s) ( s) ( s) ( s) s s= s= T TW = T ( s) ZTW ( s) s= w bt s ( ) ZTW s ( ) w bt s ( ), ZTW s ( ) w w( bt s ( )), ZTW s ( ) w w( bt s ( )) s {,..., T } (5) Parameter h and h : We frst add a set of varabes and constrants ustrated n (6) and (7) to repace part of the constrant ξ Ξ for h and h respectvey n the mode (0). We then add varabes HW, HWand a set of varabes and constrants n (8) and (9) to repace the nonnear terms hw and hw respectvey n the mode (0). h h (6) h = h bh, bh =, bh 0 s {,,..., h } and { bh } s SOS ( s) ( s) ( s) ( s) ( s) s s= s= h h (7) h = h bh, bh =, bh 0 s {,,..., h } and { bh } s SOS ( s) ( s) ( s) ( s) ( s) s s= s= h HW = h ( s) ZHW ( s) s= (8) w bh () s ZHW () s w bh() s, ZHW () s w w( bh() s), ZHW () s w w ( bh() s) s {,..., h } h HW = h ( s) ZHW ( s) s= w bh ( s) ZHW( s) w bh ( s), ZHW( s) w w( bh ( s) ), ZHW( s) w w( bh ( s) ) s {,..., h } (9) 0

21 Parameter q : We frst add a set of varabes and constrants ustrated n (0) to repace part of the constrant ξ Ξ for q n the mode (0). We then add decson varabes QY and a set of varabes and constrants n () to repace the nonnear terms QY, qy and qy respectvey n the mode (0) where y r and y r represent the upper bound and the ower bound of varabe y r respectvey for r = and. q q (0) q = q bq, bq =, bq 0 s {,,..., q } and { bq } s SOS ( s) ( s) ( s) ( s) ( s) s s= s= q QY = q ZQY ( s) ( s) s= s () () s s (), () s ( s ()), () s ( s ()) {,..., } q = ( s) ( s) s= ( s) ( s) ( s), ( s) y y bq( s) ZQY ( s) y y bq( s) s q y bq ZQY y bq ZQY y y bq ZQY y y bq s q QY q ZQY y bq ZQY y bq ZQY () ( ), ( ) {,..., } Parameter W and W : We frst add a set of varabes and constrants ustrated n () and (3) to repace part of the constrant ξ Ξ for W and W respectvey n the mode (0). We then add a set of varabes and constrants ustrated n (4) and (5) together wth varabes WY, WY, WY, WY, WW, and WW to repace the nonnear terms W y, W y W y, W y, W w, and Ww n the mode (0). W W () W = W bw, bw =, bw 0 s {,,..., W } and { bw } s SOS ( s) ( s) ( s) ( s) ( s) s s= s= W W (3) W = W bw, bw =, bw 0 s {,,..., W } and { bw } s SOS ( s) ( s) ( s) ( s) ( s) s s= s= W = ( s) ( s) s= () s () s () s, () s ( () s ), () s ( () s ) {,..., } W = ( s) ( s) s= s () ZWY () s ybw() s ZWY () s y y bw() s ZWY () s y y bw () s s W W = ( s) ( s) s= () s () s () s, () s w ( bw() s ), ZWW () s w w ( bw() s ) s {,..., W } WY W ZWY y bw ZWY y bw ZWY y y bw ZWY y y bw s W WY W ZWY y bw, ( ), ( ) {,..., } WW W ZWW wbw ZWW wbw ZWW w (4)

22 W = ( s) ( s) s= () s () s () s, () s ( () s ), () s ( () s ) {,..., } W = ( s) ( s) s= () s ZWY() s ybw() s ZWY() s y y bw() s ZWY() s y y bw() s s W W = ( s) ( s) s= ( s) ( s) ( s), ( s) w bw() s ZWW () s w w bw() s s W WY W ZWY y bw ZWY y bw ZWY y y bw ZWY y y bw s W WY W ZWY y bw WW W ZWW wbw ZWW wbw ZWW w, ( ), ( ) {,..., } ( ), ( ) {,..., } (5) By appyng these transformaton steps, the mode (0) can now be transformed nto ts fna formuaton as a snge eve mxed nteger near programmng probem as shown n the mode (6). The tabe n the mode (6) s used to dentfy some addtona constrants and condtons for addng these constrants to the mode (6). = max{ QY + c x QY c x } Ω s.t. WY h + TX + T x Ind = Ind = 0 WY = h + TX WY h + T x + T x Ω Ω Ind = Ind = 0 WY = h + T x E WW Ω E E + WW q HW + HW + TW x + T w x + TW x = QY y 0, y 0, w 0, x {0,} Ω Ω Ω E Ind = Ind = 0 E Condton to Add the Constrants Constrant Reference Constrant Index Set Ind = (9), (), and () For a, For a Aways (3), (4), and (5) For a E, For a Aways (6) and (8) For a Aways (7) and (9) For a E Aways (0) and () For a Aways () and (4) For a, For a Aways (3) and (5) For a E, For a Where Ind f T vaue cannot be predetermned. = 0 otherwse (6) T Preprocessed vaue of T f T can be preprocessed = 0 Otherwse

23 The B-eve- mode can now be soved as a mxed nteger near program by sovng the mode (6). The optma obectve functon vaue of the mode (6),, s used to update the vaue of by settng to mn{, }. The optmaty condton s then checked. If the optmaty condton s not satsfed, add scenaro whch s the optma settngs of ξ = ( cqh,,, h, T, T, W, W ) from the mode (6) to the scenaro set Ω and return to the frst stage agorthm. Otherwse, the agorthm s termnated wth an ε optma robust souton whch s the dscrete soute on wth the maxmum regret of from the mode (6). In fact, we do not have to sove the mode (6) to optmaty n each teraton to generate the scenaro. We can stop the optmzaton process for the mode (6) as soon as the feasbe souton wth the obectve vaue arger than the current vaue of has been found. We can use ths feasbe settng of ξ = ( cqh,,, h, T, T, W, W ) to generate the scenaro n the current teraton. The foowng emma 4 provdes the mportant resut that the agorthm aways termnates at an ε-optma robust souton n a fnte number of agorthm steps. emma 4: The three-stage agorthm termnates n a fnte number of steps. When the agorthm has termnated wth ε 0, t has ether detected nfeasbty or has found an ε- optma robust souton to the orgna probem. Proof: The resut foows form the defnton of case the agorthm enumerates a scenaros Ω and Ω s fnte. and and the fact that n the worst The foowng secton demonstrates appcatons of the proposed three-stage agorthm for sovng mn-max regret robust optmzaton probems under fu-factora scenaro desgn of data uncertanty. A resuts ustrate the promsng capabty of the proposed agorthm for sovng the robust optmzaton of ths type wth an extremey arge number of possbe scenaros. 3. Appcatons of the Three-Stage Agorthm In ths secton, we descrbe numerca experments usng the proposed agorthm for sovng a number of two-stage facty ocaton probems under uncertanty. We consder the suppy chan n whch suppers send matera to factores that suppy warehouses that suppy markets as shown n Fgure (Chopra and Mend). ocaton, capacty aocaton, and transportaton decsons have to be made n order to mnmze the overa suppy chan cost. Mutpe warehouses may be used to satsfy demand at a market and mutpe factores may be used to repensh warehouses. It s aso assumed that unts have been appropratey 3

24 adusted such that one unt of nput from a suppy source produces one unt of the fnshed product. In addton, each factory and each warehouse cannot operate at more than ts capacty and a near penaty cost s ncurred for each unt of unsatsfed demands. The mode requres the foowng notatons, parameters and decson varabes: Suppers Factores Warehouses Markets Fgure : Stages n the Consdered Suppy Chan Network (Chopra and Mend). m : Number of markets W e : Potenta warehouse capacty at ste e n : Number of potenta factory ocaton f : Fxed cost of ocatng a pant at ste : Number of suppers f e : Fxed cost of ocatng a warehouse at ste e t : Number of potenta warehouse ocatons c h : Cost of shppng one unt from supper h to factory D : Annua demand from customer c e : Cost of shppng one unt from factory to warehouse e K : Potenta capacty of factory ste c 3e : Cost of shppng one unt from warehouse e to market S h : Suppy capacty at supper h p : Penaty cost per unt of unsatsfed demand at market y : = f pant s opened at ste ; : = 0 otherwse z e : = f warehouse s opened at ste e; : = 0 otherwse x h : = Transportaton quantty from supper h to pant x 3e : = Transportaton quantty from warehouse e to market x e s : = Transportaton quantty from pant to warehouse e : = Quantty of unsatsfed Demand at market In the determnstc case, the overa probem can be modeed as the mxed nteger near programmng probem presented n the foowng mode. When some parameters n the mode are uncertan, the goa becomes to dentfy robust factory and warehouse ocatons under devaton robustness defnton. Transportaton decsons are treated as recourse decsons whch w be made after the reazaton of uncertanty. 4

25 mn n t n n t t m m f y + f z + c x + c x + c x + p s e e h h e e 3e 3e = e= h= = = e= e= = = n t s.t. x S h {,..., }, x x = 0 {,..., n} h h h e = h= e= t n m xe K y e 3e e= = = m {,..., n}, x x = 0 e {,..., t} x W z e {,..., t}, x + s = D {,..., m} 3e e e 3e = e= x 0 h, x 0 e, x 0 e, s 0 h e 3e t, y {0,}, and z {0,} e e We appy the proposed agorthm to 0 dfferent expermenta settngs of the robust facty ocaton probems. Each expermenta settng n ths case study contans dfferent sets of uncertan parameters and dfferent sets of possbe ocatons whch resut n dfferent number of possbe scenaros. The number of possbe scenaros n ths case study vares from 64 up to 3 40 scenaros. The key uncertan parameters n these probems are the suppy quantty at the supper, the potenta capacty at the factory, the potenta capacty at the warehouse, and the unt penaty cost for not meetng demand at the market. et us defne notatons, n, t, and m to represent the number of suppers, factores, warehouses, and markets wth uncertan parameters respectvey n the probem. It s assumed that each uncertan parameter n the mode can ndependenty take ts vaues from r possbe rea vaues. The foowng Tabe descrbes these twenty settngs of the case study. Tabe : Twenty Settngs of Numerca Probems n the Case Study Sze of Extensve Form Mode Probem n t m n t m r Ω #Constrants #Contnuous #Bnary Varabes Varabes S x x S x x S x x S x x S x x S x x S x x S x x S x x M x x M x x 0 3 M x x 0 3 M x x 0 3 M x x 0 3 M x x x x x x x x x x x x 0 0 5

26 A case study settngs are soved by the proposed agorthm wth ε = 0 and extensve form mode (EFM) both wthout and wth Benders decomposton (BEFM) on a Wndows XP-based Pentum(R) 4 CP 3.60GHz persona computer wth.00 GB RAM usng a C++ program and CPEX 0 for the optmzaton process. MS-Access s used for the case study nput and output database. In ths case study, we appy the proposed agorthm to these twenty expermenta probems by usng two dfferent setups of nta scenaros. For the frst setup, the nta scenaro set conssts of ony one scenaro. For the second setup, the nta scenaro set conssts of a combnatons of upper and ower bounds for each man type of uncertan parameters. For exampe, there are three man types of uncertan parameters n the probems S to S9, the nta scenaro set of these probems conssts of 3 = 8 scenaros for the second setup. Tabe ustrates the computaton tme (n seconds) and performance comparson among these methodooges over a 0 settngs. If the agorthm fas to obtan an optma robust souton wthn 4 hours or fas to sove the probem due to nsuffcency of memory, the computaton tme of -- s reported n the tabe. Because the probems consdered n ths case study are aways feasbe for any settng of ocaton decsons, the Stage of the proposed agorthm can be omtted. Tabe : Performance Comparson between Proposed Agorthm and Tradtona Methods Proposed Agorthm Probem EFM BEFM Inta Scenaros Setup Inta Scenaros Setup Souton Tme Souton Tme Stage Tme Stage3 Tme Tota Tme #Iteraton ( Ω ) Stage Tme Stage3 Tme Tota Tme #Iteraton ( Ω ) S (5) (9) S (5) (9) S (4) (9) S (5) (9) S (4) (9) S (5) () S (4) (9) S (5) () S (5) () M (0) (3) M (9) (6) M (8) (7) M (6) () M (3) (4) M (5) (0) (43) (33) (0) (6) (36) (7) (50) (3) (88) (9) 6

27 A resuts from these expermenta runs ustrate sgnfcant mprovements n computaton tme of the proposed agorthm over the extensve form mode both wth and wthout Benders decomposton. These resuts demonstrate the promsng capabty of the proposed agorthm for sovng practca mn-max regret robust optmzaton probems under fu factora scenaro desgn of data uncertanty wth extremey arge number of possbe scenaros. In addton, these numerca resuts ustrate the mpact of the quaty of the nta scenaros setup on the requred computaton tme of the proposed agorthm. Decson makers are hghy recommended to perform thorough anayss of the probem n order to construct the good nta set of scenaros before appyng the proposed agorthm. 4. Summary Ths paper deveops a mn-max regret robust optmzaton agorthm for deang wth uncertanty n mode parameter vaues of mxed nteger near programmng probems when each uncertan mode parameter ndependenty takes ts vaue from a fnte set of rea numbers wth unknown ont probabty dstrbuton. Ths type of parametrc uncertanty s referred to as a fu-factora scenaro desgn. The agorthm conssts of three stages and coordnates three mathematca programmng formuatons to sove the overa optmzaton probem effcenty. The agorthm utzes pre-processng steps, decomposton technques, and probem transformaton procedures to mprove ts computatona tractabty. The agorthm s proven to ether termnate at an optma robust souton, or dentfy the nonexstence of the robust souton, n a fnte number of teratons. The proposed agorthm has been apped to sove a number of robust facty ocaton probems under uncertanty. A resuts ustrate the outstandng performance of the proposed agorthm for sovng the robust optmzaton probems of ths type over the tradtona methodooges. 5. References Assavapokee, T., Reaff, M., Ammons, J., and Hong, I.: A Scenaro Reaxaton Agorthm for Fnte Scenaro Based Mn-Max Regret and Mn-Max Reatve Regret Robust Optmzaton. Computers & Operatons Research, (To appear) (007a). Assavapokee, T., Reaff, M., and Ammons, J.: A Mn-Max Regret Robust Optmzaton Approach for Interva Data ncertanty. Journa of Optmzaton Theory and Appcatons, (To appear) (007b). Averbakh, I.: On the Compexty of a Cass of Combnatora Optmzaton Probems wth ncertanty, Mathematca Programmng, 90, 63-7 (00). Averbakh, I.: Mnmax Regret Soutons for Mnmax Optmzaton Probems wth ncertanty, Operatons Research etters, 7/, (000). 7

Research on Complex Networks Control Based on Fuzzy Integral Sliding Theory

Research on Complex Networks Control Based on Fuzzy Integral Sliding Theory Advanced Scence and Technoogy Letters Vo.83 (ISA 205), pp.60-65 http://dx.do.org/0.4257/ast.205.83.2 Research on Compex etworks Contro Based on Fuzzy Integra Sdng Theory Dongsheng Yang, Bngqng L, 2, He

More information

Lower Bounding Procedures for the Single Allocation Hub Location Problem

Lower Bounding Procedures for the Single Allocation Hub Location Problem Lower Boundng Procedures for the Snge Aocaton Hub Locaton Probem Borzou Rostam 1,2 Chrstoph Buchhem 1,4 Fautät für Mathemat, TU Dortmund, Germany J. Faban Meer 1,3 Uwe Causen 1 Insttute of Transport Logstcs,

More information

MARKOV CHAIN AND HIDDEN MARKOV MODEL

MARKOV CHAIN AND HIDDEN MARKOV MODEL MARKOV CHAIN AND HIDDEN MARKOV MODEL JIAN ZHANG JIANZHAN@STAT.PURDUE.EDU Markov chan and hdden Markov mode are probaby the smpest modes whch can be used to mode sequenta data,.e. data sampes whch are not

More information

A General Column Generation Algorithm Applied to System Reliability Optimization Problems

A General Column Generation Algorithm Applied to System Reliability Optimization Problems A Genera Coumn Generaton Agorthm Apped to System Reabty Optmzaton Probems Lea Za, Davd W. Cot, Department of Industra and Systems Engneerng, Rutgers Unversty, Pscataway, J 08854, USA Abstract A genera

More information

Associative Memories

Associative Memories Assocatve Memores We consder now modes for unsupervsed earnng probems, caed auto-assocaton probems. Assocaton s the task of mappng patterns to patterns. In an assocatve memory the stmuus of an ncompete

More information

Neural network-based athletics performance prediction optimization model applied research

Neural network-based athletics performance prediction optimization model applied research Avaabe onne www.jocpr.com Journa of Chemca and Pharmaceutca Research, 04, 6(6):8-5 Research Artce ISSN : 0975-784 CODEN(USA) : JCPRC5 Neura networ-based athetcs performance predcton optmzaton mode apped

More information

Cyclic Codes BCH Codes

Cyclic Codes BCH Codes Cycc Codes BCH Codes Gaos Feds GF m A Gaos fed of m eements can be obtaned usng the symbos 0,, á, and the eements beng 0,, á, á, á 3 m,... so that fed F* s cosed under mutpcaton wth m eements. The operator

More information

A finite difference method for heat equation in the unbounded domain

A finite difference method for heat equation in the unbounded domain Internatona Conerence on Advanced ectronc Scence and Technoogy (AST 6) A nte derence method or heat equaton n the unbounded doman a Quan Zheng and Xn Zhao Coege o Scence North Chna nversty o Technoogy

More information

Multispectral Remote Sensing Image Classification Algorithm Based on Rough Set Theory

Multispectral Remote Sensing Image Classification Algorithm Based on Rough Set Theory Proceedngs of the 2009 IEEE Internatona Conference on Systems Man and Cybernetcs San Antono TX USA - October 2009 Mutspectra Remote Sensng Image Cassfcaton Agorthm Based on Rough Set Theory Yng Wang Xaoyun

More information

Integrating advanced demand models within the framework of mixed integer linear problems: A Lagrangian relaxation method for the uncapacitated

Integrating advanced demand models within the framework of mixed integer linear problems: A Lagrangian relaxation method for the uncapacitated Integratng advanced demand modes wthn the framework of mxed nteger near probems: A Lagrangan reaxaton method for the uncapactated case Mertxe Pacheco Paneque Shad Sharf Azadeh Mche Berare Bernard Gendron

More information

Nested case-control and case-cohort studies

Nested case-control and case-cohort studies Outne: Nested case-contro and case-cohort studes Ørnuf Borgan Department of Mathematcs Unversty of Oso NORBIS course Unversty of Oso 4-8 December 217 1 Radaton and breast cancer data Nested case contro

More information

n-step cycle inequalities: facets for continuous n-mixing set and strong cuts for multi-module capacitated lot-sizing problem

n-step cycle inequalities: facets for continuous n-mixing set and strong cuts for multi-module capacitated lot-sizing problem n-step cyce nequates: facets for contnuous n-mxng set and strong cuts for mut-modue capactated ot-szng probem Mansh Bansa and Kavash Kanfar Department of Industra and Systems Engneerng, Texas A&M Unversty,

More information

we have E Y x t ( ( xl)) 1 ( xl), e a in I( Λ ) are as follows:

we have E Y x t ( ( xl)) 1 ( xl), e a in I( Λ ) are as follows: APPENDICES Aendx : the roof of Equaton (6 For j m n we have Smary from Equaton ( note that j '( ( ( j E Y x t ( ( x ( x a V ( ( x a ( ( x ( x b V ( ( x b V x e d ( abx ( ( x e a a bx ( x xe b a bx By usng

More information

Predicting Model of Traffic Volume Based on Grey-Markov

Predicting Model of Traffic Volume Based on Grey-Markov Vo. No. Modern Apped Scence Predctng Mode of Traffc Voume Based on Grey-Marov Ynpeng Zhang Zhengzhou Muncpa Engneerng Desgn & Research Insttute Zhengzhou 5005 Chna Abstract Grey-marov forecastng mode of

More information

COXREG. Estimation (1)

COXREG. Estimation (1) COXREG Cox (972) frst suggested the modes n whch factors reated to fetme have a mutpcatve effect on the hazard functon. These modes are caed proportona hazards (PH) modes. Under the proportona hazards

More information

Boundary Value Problems. Lecture Objectives. Ch. 27

Boundary Value Problems. Lecture Objectives. Ch. 27 Boundar Vaue Probes Ch. 7 Lecture Obectves o understand the dfference between an nta vaue and boundar vaue ODE o be abe to understand when and how to app the shootng ethod and FD ethod. o understand what

More information

Image Classification Using EM And JE algorithms

Image Classification Using EM And JE algorithms Machne earnng project report Fa, 2 Xaojn Sh, jennfer@soe Image Cassfcaton Usng EM And JE agorthms Xaojn Sh Department of Computer Engneerng, Unversty of Caforna, Santa Cruz, CA, 9564 jennfer@soe.ucsc.edu

More information

Lower bounds for the Crossing Number of the Cartesian Product of a Vertex-transitive Graph with a Cycle

Lower bounds for the Crossing Number of the Cartesian Product of a Vertex-transitive Graph with a Cycle Lower bounds for the Crossng Number of the Cartesan Product of a Vertex-transtve Graph wth a Cyce Junho Won MIT-PRIMES December 4, 013 Abstract. The mnmum number of crossngs for a drawngs of a gven graph

More information

Deriving the Dual. Prof. Bennett Math of Data Science 1/13/06

Deriving the Dual. Prof. Bennett Math of Data Science 1/13/06 Dervng the Dua Prof. Bennett Math of Data Scence /3/06 Outne Ntty Grtty for SVM Revew Rdge Regresson LS-SVM=KRR Dua Dervaton Bas Issue Summary Ntty Grtty Need Dua of w, b, z w 2 2 mn st. ( x w ) = C z

More information

NP-Completeness : Proofs

NP-Completeness : Proofs NP-Completeness : Proofs Proof Methods A method to show a decson problem Π NP-complete s as follows. (1) Show Π NP. (2) Choose an NP-complete problem Π. (3) Show Π Π. A method to show an optmzaton problem

More information

Interference Alignment and Degrees of Freedom Region of Cellular Sigma Channel

Interference Alignment and Degrees of Freedom Region of Cellular Sigma Channel 2011 IEEE Internatona Symposum on Informaton Theory Proceedngs Interference Agnment and Degrees of Freedom Regon of Ceuar Sgma Channe Huaru Yn 1 Le Ke 2 Zhengdao Wang 2 1 WINLAB Dept of EEIS Unv. of Sc.

More information

Polite Water-filling for Weighted Sum-rate Maximization in MIMO B-MAC Networks under. Multiple Linear Constraints

Polite Water-filling for Weighted Sum-rate Maximization in MIMO B-MAC Networks under. Multiple Linear Constraints 2011 IEEE Internatona Symposum on Informaton Theory Proceedngs Pote Water-fng for Weghted Sum-rate Maxmzaton n MIMO B-MAC Networks under Mutpe near Constrants An u 1, Youjan u 2, Vncent K. N. au 3, Hage

More information

Inthem-machine flow shop problem, a set of jobs, each

Inthem-machine flow shop problem, a set of jobs, each THE ASYMPTOTIC OPTIMALITY OF THE SPT RULE FOR THE FLOW SHOP MEAN COMPLETION TIME PROBLEM PHILIP KAMINSKY Industra Engneerng and Operatons Research, Unversty of Caforna, Bereey, Caforna 9470, amnsy@eor.bereey.edu

More information

Supplementary Material: Learning Structured Weight Uncertainty in Bayesian Neural Networks

Supplementary Material: Learning Structured Weight Uncertainty in Bayesian Neural Networks Shengyang Sun, Changyou Chen, Lawrence Carn Suppementary Matera: Learnng Structured Weght Uncertanty n Bayesan Neura Networks Shengyang Sun Changyou Chen Lawrence Carn Tsnghua Unversty Duke Unversty Duke

More information

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:

More information

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons

More information

QUARTERLY OF APPLIED MATHEMATICS

QUARTERLY OF APPLIED MATHEMATICS QUARTERLY OF APPLIED MATHEMATICS Voume XLI October 983 Number 3 DIAKOPTICS OR TEARING-A MATHEMATICAL APPROACH* By P. W. AITCHISON Unversty of Mantoba Abstract. The method of dakoptcs or tearng was ntroduced

More information

Application of Particle Swarm Optimization to Economic Dispatch Problem: Advantages and Disadvantages

Application of Particle Swarm Optimization to Economic Dispatch Problem: Advantages and Disadvantages Appcaton of Partce Swarm Optmzaton to Economc Dspatch Probem: Advantages and Dsadvantages Kwang Y. Lee, Feow, IEEE, and Jong-Bae Par, Member, IEEE Abstract--Ths paper summarzes the state-of-art partce

More information

The Second Anti-Mathima on Game Theory

The Second Anti-Mathima on Game Theory The Second Ant-Mathma on Game Theory Ath. Kehagas December 1 2006 1 Introducton In ths note we wll examne the noton of game equlbrum for three types of games 1. 2-player 2-acton zero-sum games 2. 2-player

More information

On the Power Function of the Likelihood Ratio Test for MANOVA

On the Power Function of the Likelihood Ratio Test for MANOVA Journa of Mutvarate Anayss 8, 416 41 (00) do:10.1006/jmva.001.036 On the Power Functon of the Lkehood Rato Test for MANOVA Dua Kumar Bhaumk Unversty of South Aabama and Unversty of Inos at Chcago and Sanat

More information

Note 2. Ling fong Li. 1 Klein Gordon Equation Probablity interpretation Solutions to Klein-Gordon Equation... 2

Note 2. Ling fong Li. 1 Klein Gordon Equation Probablity interpretation Solutions to Klein-Gordon Equation... 2 Note 2 Lng fong L Contents Ken Gordon Equaton. Probabty nterpretaton......................................2 Soutons to Ken-Gordon Equaton............................... 2 2 Drac Equaton 3 2. Probabty nterpretaton.....................................

More information

Chapter 6. Rotations and Tensors

Chapter 6. Rotations and Tensors Vector Spaces n Physcs 8/6/5 Chapter 6. Rotatons and ensors here s a speca knd of near transformaton whch s used to transforms coordnates from one set of axes to another set of axes (wth the same orgn).

More information

An Augmented Lagrangian Coordination-Decomposition Algorithm for Solving Distributed Non-Convex Programs

An Augmented Lagrangian Coordination-Decomposition Algorithm for Solving Distributed Non-Convex Programs An Augmented Lagrangan Coordnaton-Decomposton Agorthm for Sovng Dstrbuted Non-Convex Programs Jean-Hubert Hours and Con N. Jones Abstract A nove augmented Lagrangan method for sovng non-convex programs

More information

Key words. corner singularities, energy-corrected finite element methods, optimal convergence rates, pollution effect, re-entrant corners

Key words. corner singularities, energy-corrected finite element methods, optimal convergence rates, pollution effect, re-entrant corners NESTED NEWTON STRATEGIES FOR ENERGY-CORRECTED FINITE ELEMENT METHODS U. RÜDE1, C. WALUGA 2, AND B. WOHLMUTH 2 Abstract. Energy-corrected fnte eement methods provde an attractve technque to dea wth eptc

More information

Networked Cooperative Distributed Model Predictive Control Based on State Observer

Networked Cooperative Distributed Model Predictive Control Based on State Observer Apped Mathematcs, 6, 7, 48-64 ubshed Onne June 6 n ScRes. http://www.scrp.org/journa/am http://dx.do.org/.436/am.6.73 Networed Cooperatve Dstrbuted Mode redctve Contro Based on State Observer Ba Su, Yanan

More information

3. Stress-strain relationships of a composite layer

3. Stress-strain relationships of a composite layer OM PO I O U P U N I V I Y O F W N ompostes ourse 8-9 Unversty of wente ng. &ech... tress-stran reatonshps of a composte ayer - Laurent Warnet & emo Aerman.. tress-stran reatonshps of a composte ayer Introducton

More information

Numerical Investigation of Power Tunability in Two-Section QD Superluminescent Diodes

Numerical Investigation of Power Tunability in Two-Section QD Superluminescent Diodes Numerca Investgaton of Power Tunabty n Two-Secton QD Superumnescent Dodes Matta Rossett Paoo Bardea Ivo Montrosset POLITECNICO DI TORINO DELEN Summary 1. A smpfed mode for QD Super Lumnescent Dodes (SLD)

More information

On the Multicriteria Integer Network Flow Problem

On the Multicriteria Integer Network Flow Problem BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 5, No 2 Sofa 2005 On the Multcrtera Integer Network Flow Problem Vassl Vasslev, Marana Nkolova, Maryana Vassleva Insttute of

More information

COS 521: Advanced Algorithms Game Theory and Linear Programming

COS 521: Advanced Algorithms Game Theory and Linear Programming COS 521: Advanced Algorthms Game Theory and Lnear Programmng Moses Charkar February 27, 2013 In these notes, we ntroduce some basc concepts n game theory and lnear programmng (LP). We show a connecton

More information

Example: Suppose we want to build a classifier that recognizes WebPages of graduate students.

Example: Suppose we want to build a classifier that recognizes WebPages of graduate students. Exampe: Suppose we want to bud a cassfer that recognzes WebPages of graduate students. How can we fnd tranng data? We can browse the web and coect a sampe of WebPages of graduate students of varous unverstes.

More information

A Derivative-Free Algorithm for Bound Constrained Optimization

A Derivative-Free Algorithm for Bound Constrained Optimization Computatona Optmzaton and Appcatons, 21, 119 142, 2002 c 2002 Kuwer Academc Pubshers. Manufactured n The Netherands. A Dervatve-Free Agorthm for Bound Constraned Optmzaton STEFANO LUCIDI ucd@ds.unroma.t

More information

Achieving Optimal Throughput Utility and Low Delay with CSMA-like Algorithms: A Virtual Multi-Channel Approach

Achieving Optimal Throughput Utility and Low Delay with CSMA-like Algorithms: A Virtual Multi-Channel Approach Achevng Optma Throughput Utty and Low Deay wth SMA-ke Agorthms: A Vrtua Mut-hanne Approach Po-Ka Huang, Student Member, IEEE, and Xaojun Ln, Senor Member, IEEE Abstract SMA agorthms have recenty receved

More information

Robust Multi-Objective Facility Location Model of Closed-Loop Supply Chain Network under Interval Uncertainty

Robust Multi-Objective Facility Location Model of Closed-Loop Supply Chain Network under Interval Uncertainty Internatona Journa of Operatons Research Internatona Journa of Operatons Research Vo. 14, No. 2, 53 63 (2017) Robust Mut-Obectve Facty Locaton Moe of Cose-Loop Suppy Chan Network uner Interva Uncertanty

More information

Quantum Runge-Lenz Vector and the Hydrogen Atom, the hidden SO(4) symmetry

Quantum Runge-Lenz Vector and the Hydrogen Atom, the hidden SO(4) symmetry Quantum Runge-Lenz ector and the Hydrogen Atom, the hdden SO(4) symmetry Pasca Szrftgser and Edgardo S. Cheb-Terrab () Laboratore PhLAM, UMR CNRS 85, Unversté Le, F-59655, France () Mapesoft Let's consder

More information

Approximate merging of a pair of BeÂzier curves

Approximate merging of a pair of BeÂzier curves COMPUTER-AIDED DESIGN Computer-Aded Desgn 33 (1) 15±136 www.esever.com/ocate/cad Approxmate mergng of a par of BeÂzer curves Sh-Mn Hu a,b, *, Rou-Feng Tong c, Tao Ju a,b, Ja-Guang Sun a,b a Natona CAD

More information

A General Distributed Dual Coordinate Optimization Framework for Regularized Loss Minimization

A General Distributed Dual Coordinate Optimization Framework for Regularized Loss Minimization Journa of Machne Learnng Research 18 17 1-5 Submtted 9/16; Revsed 1/17; Pubshed 1/17 A Genera Dstrbuted Dua Coordnate Optmzaton Framework for Reguarzed Loss Mnmzaton Shun Zheng Insttute for Interdscpnary

More information

The line method combined with spectral chebyshev for space-time fractional diffusion equation

The line method combined with spectral chebyshev for space-time fractional diffusion equation Apped and Computatona Mathematcs 014; 3(6): 330-336 Pubshed onne December 31, 014 (http://www.scencepubshnggroup.com/j/acm) do: 10.1164/j.acm.0140306.17 ISS: 3-5605 (Prnt); ISS: 3-5613 (Onne) The ne method

More information

REAL-TIME IMPACT FORCE IDENTIFICATION OF CFRP LAMINATED PLATES USING SOUND WAVES

REAL-TIME IMPACT FORCE IDENTIFICATION OF CFRP LAMINATED PLATES USING SOUND WAVES 8 TH INTERNATIONAL CONERENCE ON COMPOSITE MATERIALS REAL-TIME IMPACT ORCE IDENTIICATION O CRP LAMINATED PLATES USING SOUND WAVES S. Atobe *, H. Kobayash, N. Hu 3 and H. ukunaga Department of Aerospace

More information

Structure and Drive Paul A. Jensen Copyright July 20, 2003

Structure and Drive Paul A. Jensen Copyright July 20, 2003 Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.

More information

A DIMENSION-REDUCTION METHOD FOR STOCHASTIC ANALYSIS SECOND-MOMENT ANALYSIS

A DIMENSION-REDUCTION METHOD FOR STOCHASTIC ANALYSIS SECOND-MOMENT ANALYSIS A DIMESIO-REDUCTIO METHOD FOR STOCHASTIC AALYSIS SECOD-MOMET AALYSIS S. Rahman Department of Mechanca Engneerng and Center for Computer-Aded Desgn The Unversty of Iowa Iowa Cty, IA 52245 June 2003 OUTLIE

More information

APPENDIX A Some Linear Algebra

APPENDIX A Some Linear Algebra APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,

More information

Distributed Moving Horizon State Estimation of Nonlinear Systems. Jing Zhang

Distributed Moving Horizon State Estimation of Nonlinear Systems. Jing Zhang Dstrbuted Movng Horzon State Estmaton of Nonnear Systems by Jng Zhang A thess submtted n parta fufment of the requrements for the degree of Master of Scence n Chemca Engneerng Department of Chemca and

More information

Lecture 12: Discrete Laplacian

Lecture 12: Discrete Laplacian Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly

More information

Problem Set 9 Solutions

Problem Set 9 Solutions Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem

More information

LECTURE 21 Mohr s Method for Calculation of General Displacements. 1 The Reciprocal Theorem

LECTURE 21 Mohr s Method for Calculation of General Displacements. 1 The Reciprocal Theorem V. DEMENKO MECHANICS OF MATERIALS 05 LECTURE Mohr s Method for Cacuaton of Genera Dspacements The Recproca Theorem The recproca theorem s one of the genera theorems of strength of materas. It foows drect

More information

The Minimum Universal Cost Flow in an Infeasible Flow Network

The Minimum Universal Cost Flow in an Infeasible Flow Network Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran

More information

On the Equality of Kernel AdaTron and Sequential Minimal Optimization in Classification and Regression Tasks and Alike Algorithms for Kernel

On the Equality of Kernel AdaTron and Sequential Minimal Optimization in Classification and Regression Tasks and Alike Algorithms for Kernel Proceedngs of th European Symposum on Artfca Neura Networks, pp. 25-222, ESANN 2003, Bruges, Begum, 2003 On the Equaty of Kerne AdaTron and Sequenta Mnma Optmzaton n Cassfcaton and Regresson Tasks and

More information

Generalized Linear Methods

Generalized Linear Methods Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set

More information

Approximate Circle Packing in a Rectangular Container: Integer Programming Formulations and Valid Inequalities

Approximate Circle Packing in a Rectangular Container: Integer Programming Formulations and Valid Inequalities Appromate Crce Pacng n a Rectanguar Contaner: Integer Programmng Formuatons and Vad Inequates Igor Ltvnchev, Lus Infante, and Edth Lucero Ozuna Espnosa Department of Mechanca and Eectrca Engneerng Nuevo

More information

Optimal Guaranteed Cost Control of Linear Uncertain Systems with Input Constraints

Optimal Guaranteed Cost Control of Linear Uncertain Systems with Input Constraints Internatona Journa Optma of Contro, Guaranteed Automaton, Cost Contro and Systems, of Lnear vo Uncertan 3, no Systems 3, pp 397-4, wth Input September Constrants 5 397 Optma Guaranteed Cost Contro of Lnear

More information

Subgradient Methods and Consensus Algorithms for Solving Convex Optimization Problems

Subgradient Methods and Consensus Algorithms for Solving Convex Optimization Problems Proceedngs of the 47th IEEE Conference on Decson and Contro Cancun, Mexco, Dec. 9-11, 2008 Subgradent Methods and Consensus Agorthms for Sovng Convex Optmzaton Probems Björn Johansson, Tamás Kevczy, Mae

More information

Delay tomography for large scale networks

Delay tomography for large scale networks Deay tomography for arge scae networks MENG-FU SHIH ALFRED O. HERO III Communcatons and Sgna Processng Laboratory Eectrca Engneerng and Computer Scence Department Unversty of Mchgan, 30 Bea. Ave., Ann

More information

CHAPTER III Neural Networks as Associative Memory

CHAPTER III Neural Networks as Associative Memory CHAPTER III Neural Networs as Assocatve Memory Introducton One of the prmary functons of the bran s assocatve memory. We assocate the faces wth names, letters wth sounds, or we can recognze the people

More information

More metrics on cartesian products

More metrics on cartesian products More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of

More information

Report on Image warping

Report on Image warping Report on Image warpng Xuan Ne, Dec. 20, 2004 Ths document summarzed the algorthms of our mage warpng soluton for further study, and there s a detaled descrpton about the mplementaton of these algorthms.

More information

Uncertainty Specification and Propagation for Loss Estimation Using FOSM Methods

Uncertainty Specification and Propagation for Loss Estimation Using FOSM Methods Uncertanty Specfcaton and Propagaton for Loss Estmaton Usng FOSM Methods J.W. Baer and C.A. Corne Dept. of Cv and Envronmenta Engneerng, Stanford Unversty, Stanford, CA 94305-400 Keywords: Sesmc, oss estmaton,

More information

ON AUTOMATIC CONTINUITY OF DERIVATIONS FOR BANACH ALGEBRAS WITH INVOLUTION

ON AUTOMATIC CONTINUITY OF DERIVATIONS FOR BANACH ALGEBRAS WITH INVOLUTION European Journa of Mathematcs and Computer Scence Vo. No. 1, 2017 ON AUTOMATC CONTNUTY OF DERVATONS FOR BANACH ALGEBRAS WTH NVOLUTON Mohamed BELAM & Youssef T DL MATC Laboratory Hassan Unversty MORO CCO

More information

Research Article H Estimates for Discrete-Time Markovian Jump Linear Systems

Research Article H Estimates for Discrete-Time Markovian Jump Linear Systems Mathematca Probems n Engneerng Voume 213 Artce ID 945342 7 pages http://dxdoorg/11155/213/945342 Research Artce H Estmates for Dscrete-Tme Markovan Jump Lnear Systems Marco H Terra 1 Gdson Jesus 2 and

More information

Winter 2008 CS567 Stochastic Linear/Integer Programming Guest Lecturer: Xu, Huan

Winter 2008 CS567 Stochastic Linear/Integer Programming Guest Lecturer: Xu, Huan Wnter 2008 CS567 Stochastc Lnear/Integer Programmng Guest Lecturer: Xu, Huan Class 2: More Modelng Examples 1 Capacty Expanson Capacty expanson models optmal choces of the tmng and levels of nvestments

More information

A parametric Linear Programming Model Describing Bandwidth Sharing Policies for ABR Traffic

A parametric Linear Programming Model Describing Bandwidth Sharing Policies for ABR Traffic parametrc Lnear Programmng Mode Descrbng Bandwdth Sharng Poces for BR Traffc I. Moschoos, M. Logothets and G. Kokknaks Wre ommuncatons Laboratory, Dept. of Eectrca & omputer Engneerng, Unversty of Patras,

More information

Kernel Methods and SVMs Extension

Kernel Methods and SVMs Extension Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general

More information

A Three-Phase State Estimation in Unbalanced Distribution Networks with Switch Modelling

A Three-Phase State Estimation in Unbalanced Distribution Networks with Switch Modelling A Three-Phase State Estmaton n Unbaanced Dstrbuton Networks wth Swtch Modeng Ankur Majumdar Student Member, IEEE Dept of Eectrca and Eectronc Engneerng Impera Coege London London, UK ankurmajumdar@mperaacuk

More information

Module 9. Lecture 6. Duality in Assignment Problems

Module 9. Lecture 6. Duality in Assignment Problems Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept

More information

An Integrated OR/CP Method for Planning and Scheduling

An Integrated OR/CP Method for Planning and Scheduling An Integrated OR/CP Method for Plannng and Schedulng John Hooer Carnege Mellon Unversty IT Unversty of Copenhagen June 2005 The Problem Allocate tass to facltes. Schedule tass assgned to each faclty. Subect

More information

Discriminating Fuzzy Preference Relations Based on Heuristic Possibilistic Clustering

Discriminating Fuzzy Preference Relations Based on Heuristic Possibilistic Clustering Mutcrtera Orderng and ankng: Parta Orders, Ambgutes and Apped Issues Jan W. Owsńsk and aner Brüggemann, Edtors Dscrmnatng Fuzzy Preerence eatons Based on Heurstc Possbstc Custerng Dmtr A. Vattchenn Unted

More information

The Application of BP Neural Network principal component analysis in the Forecasting the Road Traffic Accident

The Application of BP Neural Network principal component analysis in the Forecasting the Road Traffic Accident ICTCT Extra Workshop, Bejng Proceedngs The Appcaton of BP Neura Network prncpa component anayss n Forecastng Road Traffc Accdent He Mng, GuoXucheng &LuGuangmng Transportaton Coege of Souast Unversty 07

More information

Optimization of JK Flip Flop Layout with Minimal Average Power of Consumption based on ACOR, Fuzzy-ACOR, GA, and Fuzzy-GA

Optimization of JK Flip Flop Layout with Minimal Average Power of Consumption based on ACOR, Fuzzy-ACOR, GA, and Fuzzy-GA Journa of mathematcs and computer Scence 4 (05) - 5 Optmzaton of JK Fp Fop Layout wth Mnma Average Power of Consumpton based on ACOR, Fuzzy-ACOR, GA, and Fuzzy-GA Farshd Kevanan *,, A Yekta *,, Nasser

More information

princeton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg

princeton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there

More information

Solutions to exam in SF1811 Optimization, Jan 14, 2015

Solutions to exam in SF1811 Optimization, Jan 14, 2015 Solutons to exam n SF8 Optmzaton, Jan 4, 25 3 3 O------O -4 \ / \ / The network: \/ where all lnks go from left to rght. /\ / \ / \ 6 O------O -5 2 4.(a) Let x = ( x 3, x 4, x 23, x 24 ) T, where the varable

More information

Xin Li Department of Information Systems, College of Business, City University of Hong Kong, Hong Kong, CHINA

Xin Li Department of Information Systems, College of Business, City University of Hong Kong, Hong Kong, CHINA RESEARCH ARTICLE MOELING FIXE OS BETTING FOR FUTURE EVENT PREICTION Weyun Chen eartment of Educatona Informaton Technoogy, Facuty of Educaton, East Chna Norma Unversty, Shangha, CHINA {weyun.chen@qq.com}

More information

Development of whole CORe Thermal Hydraulic analysis code CORTH Pan JunJie, Tang QiFen, Chai XiaoMing, Lu Wei, Liu Dong

Development of whole CORe Thermal Hydraulic analysis code CORTH Pan JunJie, Tang QiFen, Chai XiaoMing, Lu Wei, Liu Dong Deveopment of whoe CORe Therma Hydrauc anayss code CORTH Pan JunJe, Tang QFen, Cha XaoMng, Lu We, Lu Dong cence and technoogy on reactor system desgn technoogy, Nucear Power Insttute of Chna, Chengdu,

More information

Chapter 6 Hidden Markov Models. Chaochun Wei Spring 2018

Chapter 6 Hidden Markov Models. Chaochun Wei Spring 2018 896 920 987 2006 Chapter 6 Hdden Markov Modes Chaochun We Sprng 208 Contents Readng materas Introducton to Hdden Markov Mode Markov chans Hdden Markov Modes Parameter estmaton for HMMs 2 Readng Rabner,

More information

NONLINEAR SYSTEM IDENTIFICATION BASE ON FW-LSSVM

NONLINEAR SYSTEM IDENTIFICATION BASE ON FW-LSSVM Journa of heoretca and Apped Informaton echnoogy th February 3. Vo. 48 No. 5-3 JAI & LLS. A rghts reserved. ISSN: 99-8645 www.jatt.org E-ISSN: 87-395 NONLINEAR SYSEM IDENIFICAION BASE ON FW-LSSVM, XIANFANG

More information

Greyworld White Balancing with Low Computation Cost for On- Board Video Capturing

Greyworld White Balancing with Low Computation Cost for On- Board Video Capturing reyword Whte aancng wth Low Computaton Cost for On- oard Vdeo Capturng Peng Wu Yuxn Zoe) Lu Hewett-Packard Laboratores Hewett-Packard Co. Pao Ato CA 94304 USA Abstract Whte baancng s a process commony

More information

Application of support vector machine in health monitoring of plate structures

Application of support vector machine in health monitoring of plate structures Appcaton of support vector machne n heath montorng of pate structures *Satsh Satpa 1), Yogesh Khandare ), Sauvk Banerjee 3) and Anrban Guha 4) 1), ), 4) Department of Mechanca Engneerng, Indan Insttute

More information

Resource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud

Resource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud Resource Allocaton wth a Budget Constrant for Computng Independent Tasks n the Cloud Wemng Sh and Bo Hong School of Electrcal and Computer Engneerng Georga Insttute of Technology, USA 2nd IEEE Internatonal

More information

Chapter - 2. Distribution System Power Flow Analysis

Chapter - 2. Distribution System Power Flow Analysis Chapter - 2 Dstrbuton System Power Flow Analyss CHAPTER - 2 Radal Dstrbuton System Load Flow 2.1 Introducton Load flow s an mportant tool [66] for analyzng electrcal power system network performance. Load

More information

Assortment Optimization under MNL

Assortment Optimization under MNL Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.

More information

Composite Hypotheses testing

Composite Hypotheses testing Composte ypotheses testng In many hypothess testng problems there are many possble dstrbutons that can occur under each of the hypotheses. The output of the source s a set of parameters (ponts n a parameter

More information

L-Edge Chromatic Number Of A Graph

L-Edge Chromatic Number Of A Graph IJISET - Internatona Journa of Innovatve Scence Engneerng & Technoogy Vo. 3 Issue 3 March 06. ISSN 348 7968 L-Edge Chromatc Number Of A Graph Dr.R.B.Gnana Joth Assocate Professor of Mathematcs V.V.Vannaperuma

More information

MMA and GCMMA two methods for nonlinear optimization

MMA and GCMMA two methods for nonlinear optimization MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons

More information

Facility Location with Service Installation Costs

Facility Location with Service Installation Costs Facty Locaton wth Servce Instaaton Costs (Extended Abstract) Davd B. Shmoys Chatanya Swamy Retsef Lev Abstract We consder a generazaton of the uncapactated facty ocaton probem whch we ca Facty Locaton

More information

A polynomially solvable case of the pooling problem

A polynomially solvable case of the pooling problem A poynomay sovabe case of the poong probem Natasha Boand Georga Insttute of Technoogy, Atanta, U.S.A. Thomas Kanowsk Faban Rgternk The Unversty of Newcaste, Austraa arxv:1508.03181v4 [math.oc] 5 Apr 2016

More information

Thermodynamics II. Department of Chemical Engineering. Prof. Kim, Jong Hak

Thermodynamics II. Department of Chemical Engineering. Prof. Kim, Jong Hak Thermodynamcs II Department o Chemca ngneerng ro. Km, Jong Hak .5 Fugacty & Fugacty Coecent : ure Speces µ > provdes undamenta crteron or phase equbrum not easy to appy to sove probem Lmtaton o gn (.9

More information

Yong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )

Yong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 ) Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often

More information

Amiri s Supply Chain Model. System Engineering b Department of Mathematics and Statistics c Odette School of Business

Amiri s Supply Chain Model. System Engineering b Department of Mathematics and Statistics c Odette School of Business Amr s Supply Chan Model by S. Ashtab a,, R.J. Caron b E. Selvarajah c a Department of Industral Manufacturng System Engneerng b Department of Mathematcs Statstcs c Odette School of Busness Unversty of

More information

Errors for Linear Systems

Errors for Linear Systems Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch

More information

Price Competition under Linear Demand and Finite Inventories: Contraction and Approximate Equilibria

Price Competition under Linear Demand and Finite Inventories: Contraction and Approximate Equilibria Prce Competton under Lnear Demand and Fnte Inventores: Contracton and Approxmate Equbra Jayang Gao, Krshnamurthy Iyer, Huseyn Topaogu 1 Abstract We consder a compettve prcng probem where there are mutpe

More information

MULTIVARIABLE FUZZY CONTROL WITH ITS APPLICATIONS IN MULTI EVAPORATOR REFRIGERATION SYSTEMS

MULTIVARIABLE FUZZY CONTROL WITH ITS APPLICATIONS IN MULTI EVAPORATOR REFRIGERATION SYSTEMS MULTIVARIABLE FUZZY CONTROL WITH I APPLICATIONS IN MULTI EVAPORATOR REFRIGERATION SYSTEMS LIAO QIANFANG Schoo of Eectrca and Eectronc Engneerng A thess submtted to the Nanyang Technoogca Unversty n parta

More information

VQ widely used in coding speech, image, and video

VQ widely used in coding speech, image, and video at Scalar quantzers are specal cases of vector quantzers (VQ): they are constraned to look at one sample at a tme (memoryless) VQ does not have such constrant better RD perfomance expected Source codng

More information