Technical Note: A Simple Greedy Algorithm for Assortment Optimization in the Two-Level Nested Logit Model
|
|
- Cora Cory Carpenter
- 6 years ago
- Views:
Transcription
1 Techncal Note: A Smple Greedy Algorthm for Assortment Optmzaton n the Two-Level Nested Logt Model Guang L and Paat Rusmevchentong {guangl, rusmevc}@usc.edu September 12, 2012 Abstract We consder the assortment optmzaton problem under the classcal two-level nested logt model. We establsh a necessary and suffcent condton for the optmal assortment, and use ths optmalty condton to develop a smple greedy algorthm that teratvely removes at most one product from each nest, untl the optmalty condton s satsfed. Our algorthm also explots the beautful lumpy structure of the optmal soluton, where n each nest, a certan set of consecutve products wll always appear together n the optmal assortment. The algorthm s smple, ntutve, and extremely fast. For a problem wth m nests, wth each nest havng n products, the runnng tme s On m log m). Ths s the fastest known runnng tme for ths problem. 1. Introducton Snce Tallur and van Ryzn 2004) have shown the mportance of ncorporatng customer choce behavor n operatons management, the assortment optmzaton problem has receved much attenton from researchers. In ths problem, a frm wshes to determne the revenuemaxmzng assortment of products, assumng that a customer chooses a product from an assortment accordng to a dscrete choce model. As shown n an excellent survey by Kök et al. 2006), ths problem has many applcatons n retal and revenue management. Tallur and van Ryzn 2004) consdered the assortment optmzaton problem under the multnomal logt MNL) model, and gave a beautful algorthm for computng the revenuemaxmzng assortment; see also, Gallego et al. 2004); Kunnumkal and Topaloglu 2008); Faras et al. 2012). Although the MNL model admts a tractable soluton, t suffers from the ndependence of rrelevant alternatves property, whch results n based estmates when alternatves are correlated Tran, 2003). The nested logt model generalzes the MNL model 1
2 by groupng smlar alternatves nto a nest and allowng dfferental substtuton patterns wthn and across nests, thereby partally relaxng the ndependence of rrelatve alternatves restrcton Wllams, 1977; McFadden, 1978). Under the nested logt model, a consumer frst chooses a nest of products, and subsequently chooses a product from the chosen nest. Davs et al. 2011) presented a novel soluton to the assortment optmzaton problem under the two-level nested logt model. For the classcal model 1 wth m nests, wth each nest havng n products, they transform the combnatoral optmzaton problem nto an equvalent lnear program wth Onm) constrants and Om) varables 2, enablng them to compute the optmal soluton n On m 4 ) runnng tme. The lnear programmng framework can also be used to obtan approxmaton algorthms for other NP-hard varants of the classcal model. In ths paper, we present an alternatve soluton to the assortment optmzaton problem under the classcal nested logt model. Our approach s based on a smple greedy algorthm that teratvely removes at most) one product from each nest to ncrease the revenue. The greedy algorthm does not requre any lnear program, and t s extremely fast, wth a runnng tme of On m log m). The algorthm makes use of the necessary and suffcent condton for an optmal assortment Theorem 3), whch to our knowledge, s the frst such optmalty condton for ths problem. In addton, our analyss reveals a beautful lumpy structure of the optmal assortment: surprsngly, wthn each nest, a certan set of consecutve products wll always appear together n the optmal soluton. Moreover, as shown n Theorem 4, by lookng at a certan ndex of each product, we can determne n advance whch products wll appear together! Our greedy algorthm explots ths structure to obtan a fast runnng tme. Problem Descrpton: We brefly revew the setup for the classcal two-level nested logt model, along wth the correspondng optmzaton problem. We have m nests ndexed by {1, 2,..., m}, and each nest has n products ndexed by {1, 2,..., n} 3. We denote the dssmlarty factor of nest by τ 0, 1). A product j n nest s denoted by j, and n settngs where the nest ndex s clear from context, we smply refer to t as product j. Each product j has a revenue r j 0 and a preference weght v j > 0. Wthout loss of generalty, we assume that the products n each nest are sorted n a descendng order of revenues; that s, for each nest = 1, 2,..., m, r 1 r 2 r n 0. We denote the preference weght of the no-purchase opton by v 0 > 0. 1 Under the classcal two-level nested logt model McFadden, 1978; Börch-Supan, 1990), the dssmlarty parameter of each nest s between 0 and 1, ensurng that the model s consstent wth random utlty maxmzaton; see, Tallur and van Ryzn 2004) for an overvew of the random utlty theory. We wll also assume that the no-purchase opton appears as a sngle product n ts own nest. 2 Solvng a lnear program wth h constrants and k varables requres Ohk 3 ) operatons Potra and Wrght, 2000). 3 All of the analyss easly extends to the case where some nests have fewer than n products. 2
3 An assortment S = S 1,..., S m ) conssts of products n each nest, wth S {1, 2,..., n} for all. For any assortment S = S 1,..., S m ), the revenue RevS) s gven by: RevS) = m Q S)Rev S ), =1 where Q S) denotes the probablty that a customer chooses a product from nest, and Rev S ) denotes the expected revenue from assortment S n nest, and Q S) = l S v l ) τ v 0 + m ) k=1 l S v τk and Rev S ) = k lk The correspondng optmzaton problem s gven by: l S r l v l l S v l. Z = max S=S 1,...,S m) RevS) and we denote an optmal assortment by S = S 1,..., S m) and let Z = RevS ) denote the optmal revenue. If there are tes, we can choose the optmal assortment accordng to any pre-determned te-breakng rule Characterzaton of the Optmal Assortments Let N + = {{1}, {1, 2},..., {1, 2,..., n}} denote the collecton of revenue-ordered subsets. As shown n the followng lemma, at the optmal soluton, f the nest s nonempty, then the nest s revenue-ordered. The proof follows from Davs et al. 2011), and we omt the detals. Lemma 1 Optmal Nest Structure). For = 1,..., m, f S, then S N +. Although Lemma 1 shows that S { } N + for all, exhaustve search s not feasble because there are n + 1) m possble confguratons of revenue-ordered subsets among m nests. To develop an effcent algorthm, we wll establsh a necessary and suffcent condton for an optmal assortment. For any ntegers k 1 and k 2, let { {k1, k 1 + 1,..., k 2 } f k 1 k 2, [k 1, k 2 ] = otherwse. 4 For example, we can choose S to be the mnmal optmal assortment; that s, there s no other optmal assortment B = B 1,..., B m ) S such that B S for all. All of our analyss apples to other te-breakng rules. 3
4 Also, for each nest and 1 k 1 k 2 n, let G k 1, k 2 ) be defned by: G k 1, k 2 ) = Rev [k 1, k 2 ]) Rev [1, k 2 ]) l [k f 1 1,k 2 ] v ) + Rev [1, k 2 ]), l l [1,k 2 ] v l where f : [0, 1] [0, 1] s defned by: x 1 τ x f x [0, 1) f x) = 1 x τ f x = 1, and t s easy to verfy that f ) s a contnuous, strctly ncreasng functon, wth f 0) = 0. Also, we defne 0/0 = 0, and thus G 1, k 2 ) = Rev [1, k 2 ]) for all k 2. The followng lemma shows that we can use the ndex functon G, ) to determne f a subset can be removed from S to mprove the revenue. The proof s gven n Appendx A. Lemma 2 When s Removng Subsets Benefcal?). For any assortment S = S 1,..., S m ), a collecton of subsets {A S revenue f and only f : = 1, 2,..., m} can be removed from S to acheve a greater m =1 [ V S ) τ Rev S ) V S \ A ) τ Rev S \ A ) ] m =1 [ V S ) τ V S \ A ) τ ] < RevS), where for any set X, V X) denotes the sum of the preference weghts of the products n X. Moreover, f S = [1, p ] wth p 1, A = [k, p ] wth k p, and A l = for all l, then removng A from S leads to a greater revenue f and only f G k, p ) < RevS). The man result of ths secton s the followng theorem, whch establshes a necessary and suffcent condton for an optmal assortment. Ths theorem forms the bass for our greedy algorthm gven n Secton 3. Theorem 3 Optmalty Condton). Consder any assortment S = [1, p 1 ],..., [1, p m ]) such that S [1, p ] for all. Then, S s optmal f and only f for every nest such that p 1, mn G j, p ) RevS). j= 1,..., p Proof. Suppose that S = S 1,..., S m ) s an optmal soluton, where S = [1, p ] for all. If p 1, then S. Snce S s optmal, removng a subset [k, p ] from S cannot mprove the revenue, and thus, t follows from Lemma 2 that G k, p ) RevS) for all k p, whch s the desred result. To establsh suffcency, consder any assortment S = S 1,..., S m ) such that S S = [1, p ] for all, and S satsfes the condton of the theorem. We wll show that RevS) = Z. For 4
5 each, let E = S \ S = [1, p ] \ S = [k, p ] for some ndex k. By our hypothess, for every nest such that E, G k, p ) RevS), whch means that removng E from S does not ncrease the revenue. It then follows from the frst part of Lemma 2 that RevS) V S ) τ Rev S ) V S \ E ) τ Rev S \ E ) V S ) τ V S \ E ) τ, where for any set X, V X) s the sum of the preference weghts of the products n X. Thus, V S ) τ Rev S ) V S \ E ) τ Rev S \ E ) RevS) mn :E V S ) τ V S \ E ) τ :E [V S ) τ Rev S ) V S \ E ) τ Rev S \ E )] :E [V S ) τ V S \ E ) τ, ] where the second nequalty follows because for any x R k and y R k +, and V S ) τ V S \ E ) τ from the frst part of Lemma 2 that P k =1 x P k =1 y mn =1,...,k x 0 for all. Note that f E =, then S = S. It then follows y, RevS) RevS 1 \ E 1, S 2 \ E 2,..., S m \ E m ) = RevS 1,..., S m) = Z, whch s the desred result. Surprsngly, as shown n the followng theorem, the optmal assortment n each nest s lumpy, wth certan consecutve products always appearng together. Moreover, for each nest, by lookng at the ndex G j, j) of each product j, we can determne n advance whch products wll appear together! Theorem 4 Lumpness of the Optmal Assortments). For every nest, f there exst products j and k such that j < k and G j, j) < G j + 1, j + 1) < < G k, k), then ether {j, j + 1,..., k} S, or {j, j + 1,..., k} S =. Proof. It suffces to prove the result when k = j + 1; that s, we need to show that f G j, j) < G j + 1, j + 1), then ether {j, j + 1} S, or {j, j + 1} S =. There are two cases. Case 1: j + 1 S. In ths case, {j, j + 1} S because S N + by Lemma 1. Case 2: j + 1 / S. In ths case, we wll show that j / S. Suppose on contrary that j S. Then, we have that S = [1, j]. Let Ŝ = S 1,..., [1, j + 1],..., S m). By defnton, RevŜ) RevS ), and snce S s obtaned from Ŝ by removng product j + 1 from nest, t 5
6 follows from Lemma 2 that G j + 1, j + 1) RevŜ). So, we have that G j, j) < G j + 1, j + 1) RevŜ) RevS ), whch mples that Rev S 1,..., S \ {j},..., S m) > RevS ). Ths contradcts the optmalty of S. Therefore, j / S. 3. A Greedy Algorthm Our proposed greedy algorthm generates a sequence of assortments { S t : t = 0, 1,... }, termnatng wth an assortment that satsfes the optmalty condton n Theorem 3. In Stage 1 of the algorthm, we explot the lumpness structure of the optmal assortments shown n Theorem 4, by combnng products that wll always appear together nto a sngle group. A formal descrpton of the algorthm s gven as follows. Greedy Algorthm Stage 1 Lumpng): Compute the ndex G j, j) for every product j n every nest. For each nest, f G j, j) < G j + 1, j + 1), then t follows from Theorem 4 that ether {j, j + 1} S or {j, j + 1} S =. Thus, we can combne the two products together, and replace products j and j + 1 wth a sngle new product wth a revenue Rev [j, j + 1]) = v jr j + v j+1, r j+1, v j + v j+1, and a preference weght v j + v j+1,. Assgn the new product the ndex j, and calculate the new G j, j). Repeat ths process untl we obtan a lst of ndces G j, j) that s non-ncreasng n j. Wthout loss of generalty, assume that at the end of Stage 1, each nest has n products such that G 1, 1) G 2, 2) G n, n). Stage 2 Removal): Let S 1 = [1, n],..., [1, n]). For each teraton t 1, gven S t = [1, J t 1 ], [1, J t 2 ],..., [1, J t m] ), let Mn t = mn : J t 1 G J t, J t ) and Index t = arg mn : J t 1 G J t, J t ). If Mn t RevS t ), the algorthm termnates and outputs S t. Otherwse, f Mn t < RevS t ), then the algorthm generates a new assortment S t+1 = S1 t+1,..., Sm t+1 ) as follows: S t+1 = { S t f Index t S t \ {J t } = [1, J t 1] f = Indext Thus, n each teraton, we remove J t from St f G J t, J t ) = Mnt the optmalty condton gven n Theorem 3, that s, G J t, J t ) < RevSt ). and the product J t volates 6
7 The followng lemma shows that S t always contans the optmal assortment. Lemma 5 Contanment). For all t, S S t. Proof. We wll prove ths result by nducton. It s true for t = 1 by our constructon. Suppose that the lemma s true for t; that s, S S t. We wsh to show that S S t+1 for all. Consder an arbtrary nest. There are two cases to consder: S = St and S St. Case 1: Suppose that S = S t = [1, J t]. If J t = 0, then Index t and S t+1 = S t by our constructon. So, suppose that J t 1. Snce Rev S ) RevS1,..., S \ {J t},..., m) S, t follows from Lemma 2 that G J t, J t ) RevS ) RevS t ), where the last nequalty follows from the optmalty of S. Snce G J t, J t ) RevSt ), S t+1 = S t, whch s the desred result. Case 2: Suppose that S St = [1, J t ]. Then, J t / S and J t 1. Snce S N +, we have that S [1, J t 1]. By our constructon, we wll ether remove J t from S t or do nothng, and n both cases, we have S St+1, whch s the desred result. The man result of ths secton s stated n the followng theorem. Theorem 6 Correctness). The Greedy Algorthm termnates wth an optmal assortment, wth a runnng tme of On m log m). Proof. We wll frst establsh the runnng tme of the algorthm. By defnton, G j, j) = r j Rev [1, j]) ) + Rev [1, j]), f 1 v j P j l=1 v l and note that Rev [1, j]) s a convex combnaton of Rev [1, j 1]) and r j. For smplcty, assume that we can compute the functon f x) for each x n constant tme, and thus, by startng from j = 1, we can compute the ndex G j, j) for each product j n each nest n constant tme. Moreover, for each nest, t s easy to verfy that the lumpng process n Stage 1 requres computatons of On) ndces, and at most On) comparsons. Wth m nests, the total runnng tme for Stage 1 s thus Onm). For a detaled proof, see Appendx B. Durng the removal n Stage 2, the algorthm wll contnue to run as long as a sngle product s removed from any nest. There are nm products; thus, the algorthm wll termnate n Onm) teratons. We wll now show that each teraton takes Olog m) operatons. At the begnnng of Stage 2, we create a self-balancng bnary search tree SB-BST) wth m nodes, where for = 1, 2,..., m, node n the tree corresponds to the ndex G n, n). Ths takes Om log m) operatons; see Chapter 6 n Knuth 1998) for more detals. We use the SB- BST as our data structure because such a tree always mantans a heght of Olog m), allowng for an effcent search operaton. In each teraton t 1, we perform the followng 3 operatons: 7
8 SEARCH: The algorthm searches for the nest wth the mnmum ndex G J t, J t ). Ths can be done n Olog m) operatons under the SB-BST. DELETE: If the mnmum ndex G J t, J t ) s greater than or equal to the revenue of the current assortment, the algorthm termnates. Otherwse, the algorthm removes the product J t from St n nest, and also removes node from the tree. The removal s done n Olog m) operatons because the tree may need to re-balance ts heghts. INSERT: If the product J t n nest s removed and J t > 1, the algorthm adds a new node wth a correspondng ndex G J t 1, J t 1) nto the tree. Agan, the nserton of a new node n SB-BST takes Olog m) operatons. Therefore, each teraton n Stage 2 takes Olog m) operatons. As we have Onm) teratons, the total runnng tme s On m log m). Let S = [1, p 1 ],..., [1, p m ]) denote the assortment at the termnaton of the greedy algorthm. By our constructon, for every nest such that p 1, we have G p, p ) RevS). To complete the proof, we wll show that S satsfes the optmalty condton n Theorem 3; that s, for every nest such that p 1, mn G j, p ) RevS). j=1,2,...,p We wll prove ths by contradcton. Suppose on the contrary that the optmalty condton s volated, and mn j=1,2,...,p G j, p ) < RevS). Let k {1, 2,..., p 1} denote the largest ndex where the optmalty condton s volated; that s, and t follows from Lemma 2 that G k, p ) < RevS) G k + 1, p ), RevS 1,..., S \ [k, p ],..., S m ) > RevS) RevS 1,..., S \ [k + 1, p ],..., S m ) Note that S \ [k, p ] = [1, k 1] and S \ [k + 1, p ] = [1, k ]. Thus, removng product k from [1, k ] n nest ncreases the revenue, and t follows from Lemma 2 that G k, k ) < RevS 1,..., S \ [k + 1, p ],..., S m ) RevS). Snce we lump the products n Stage 1 so that G 1, 1) G p, p ) and k < p, we have G p, p ) G k, k ) < RevS), whch contradcts our hypothess on p! Therefore, mn j=1,2,...,p G j, p ) RevS). Numercal Results: We conduct small numercal experments to compare the runnng tme of our greedy algorthm wth the lnear programmng formulaton of Davs et al. 2011). 8
9 We consder 9 problem classes, where each problem class s characterzed by the number of nests m, and the number of products n n each nest, wth m, n) {10, 50, 100} {10, 50, 100}. For each problem class m, n), we generate 1000 ndependent problem nstances, and for each nstance, r j are sampled from a unform dstrbuton on the nterval [0, 20], v j are unformly dstrbuted on [0, 10], v 0 s unformly dstrbuted on [0, 5], and fnally, the dssmlarty parameter τ for each nest s drawn from a unform dstrbuton on [0, 1]. Table 1 shows the average runnng tme for each problem class. To solve the lnear program, we use the MATLAB LP Solver, and t turns out that both the nteror pont and smplex methods have roughly comparable runnng tmes, so we report only the runnng tme from the nteror pont method. For the greedy algorthm, to smplfy our mplementaton, we use a standard array of sze m to mplement Stage 2, nstead of the self-balancng bnary search tree 5. Even wth ths smple mplementaton, our greedy algorthm stll outperforms the LP n all problem nstances. In columns 3 and 4 of Table 1, we show the average runnng tme n seconds for each problem class. We observe that the greedy algorthm s, on average, faster than the LP by an order of magntude. We also want to compare the runnng tme on every problem nstance. So, for each problem nstance, we compute the rato between the runnng tme of LP and the runnng tme of greedy, and report the mnmum, medan, and maxmum of these ratos n columns 5, 6, and 7. Snce the mnmum s at least 2.2, we see that the greedy s always at least twce as fast as the LP, n every problem nstance. In fact, for large problem nstances, the greedy can be up to 99 tmes faster than the LP. Problem Avg. Runnng Tme Rato Between the LP and Greedy Class n seconds) Runnng Tmes for Each Problem Instance m n LP Greedy Mnmum Medan Maxmum Table 1: Columns 3 and 4 show the average runnng tme n seconds for the LP and greedy algorthms. All numbers are statstcally sgnfcant at 5%. We also consder the rato between the LP and greedy runnng tmes for each problem nstance, and the statstcs of these ratos are reported n columns 5, 6, and 7. 5 By usng the standard array of sze m, the runnng tme of the greedy algorthm ncreases to Onm 2 ) because n each teraton of Stage 2, searchng for the mnmum ndex requres Om) operatons, nstead of Olog m) under the self-balancng bnary search tree. 9
10 4. Concluson We present a smple and fast greedy algorthm for the assortment optmzaton problem under the classcal two-level nested logt model. Our algorthm makes use of the optmalty condton, and explot the lumpy structure of the optmal assortment. As a drecton for future research, t would be nterestng to explore whether the optmalty condton can be establshed for more general choce models, or f a smlar lumpy structure exsts for other choce models. Acknowledgement We would lke to thank Huseyn Topaloglu for ntroducng us to the surprsng connecton between the assortment optmzaton problem under the two-level nested logt model and ts equvalent lnear programmng formulaton. Hs work has nspred us to consder the problem n ths paper. References Börch-Supan, A On the compatblty of nested logt models wth utlty maxmzaton. Journal of Econometrcs 43 3): Davs, J. M., G. Gallego, and H. Topaloglu Assortment optmzaton under varants of the nested logt model. Workng paper, Cornell Unversty. Faras, V. F., S. Jagabathula, and D. Shah Assortment optmzaton under a nonparametrc choce model. Workng Paper, MIT. Gallego, G., G. Iyengar, R. Phllps, and A. Dubey Managng flexble products on a network. Workng Paper, Columba Unversty. Knuth, D. E The Art of Computer Programmng, Volume 3. New York: Addson Wesley Longman Publshng Co., Inc. Kök, A. G., M. Fsher, and R. Vadyanathan Assortment plannng: Revew of lterature and ndustry practce. In Retal Supply Chan Management. New York: Sprnger. Kunnumkal, S., and H. Topaloglu A refned determnstc lnear program for the network revenue management problem wth customer choce behavor. Naval Research Logstcs 55 6): McFadden, D Modelng the choce of resdental locaton. Transportaton Research Record 672): Potra, F. A., and S. J. Wrght Interor-pont methods. Journal of Computatonal and Appled Mathematcs 124 2): Tallur, K., and G. J. van Ryzn Revenue management under a general dscrete choce model of consumer behavor. Management Scence 50 1): Tallur, K., and G. J. van Ryzn The theory and practce of revenue management. New York: Sprnger. Tran, K Dscrete Choce Methods wth Smulaton. New York, NY: Cambrdge Unversty Press. Wllams, H. C. W. L On the formaton of travel demand models and economc evaluaton measures of user beneft. Envronment and Plannng. Envronment and Plannng A 9 3):
11 A. Proof of Lemma 2 Proof. For = 1,..., m, let Ŝ = S \ A. Assume that A for some ; otherwse, the result s trvally true. Snce v j > 0 for all j, m =1 V Ŝ) < m =1 V S ). By defnton, RevS) = = = m =1 V S ) τ Rev S ) v 0 + m =1 V S ) τ v 0 + m =1 V Ŝ) τ ) [ ] m m v 0 + m =1 V S ) τ =1 V Ŝ) τ Rev Ŝ) v 0 + =1 V S ) τ Rev S ) V Ŝ) τ Rev Ŝ) m =1 V Ŝ) + τ v 0 + m =1 V S ) τ v 0 + ) m =1 V Ŝ) τ v 0 + m =1 V S ) τ RevŜ) [ ] m =1 V S ) τ V Ŝ) τ [ ] m + v 0 + =1 V S ) τ Rev S ) V Ŝ) τ Rev Ŝ) m =1 V S ) τ [ ] m =1 V S ) τ V Ŝ ) τ Thus, RevS) s a convex combnaton of RevŜ) and P m =1[ V S ) τ Rev S ) V b S ) τ Rev b S ) ] P m =1[ V S ) τ V b S ) τ ], whch gves the desred result. Suppose that S = [1, p ], A = [k, p ], and A l = for all l. Usng the fact that ) Rev Ŝ) = V S ) V S b Rev S ) + 1 V S ) ) V S b Rev A ), and that ) f 1 V A ) ) ) V Ŝ) = f V S ) V S ) = ) V S b 1 τ ) V S ) V S b ) V S ) 1 V b S ) V S ) = V S ) τ V Ŝ) τ V Ŝ) τ 1 V S ) V Ŝ) τ, we have V S ) τ Rev S ) V Ŝ) τ Rev Ŝ) ) ) = V S ) τ V Ŝ) τ 1 V S ) Rev S ) + V Ŝ) τ 1 V S ) V Ŝ) τ Rev A ) ) = V S ) τ V Ŝ) τ + V Ŝ) τ V Ŝ) τ 1 V S ) Rev S ) + V Ŝ) τ 1 V S ) V Ŝ) τ = V S ) τ V Ŝ) ) [ ) τ V Ŝ) τ 1 V S ) V Ŝ) τ ] Rev A ) Rev S )) + Rev S ) V S ) τ V Ŝ ) τ ) [ ] = V S ) τ V Ŝ) τ Rev A ) Rev S ) ) + Rev S ) = V S ) τ V Ŝ) τ f 1 V A ) V S ) ) G k, p ). ) Rev A ) Therefore V S ) τ Rev S ) V Ŝ) τ Rev Ŝ) V S ) τ V Ŝ ) τ f and only f G k, p ) < RevS). < RevS) 11
12 B. Complexty of the Lumpng Step Stage 1) Proof. For each nest, t suffces to show that the lumpng process n Stage 1 takes On) operatons, n order to create a lst of ndces G j, j) that s non-ncreasng n j. The lumpng process requres two types of operatons: 1) comparson between two ndces, and 2) mergng of two products, whch requres the computaton of the new value of G, ). For smplcty, we assume that computng the ndex G, ) takes constant tme. Whenever we merge two nodes to create a new one, the total number of nodes s reduced by one. Snce we start wth n nodes, the number of mergngs s at most n 1. To complete the proof, we wll show that the number of comparsons s at most On), by creatng a drected graph that keeps track of the total number of comparsons. Create a node j for each product j {1, 2,..., n} n nest. Place these nodes from left to rght n an ncreasng order of ndex, so node 1 wll be the leftmost node, followed by node 2, and node n wll be the rghtmost node. We refer to these n nodes as the orgnal nodes. For each node j, let j l and j r represent the adjacent nodes, on the left and rght of node j, respectvely. Whenever we compare G j, j) wth G k, k), we add a drected edge j, k) from node j to node k. We say that a volaton occurs f G j, j) < G j r, j r ). We start from the left most node node 1). When we are at the orgnal node j, we compare G j, j) wth G j + 1, j + 1), and add an edge j, j + 1). If no volaton occurs, then G j, j) G j + 1, j + 1), and we proceed forward to node j + 1. On the other hand, f a volaton occurs, then we must merge products j and j + 1 together. Ths s done by removng both nodes j and j + 1, and replace them wth a new node j, and we calculate the new ndex G j, j ). Whenever we create a new node j, to ensure the correct orderng of ndces, we need to compare G j, j ) wth the value of ts left adjacent node, denoted by j l. So, when a new node j s created, we add a backward edge j, j l ). If a volaton occurs, we replace both nodes j and j l wth a new node. Otherwse, we have the correct orderng, and we compare node j wth ts rght neghbor j r, and of course, add an edge j, j r) to keep track of ths comparson. The process stops when all exstng nodes are connected and no volaton occurs. Each of the n orgnal nodes except for the rghtmost node) has at most one outgong edge to ts rght neghbor. Moreover, each newly created node has at most two outgong edges one to ts left neghbor and another to ts rght). Snce a new node s created only when a mergng occurs, there are at most n 1 new nodes. Therefore, the total number of edges s bounded by n 1) + 2n 1) = 3n 1), and thus, the total number of comparsons s On). 12
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 informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationAssortment 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 informationAssortment Optimization under the Paired Combinatorial Logit Model
Assortment Optmzaton under the Pared Combnatoral Logt Model Heng Zhang, Paat Rusmevchentong Marshall School of Busness, Unversty of Southern Calforna, Los Angeles, CA 90089 hengz@usc.edu, rusmevc@marshall.usc.edu
More informationSingle-Facility Scheduling over Long Time Horizons by Logic-based Benders Decomposition
Sngle-Faclty Schedulng over Long Tme Horzons by Logc-based Benders Decomposton Elvn Coban and J. N. Hooker Tepper School of Busness, Carnege Mellon Unversty ecoban@andrew.cmu.edu, john@hooker.tepper.cmu.edu
More informationTechnical Note: Capacity Constraints Across Nests in Assortment Optimization Under the Nested Logit Model
Techncal Note: Capacty Constrants Across Nests n Assortment Optmzaton Under the Nested Logt Model Jacob B. Feldman, Huseyn Topaloglu School of Operatons Research and Informaton Engneerng, Cornell Unversty,
More informationCapacity Constraints Across Nests in Assortment Optimization Under the Nested Logit Model
Capacty Constrants Across Nests n Assortment Optmzaton Under the Nested Logt Model Jacob B. Feldman School of Operatons Research and Informaton Engneerng, Cornell Unversty, Ithaca, New York 14853, USA
More informationMMA 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 informationSimultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals
Smultaneous Optmzaton of Berth Allocaton, Quay Crane Assgnment and Quay Crane Schedulng Problems n Contaner Termnals Necat Aras, Yavuz Türkoğulları, Z. Caner Taşkın, Kuban Altınel Abstract In ths work,
More informationOn 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 informationThe 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 informationSome modelling aspects for the Matlab implementation of MMA
Some modellng aspects for the Matlab mplementaton of MMA Krster Svanberg krlle@math.kth.se Optmzaton and Systems Theory Department of Mathematcs KTH, SE 10044 Stockholm September 2004 1. Consdered optmzaton
More informationCalculation of time complexity (3%)
Problem 1. (30%) Calculaton of tme complexty (3%) Gven n ctes, usng exhaust search to see every result takes O(n!). Calculaton of tme needed to solve the problem (2%) 40 ctes:40! dfferent tours 40 add
More informationApproximation Methods for Pricing Problems under the Nested Logit Model with Price Bounds
Approxmaton Methods for Prcng Problems under the Nested Logt Model wth Prce Bounds W. Zachary Rayfeld School of Operatons Research and Informaton Engneerng, Cornell Unversty, Ithaca, New York 14853, USA
More informationChapter - 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 information4 Analysis of Variance (ANOVA) 5 ANOVA. 5.1 Introduction. 5.2 Fixed Effects ANOVA
4 Analyss of Varance (ANOVA) 5 ANOVA 51 Introducton ANOVA ANOVA s a way to estmate and test the means of multple populatons We wll start wth one-way ANOVA If the populatons ncluded n the study are selected
More informationVARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES
VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES BÂRZĂ, Slvu Faculty of Mathematcs-Informatcs Spru Haret Unversty barza_slvu@yahoo.com Abstract Ths paper wants to contnue
More informationErrors 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 informationprinceton 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 informationComputing Correlated Equilibria in Multi-Player Games
Computng Correlated Equlbra n Mult-Player Games Chrstos H. Papadmtrou Presented by Zhanxang Huang December 7th, 2005 1 The Author Dr. Chrstos H. Papadmtrou CS professor at UC Berkley (taught at Harvard,
More informationU.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016
U.C. Berkeley CS94: Spectral Methods and Expanders Handout 8 Luca Trevsan February 7, 06 Lecture 8: Spectral Algorthms Wrap-up In whch we talk about even more generalzatons of Cheeger s nequaltes, and
More informationLecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
More informationStanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011
Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected
More informationNotes on Frequency Estimation in Data Streams
Notes on Frequency Estmaton n Data Streams In (one of) the data streamng model(s), the data s a sequence of arrvals a 1, a 2,..., a m of the form a j = (, v) where s the dentty of the tem and belongs to
More informationYong 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 informationAn Interactive Optimisation Tool for Allocation Problems
An Interactve Optmsaton ool for Allocaton Problems Fredr Bonäs, Joam Westerlund and apo Westerlund Process Desgn Laboratory, Faculty of echnology, Åbo Aadem Unversty, uru 20500, Fnland hs paper presents
More informationMaximizing the number of nonnegative subsets
Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum
More informationNumerical Heat and Mass Transfer
Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More informationFor now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results.
Neural Networks : Dervaton compled by Alvn Wan from Professor Jtendra Malk s lecture Ths type of computaton s called deep learnng and s the most popular method for many problems, such as computer vson
More informationModule 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 informationLecture 10 Support Vector Machines II
Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed
More informationChapter 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 informationMin Cut, Fast Cut, Polynomial Identities
Randomzed Algorthms, Summer 016 Mn Cut, Fast Cut, Polynomal Identtes Instructor: Thomas Kesselhem and Kurt Mehlhorn 1 Mn Cuts n Graphs Lecture (5 pages) Throughout ths secton, G = (V, E) s a mult-graph.
More informationAn (almost) unbiased estimator for the S-Gini index
An (almost unbased estmator for the S-Gn ndex Thomas Demuynck February 25, 2009 Abstract Ths note provdes an unbased estmator for the absolute S-Gn and an almost unbased estmator for the relatve S-Gn for
More informationA PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS
HCMC Unversty of Pedagogy Thong Nguyen Huu et al. A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS Thong Nguyen Huu and Hao Tran Van Department of mathematcs-nformaton,
More informationEstimation: Part 2. Chapter GREG estimation
Chapter 9 Estmaton: Part 2 9. GREG estmaton In Chapter 8, we have seen that the regresson estmator s an effcent estmator when there s a lnear relatonshp between y and x. In ths chapter, we generalzed the
More informationFinding Primitive Roots Pseudo-Deterministically
Electronc Colloquum on Computatonal Complexty, Report No 207 (205) Fndng Prmtve Roots Pseudo-Determnstcally Ofer Grossman December 22, 205 Abstract Pseudo-determnstc algorthms are randomzed search algorthms
More informationFeature Selection: Part 1
CSE 546: Machne Learnng Lecture 5 Feature Selecton: Part 1 Instructor: Sham Kakade 1 Regresson n the hgh dmensonal settng How do we learn when the number of features d s greater than the sample sze n?
More informationWinter 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 informationNP-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 informationFoundations of Arithmetic
Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an
More informationEdge Isoperimetric Inequalities
November 7, 2005 Ross M. Rchardson Edge Isopermetrc Inequaltes 1 Four Questons Recall that n the last lecture we looked at the problem of sopermetrc nequaltes n the hypercube, Q n. Our noton of boundary
More informationPricing Problems under the Nested Logit Model with a Quality Consistency Constraint
Prcng Problems under the Nested Logt Model wth a Qualty Consstency Constrant James M. Davs, Huseyn Topaloglu, Davd P. Wllamson 1 Aprl 28, 2015 Abstract We consder prcng problems when customers choose among
More informationEEL 6266 Power System Operation and Control. Chapter 3 Economic Dispatch Using Dynamic Programming
EEL 6266 Power System Operaton and Control Chapter 3 Economc Dspatch Usng Dynamc Programmng Pecewse Lnear Cost Functons Common practce many utltes prefer to represent ther generator cost functons as sngle-
More informationSolutions 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 informationA New Refinement of Jacobi Method for Solution of Linear System Equations AX=b
Int J Contemp Math Scences, Vol 3, 28, no 17, 819-827 A New Refnement of Jacob Method for Soluton of Lnear System Equatons AX=b F Naem Dafchah Department of Mathematcs, Faculty of Scences Unversty of Gulan,
More informationA Simple Inventory System
A Smple Inventory System Lawrence M. Leems and Stephen K. Park, Dscrete-Event Smulaton: A Frst Course, Prentce Hall, 2006 Hu Chen Computer Scence Vrgna State Unversty Petersburg, Vrgna February 8, 2017
More information3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X
Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number
More information18.1 Introduction and Recap
CS787: Advanced Algorthms Scrbe: Pryananda Shenoy and Shjn Kong Lecturer: Shuch Chawla Topc: Streamng Algorthmscontnued) Date: 0/26/2007 We contnue talng about streamng algorthms n ths lecture, ncludng
More informationResource 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 informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationLecture 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 informationCS : Algorithms and Uncertainty Lecture 17 Date: October 26, 2016
CS 29-128: Algorthms and Uncertanty Lecture 17 Date: October 26, 2016 Instructor: Nkhl Bansal Scrbe: Mchael Denns 1 Introducton In ths lecture we wll be lookng nto the secretary problem, and an nterestng
More informationHashing. Alexandra Stefan
Hashng Alexandra Stefan 1 Hash tables Tables Drect access table (or key-ndex table): key => ndex Hash table: key => hash value => ndex Man components Hash functon Collson resoluton Dfferent keys mapped
More informationAPPENDIX 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 informationSupplement: Proofs and Technical Details for The Solution Path of the Generalized Lasso
Supplement: Proofs and Techncal Detals for The Soluton Path of the Generalzed Lasso Ryan J. Tbshran Jonathan Taylor In ths document we gve supplementary detals to the paper The Soluton Path of the Generalzed
More informationfind (x): given element x, return the canonical element of the set containing x;
COS 43 Sprng, 009 Dsjont Set Unon Problem: Mantan a collecton of dsjont sets. Two operatons: fnd the set contanng a gven element; unte two sets nto one (destructvely). Approach: Canoncal element method:
More informationThe Study of Teaching-learning-based Optimization Algorithm
Advanced Scence and Technology Letters Vol. (AST 06), pp.05- http://dx.do.org/0.57/astl.06. The Study of Teachng-learnng-based Optmzaton Algorthm u Sun, Yan fu, Lele Kong, Haolang Q,, Helongang Insttute
More informationLecture 11. minimize. c j x j. j=1. 1 x j 0 j. +, b R m + and c R n +
Topcs n Theoretcal Computer Scence May 4, 2015 Lecturer: Ola Svensson Lecture 11 Scrbes: Vncent Eggerlng, Smon Rodrguez 1 Introducton In the last lecture we covered the ellpsod method and ts applcaton
More informationCOS 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 informationModule 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 informationGeneralized 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 informationCase A. P k = Ni ( 2L i k 1 ) + (# big cells) 10d 2 P k.
THE CELLULAR METHOD In ths lecture, we ntroduce the cellular method as an approach to ncdence geometry theorems lke the Szemeréd-Trotter theorem. The method was ntroduced n the paper Combnatoral complexty
More informationANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)
Econ 413 Exam 13 H ANSWERS Settet er nndelt 9 deloppgaver, A,B,C, som alle anbefales å telle lkt for å gøre det ltt lettere å stå. Svar er gtt . Unfortunately, there s a prntng error n the hnt of
More informationTornado and Luby Transform Codes. Ashish Khisti Presentation October 22, 2003
Tornado and Luby Transform Codes Ashsh Khst 6.454 Presentaton October 22, 2003 Background: Erasure Channel Elas[956] studed the Erasure Channel β x x β β x 2 m x 2 k? Capacty of Noseless Erasure Channel
More informationMarkov Chain Monte Carlo (MCMC), Gibbs Sampling, Metropolis Algorithms, and Simulated Annealing Bioinformatics Course Supplement
Markov Chan Monte Carlo MCMC, Gbbs Samplng, Metropols Algorthms, and Smulated Annealng 2001 Bonformatcs Course Supplement SNU Bontellgence Lab http://bsnuackr/ Outlne! Markov Chan Monte Carlo MCMC! Metropols-Hastngs
More informationOn a direct solver for linear least squares problems
ISSN 2066-6594 Ann. Acad. Rom. Sc. Ser. Math. Appl. Vol. 8, No. 2/2016 On a drect solver for lnear least squares problems Constantn Popa Abstract The Null Space (NS) algorthm s a drect solver for lnear
More informationSpeeding up Computation of Scalar Multiplication in Elliptic Curve Cryptosystem
H.K. Pathak et. al. / (IJCSE) Internatonal Journal on Computer Scence and Engneerng Speedng up Computaton of Scalar Multplcaton n Ellptc Curve Cryptosystem H. K. Pathak Manju Sangh S.o.S n Computer scence
More informationGrover s Algorithm + Quantum Zeno Effect + Vaidman
Grover s Algorthm + Quantum Zeno Effect + Vadman CS 294-2 Bomb 10/12/04 Fall 2004 Lecture 11 Grover s algorthm Recall that Grover s algorthm for searchng over a space of sze wors as follows: consder the
More informationThe 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 informationHMMT February 2016 February 20, 2016
HMMT February 016 February 0, 016 Combnatorcs 1. For postve ntegers n, let S n be the set of ntegers x such that n dstnct lnes, no three concurrent, can dvde a plane nto x regons (for example, S = {3,
More informationExercises. 18 Algorithms
18 Algorthms Exercses 0.1. In each of the followng stuatons, ndcate whether f = O(g), or f = Ω(g), or both (n whch case f = Θ(g)). f(n) g(n) (a) n 100 n 200 (b) n 1/2 n 2/3 (c) 100n + log n n + (log n)
More informationA 2D Bounded Linear Program (H,c) 2D Linear Programming
A 2D Bounded Lnear Program (H,c) h 3 v h 8 h 5 c h 4 h h 6 h 7 h 2 2D Lnear Programmng C s a polygonal regon, the ntersecton of n halfplanes. (H, c) s nfeasble, as C s empty. Feasble regon C s unbounded
More informationInteractive Bi-Level Multi-Objective Integer. Non-linear Programming Problem
Appled Mathematcal Scences Vol 5 0 no 65 3 33 Interactve B-Level Mult-Objectve Integer Non-lnear Programmng Problem O E Emam Department of Informaton Systems aculty of Computer Scence and nformaton Helwan
More informationOutline and Reading. Dynamic Programming. Dynamic Programming revealed. Computing Fibonacci. The General Dynamic Programming Technique
Outlne and Readng Dynamc Programmng The General Technque ( 5.3.2) -1 Knapsac Problem ( 5.3.3) Matrx Chan-Product ( 5.3.1) Dynamc Programmng verson 1.4 1 Dynamc Programmng verson 1.4 2 Dynamc Programmng
More informationConvex Optimization. Optimality conditions. (EE227BT: UC Berkeley) Lecture 9 (Optimality; Conic duality) 9/25/14. Laurent El Ghaoui.
Convex Optmzaton (EE227BT: UC Berkeley) Lecture 9 (Optmalty; Conc dualty) 9/25/14 Laurent El Ghaou Organsatonal Mdterm: 10/7/14 (1.5 hours, n class, double-sded cheat sheet allowed) Project: Intal proposal
More informationLearning Theory: Lecture Notes
Learnng Theory: Lecture Notes Lecturer: Kamalka Chaudhur Scrbe: Qush Wang October 27, 2012 1 The Agnostc PAC Model Recall that one of the constrants of the PAC model s that the data dstrbuton has to be
More informationAmiri 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 informationA Robust Method for Calculating the Correlation Coefficient
A Robust Method for Calculatng the Correlaton Coeffcent E.B. Nven and C. V. Deutsch Relatonshps between prmary and secondary data are frequently quantfed usng the correlaton coeffcent; however, the tradtonal
More informationLinear Approximation with Regularization and Moving Least Squares
Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...
More informationA Hybrid Variational Iteration Method for Blasius Equation
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 1 (June 2015), pp. 223-229 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) A Hybrd Varatonal Iteraton Method
More informationLecture 3 January 31, 2017
CS 224: Advanced Algorthms Sprng 207 Prof. Jelan Nelson Lecture 3 January 3, 207 Scrbe: Saketh Rama Overvew In the last lecture we covered Y-fast tres and Fuson Trees. In ths lecture we start our dscusson
More informationFinding Dense Subgraphs in G(n, 1/2)
Fndng Dense Subgraphs n Gn, 1/ Atsh Das Sarma 1, Amt Deshpande, and Rav Kannan 1 Georga Insttute of Technology,atsh@cc.gatech.edu Mcrosoft Research-Bangalore,amtdesh,annan@mcrosoft.com Abstract. Fndng
More information2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification
E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton
More informationWelfare Properties of General Equilibrium. What can be said about optimality properties of resource allocation implied by general equilibrium?
APPLIED WELFARE ECONOMICS AND POLICY ANALYSIS Welfare Propertes of General Equlbrum What can be sad about optmalty propertes of resource allocaton mpled by general equlbrum? Any crteron used to compare
More informationO-line Temporary Tasks Assignment. Abstract. In this paper we consider the temporary tasks assignment
O-lne Temporary Tasks Assgnment Yoss Azar and Oded Regev Dept. of Computer Scence, Tel-Avv Unversty, Tel-Avv, 69978, Israel. azar@math.tau.ac.l??? Dept. of Computer Scence, Tel-Avv Unversty, Tel-Avv, 69978,
More informationn ). This is tight for all admissible values of t, k and n. k t + + n t
MAXIMIZING THE NUMBER OF NONNEGATIVE SUBSETS NOGA ALON, HAROUT AYDINIAN, AND HAO HUANG Abstract. Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what
More informationSingular Value Decomposition: Theory and Applications
Sngular Value Decomposton: Theory and Applcatons Danel Khashab Sprng 2015 Last Update: March 2, 2015 1 Introducton A = UDV where columns of U and V are orthonormal and matrx D s dagonal wth postve real
More informationDynamic Programming. Preview. Dynamic Programming. Dynamic Programming. Dynamic Programming (Example: Fibonacci Sequence)
/24/27 Prevew Fbonacc Sequence Longest Common Subsequence Dynamc programmng s a method for solvng complex problems by breakng them down nto smpler sub-problems. It s applcable to problems exhbtng the propertes
More informationIntroductory Cardinality Theory Alan Kaylor Cline
Introductory Cardnalty Theory lan Kaylor Clne lthough by name the theory of set cardnalty may seem to be an offshoot of combnatorcs, the central nterest s actually nfnte sets. Combnatorcs deals wth fnte
More informationDesign and Analysis of Algorithms
Desgn and Analyss of Algorthms CSE 53 Lecture 4 Dynamc Programmng Junzhou Huang, Ph.D. Department of Computer Scence and Engneerng CSE53 Desgn and Analyss of Algorthms The General Dynamc Programmng Technque
More informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationLOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin
Proceedngs of the 007 Wnter Smulaton Conference S G Henderson, B Bller, M-H Hseh, J Shortle, J D Tew, and R R Barton, eds LOW BIAS INTEGRATED PATH ESTIMATORS James M Calvn Department of Computer Scence
More informationAppendix for Causal Interaction in Factorial Experiments: Application to Conjoint Analysis
A Appendx for Causal Interacton n Factoral Experments: Applcaton to Conjont Analyss Mathematcal Appendx: Proofs of Theorems A. Lemmas Below, we descrbe all the lemmas, whch are used to prove the man theorems
More informationVolume 18 Figure 1. Notation 1. Notation 2. Observation 1. Remark 1. Remark 2. Remark 3. Remark 4. Remark 5. Remark 6. Theorem A [2]. Theorem B [2].
Bulletn of Mathematcal Scences and Applcatons Submtted: 016-04-07 ISSN: 78-9634, Vol. 18, pp 1-10 Revsed: 016-09-08 do:10.1805/www.scpress.com/bmsa.18.1 Accepted: 016-10-13 017 ScPress Ltd., Swtzerland
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 12 10/21/2013. Martingale Concentration Inequalities and Applications
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.65/15.070J Fall 013 Lecture 1 10/1/013 Martngale Concentraton Inequaltes and Applcatons Content. 1. Exponental concentraton for martngales wth bounded ncrements.
More informationThe lower and upper bounds on Perron root of nonnegative irreducible matrices
Journal of Computatonal Appled Mathematcs 217 (2008) 259 267 wwwelsevercom/locate/cam The lower upper bounds on Perron root of nonnegatve rreducble matrces Guang-Xn Huang a,, Feng Yn b,keguo a a College
More informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationComplete subgraphs in multipartite graphs
Complete subgraphs n multpartte graphs FLORIAN PFENDER Unverstät Rostock, Insttut für Mathematk D-18057 Rostock, Germany Floran.Pfender@un-rostock.de Abstract Turán s Theorem states that every graph G
More information