Research Article Competition and Integration in Closed-Loop Supply Chain Network with Variational Inequality
|
|
- Gabriella Simmons
- 8 years ago
- Views:
Transcription
1 Hndaw Publshng Cororaton Mathematcal Problems n Engneerng Volume 2012, Artcle ID , 21 ages do: /2012/ Research Artcle Cometton and Integraton n Closed-Loo Suly Chan Network wth Varatonal Inequalty Gengu Zhou, 1 Yuxang Yang, 2 and Jan Cao 1 1 School of Busness Admnstraton, Zheang Unversty of Technology, Hangzhou , Chna 2 College of Economcs and Management, Chna Jlang Unversty, Hangzhou , Chna Corresondence should be addressed to Gengu Zhou, ggzhou@zut.edu.cn Receved 11 Arl 2012; Acceted 25 May 2012 Academc Edtor: Yung Wang Coyrght q 2012 Gengu Zhou et al. Ths s an oen access artcle dstrbuted under the Creatve Commons Attrbuton Lcense, whch ermts unrestrcted use, dstrbuton, and reroducton n any medum, rovded the orgnal work s roerly cted. A closed-loo suly chan network nvolves the manufactured and remanufactured homogeneous roducts. It comrses oeraton lnks to reresent busness actvtes ncludng manufacturng/remanufacturng actvtes, treatment actvtes for EOL roducts, transortaton actvtes, and storage actvtes, whch are erformed by the frms. Among all closed-loo suly chan roblems, the horzontal merger of olgoolstc frms s so mortant and attractng to both busnessman and researchers. In ths aer, the nteracton of the comettve frms ror to horzontal merger s analyzed. Three networks ncludng ror to horzontal merger, ostartal merger, and comlete merger are studed. Smultaneously, three economcal models for these networks on dfferent condtons of mergers are establshed and dscussed. The varatonal nequalty formulatons are used for these three models, whose solutons gve out the roducton quantty of new roducts, and remanufactured roducts, the roduct flows for new roducts, remanufactured roducts and end-of-lfe roducts at every ath, the demand quantty, the recovery quantty of end-of-lfe roducts and the equlbrum rces. Fnally, numercal examles are tested and llustrated for the roosed models. 1. Introducton In lght of ncreasng envronmental conscousness and strcter legslaton, dsosal of lentful EOL end-of-lfe roducts becomes a crtcal roblem. EOL roduct recovery ams to mnmze the amount of waste sent to landflls by recoverng materals and arts from old or outdated roducts by means of recyclng and remanufacturng 1. Nowadays, EOL roduct recovery has become an oblgaton to the envronment and to the socety tself. Hence, more and more countres extend manufacturers resonsblty and requre them to take back the EOL roducts. Ths concern for the envronment has motvated ncreased
2 2 Mathematcal Problems n Engneerng nterest n reverse logstcs arose from EOL roduct recovery, whch has become the subect of growng attenton over the last decade 2. In an effort to curb olluton and acheve the goal of sustanable develoment, some measures have been roosed n Chna to romote the traded-n of the automobles and home alances coverng fve tyes of commodtes: TV, refrgerator, washng machne, ar condtoner, and comuter. The tral onts of traded-n comrse Beng, Shangha, Tann, Jangsu, Zheang, Shandong, Guangdong, Fuzhou, and Changsha. The consumers who urchase new home alances and meet the requrements of subsdy can be rovded a subsdy worth 10 ercent of the rces of the new roducts. The hghest subsdes wll be determned by ther tyes. The transortaton cost of the roducts to the recovery centers for treatment can be subsdzed wthn a certan range. It shows the stronger background and mortant meanng to deal wth the EOL roducts n Chna. Manufacturers have faced ncreasng ressures from both governmental regulatons and from consumers and become more envronmentally resonsble 3. Under ths background, manufacturers not only focus on ther forward logstcs, but also have to consder reverse logstcs. Ths may lead to oen systems f the recovered content of the orgnal roducts leaves the orgnal suly chans and s used by other manufacturers to manufacture roducts servng a dfferent urose, but t may also encourage manufacturers to have reverse flows mlemented nto ther own suly chans, gvng rse to a closed-loo suly chan 4. The study of closed-loo suly chan s a relatvely new feld of research. More recently, a varety of closed-loo suly chan network otmzaton models have been develoed. Schultmann et al. 5 roosed a hybrd aroach to establsh a closed-loo suly chan for sent batteres. It combnes an otmzaton model for lannng a reversesuly network and a flow-sheetng rocess model that enables a smulaton talored to otental recyclng otons for sent batteres n the steelmakng ndustry. Easwaran and Üster 6 resented a mxed-nteger lnear rogrammng to determne the otmal locatons of the collecton centers and remanufacturng facltes along wth the ntegrated forward and reverse flows and devsed two Tabu Search heurstcs sequental and random neghborhood search rocedures to solve the roblem. Wang and Hsu 7 consdered the ntegraton of forward and reverse logstcs. A generalzed closed-loo model for the logstcs lannng was roosed by formulatng a cyclc logstcs network roblem nto an nteger lnear rogrammng model, and a revsed sannng-tree-based genetc algorthm was develoed. Moreover, concernng the uncertan factors, a stochastc rogrammng model was develoed by Chounard et al. amng at evaluatng macts of randomness related to recovery, rocessng, and demand volumes on the desgn decsons 8. Francas and Mnner resented a two-stage stochastc rogrammng model wth normally dstrbuted demands and returns 9. In addton, a multerod nteger rogrammng model 10 and a multerod and multroduct network model 11 were roosed n recent years. Among all closed-loo suly chan roblems, the horzontal merger of olgoolstc frms wth closed-loo suly chan networks s so mortant and attractng to both busnessman and researchers. Mergers and acqustons have become an nsearable art of nternatonal busness and a maor means for comanes to grow n sze, go nternatonal, or obtan knowhow 12. Comanes seek roft mrovement by the rad exanson of sales va mergers. In addton, a merger motve can be to buld a conglomerate 13. Every comany ursues contnuously roft growth and exects to take away more market share from ts comettors. Thus, the ursut of those merger advantages mght exlan recent horzontal mergers such as those of Kmart and Sears n the retal ndustry, the merger of
3 Mathematcal Problems n Engneerng 3 Interbrew and Ambev and that of SAB-Mller and Molson Coors as well as the merger of InBev and Anheuser-Busch n the beer ndustry, the merger of Gome and Yongle n retal ndustry n Chna. Many researchers have focused ther attenton on the study of horzontal merger. Chakravarty 14 used the Debreu-Farrell-Färe measure of effcency of merger to comare economc effcences of alternatve merged enttes n a homogeneous good ndustry. Nlssen and Sørgard 15 analyzed the nterdeendence of merger decsons over tme. The Fudenberg-Trole taxonomy of busness strateges was used to dscuss merger decsons made n sequence by dsont grous of frms and a smle olgooly model roosed to these strateges. Ivald and Verboven 16 used the arameter estmates to comute the ostmerger equlbrum and the mled rce and welfare changes under varous alternatve scenaros. Davdson and Mukheree 17 analyzed horzontal mergers n a smle model n whch free entry and ext and rovded a general analyss of the mact of mergers on the long-run ndustry structure. In contrast to the aforementoned models, Nagurney 18 resented a new theoretcal framework for the quantfcaton of strategc advantages assocated wth horzontal mergers through the ntegraton of suly chan networks. In ths aer, wthn the context of closed-loo suly chan network, the frms n the network nclude manufacturng/remanufacturng lants and dstrbuton/recovery centers and serve the demand markets. Manufacturers/remanufacturers are nvolved n the roducton of a knd of homogeneous roducts from the raw materals and recovered EOL roducts. We consder that each frm as a network of busness actvtes reresented by forward lnks, and reverse lnks. The forward lnks consst of manufacturng lnks, remanufacturng lnks, forward transortaton lnks and forward storage lnks, whle reverse lnks nclude treatment lnks for EOL roducts, reverse transortaton lnks, and reverse storage lnks. Three networks ncludng ror to horzontal merger, ost artal merger and comlete merger are studed. Smultaneously, we roose three economcal models for these networks on dfferent condtons of mergers. Theory of varatonal nequaltes s used to derve the varatonal nequalty formulatons of those models. Fnally, several examles are studed to descrbe the effects of arameters on equlbrum results and analyze what mact the costs of horzontal merger wll have on rofts of the frms ater artal merger and comlete merger. Ths aer s organzed as follows. In Secton 2, we analyze the nteracton of the comettve frms ror to horzontal merger and roose an equlbrum model for the network. In Secton 3, the artal frms are merged nto one. We develo an economcal model for the network after artal merger. In Secton 4, a nonlnear otmzaton model for the closed-loo suly chan network after all frms merged s gven. In Secton 5, we rovde numercal examles to resent the effects of arameters on the equlbrum results n the case of dfferent merger scenaros and analyze what mact the costs of horzontal merger wll have on rofts of the frms after artal merger and comlete merger. At last, the aer ends wth conclusons n Secton Prehorzontal Merger Economcal Model We resent a closed-loo suly chan network ror to horzontal merger assocated wth a number of frms n the same ndustry, denoted by Frm 1, 2,...,I. Each Frm has m manufacturng/remanufacturng lants, n dstrbuton/recovery centers, and serves J demand markets. The lants roduce the same homogeneous manufactured and remanufactured roducts. The dstrbuton centers are resonsble for transortng the manufactured and
4 4 Mathematcal Problems n Engneerng remanufactured roducts from manufacturng/remanufacturng lants, and storng these roducts, then transortng these roducts to the demand markets. The recovery centers are resonsble for recoverng and storng the EOL roducts and transortng these roducts to remanufacturng lants to be treated and to be ready for remanufacturng. Let G 1 N 1,L 1 denote the network, where N 1 denotes the set of nodes and L 1 denotes the set of oeraton lnks ncludng forward and reverse lnks. The forward lnks are the lnks whch are located on the forward suly chans, and the reverse lnks are the lnks whch are located on the reverse suly chans. We assume that each frm s reresented as a network of many oeraton lnks whch reresent busness actvtes ncludng manufacturng/remanufacturng actvtes, treatment actvtes for EOL roducts, transortaton actvtes, and storage actvtes erformed by the frms, as dected n Fgure 1. Product flows on the forward lnks are classfed nto two tyes: the roducts remanufactured from recovered EOL roducts and the roducts manufactured from new materals. The roduct flows on the reverse lnks are the recovered EOL roducts. The forward lnks between the frst layer nodes wth the second layer nodes are the manufacturng/remanufacturng lnks reresentng manufacturng and remanufacturng oeratons, and the reverse lnks between them are the treatment lnks reresentng treatment oeratons for the EOL roducts. The lnks between second layer nodes wth thrd layer nodes are transortaton lnks reresentng transortaton oeratons between the manufacturng lants wth dstrbuton centers. The next layer lnks are storage lnks reresentng storage oeratons for the manufactured/remanufactured roducts and EOL roducts. Moreover, there are transortaton lnks connectng dstrbuton center nodes wth all demand market nodes. The maorty of the requred notaton s gven n Table 1. Suose that q N denotes the demand for the roducts at demand market. The quantty of roducts transacted for Frm s equal to that of manufactured roducts and remanufactured roducts. Therefore, we have the followng conservaton of roduct flows: q N P 1N x 1 y Let q R denote the quantty of EOL roducts recovered from the demand market. Then, we have the followng conservaton of roduct flow: q R z 1. P 1R 2.2 Let μ denote the fracton of the roduct that can be remanufactured from one unt of recovered EOL roduct. Therefore, we have: x 1 μ z 1. P 1N P 1R 2.3 Let ρ N denote the sale rce of roducts at demand market, andthesalerce functon s assocated wth the quantty of roducts at each demand market, and we assume that ρ N ρ N q N. In the reverse suly chans, demand markets act as a source of EOL
5 Mathematcal Problems n Engneerng 5 FIRM 1 FIRM I 1 I M 1 1 M 1 m1 M I 1 M I mi D 1 1 D 1 n1 D I 1 D I ni D 1 1 D 1 n1 D I 1 D I ni C 1 C J Fgure 1: The closed-loo suly chan network ror to horzontal merger. roducts. Increasng the recovery rce, more consumers are ersuaded to return roducts. Let ρ R denote the recovery rce of EOL roducts at demand market, and the rce functon s assocated wth the suly quantty of EOL roducts, that s, ρ R ρ R qr.letσ denote the rato of EOL roducts recovered to total quantty sold at the demand market; we have q R σq N. 2.4 For any forward lnk a L 1, we denote by h 1 a, the remanufactured roduct flow on lnk a. Letδ a f the lnk a artcates n forward ath, andδ a 0, otherwse. Hence, the followng conservaton equaton should be satsfed for the remanufactured roduct flow on forward aths and on oeraton lnks: h 1 a P 1N δ a x For any forward lnk b L 1, we denote by h 1 the manufactured roduct flow on lnk b b. Letδ b 1 f the lnk b artcates n forward ath, andδ b 0, otherwse. Hence, the followng conservaton equaton should be satsfed for the manufactured roduct flow on forward aths and on oeraton lnks: h 1 b δ b y P 1N
6 6 Mathematcal Problems n Engneerng Notaton L 1N L 1R P 1N P 1R P 1N P 1R P 1N P 1R P 1N M 1N P 1R M 1R x 1 x 1 y 1 y 1 z 1 z 1 Table 1: Notaton for the closed-loo suly chan network ror to horzontal merger. Defnton The set of all forward lnks for the Frm, where 1,...,I The set of all reverse lnks for the Frm,where 1,...,I Aathofthenetwork The set of all forward aths connectng the frst layer node wth demand market, where 1,...,I, 1,...,J The set of all reverse aths connectng the node wth demand market, where 1,...,I, 1,...,J The set of all forward aths between all I nodes wth demand market,where 1,...,J The set of all reverse aths between all I nodes wth demand market, where 1,...,J The set of all forward aths between the node wth all demand markets, where 1,...,I The set of all reverse aths between the node wth all demand markets, where 1,...,I The set of all forward aths The number of all forward aths The set of all reverse aths The number of all reverse aths The nonnegatve remanufactured roduct flow on the ath P 1N M 1N -dmensonal vector of all remanufactured roduct flows on the aths n P 1N The nonnegatve manufactured roduct flow on the ath P 1N M 1N -dmensonal vector of all manufactured roduct flows on the aths n P 1N The nonnegatve recovered EOL roduct flow on the ath P 1R M 1R -dmensonal vector of all EOL roduct flows on the aths n P 1R X 1 The set of all roduct flows, X 1 x 1,y 1,z 1 For any reverse lnk c L 1, we denote by h 1 c the roduct flow on lnk c. Letδ c 1f the lnk c artcates n forward ath,andδ c 0, otherwse. Smlarly, we have h 1 c P 1R δ c z We defne the cost on each lnk n erformng the corresondng task, and the cost functon s a generc cost functon of ts roduct flow, that s, e a e a h 1 a, e b e b h 1 b,and e c e c h 1 c. Therefore, the roft of Frm s TP ρ N a L 1N q N P 1N x 1 y 1 b L 1N ρ R e a h 1 a e b h 1 b e c h 1 c. c L 1R q R P 1R z We assume that the above roft functon s contnuously dfferentable and convex, all frms comete n a noncooeratve manner, and each one s a roft maxmzer. The otmalty
7 Mathematcal Problems n Engneerng 7 condtons for all frms smultaneously, under the above assumtons, concde wth the soluton of the followng varatonal nequalty 19 : determne X 1 x 1,y 1,z 1 K 1 satsfyng P 1N TP x 1 x 1 x 1 X 1 K 1 P 1N TP y 1 y 1 TP y 1 { x 1,y 1,z 1 P 1R z 1 z 1 z 1 0, x 1,y 1,z 1 R N 1 and hold }, 2.9 where N 1 2M 1N M 1R. Uon usng , varatonal nequalty 2.9 may be reexressed as 20 : determne X 1 x 1,y 1,z 1,λ 1 1,λ1 2 RN 1 I J, such that e a P δ ax 1 1N δ a ρ N x 1 y 1 P 1N a L 1N ρ N P 1N P 1N b L 1N h 1 a q N ρ N P 1R μ P 1R σ P 1N z 1 c L 1R x 1 ρ R x 1 y 1 P 1N x 1 P 1N e b P δ by 1 1N δ b ρ N P 1N h 1 b q N h 1 c x 1 y 1 y 1 λ 1 P 1N x 1 1 σλ1 2 P 1N e c P δ cz 1 1N δ c ρ R P 1N P 1R q R x 1 y 1 P 1R z 1 P 1R λ 1 1 λ1 1 z 1 z 1 μλ 1 λ 1 2 λ1 2 P 1R 1 λ1 2 0, X 1 x 1 y 1 z 1 y 1 x 1 x 1 σλ 1 2 z 1 z 1 y 1 y 1 x 1,y 1,z 1,λ 1 1,λ1 2 R N 1 I J, 2.10
8 8 Mathematcal Problems n Engneerng FIRM K FIRM S S M 1 1 M 1 m1 M K 1 M K mk M S 1 M S ms D 1 1 D 1 n1 D K 1 D K nk D S 1 D S ns D 1 1 D 1 n1 D K 1 D K nk D S 1 D S ns C 1 C J Fgure 2: The closed-loo suly chan network after horzontal merger of artal frms. where λ 1 1 λ1 11 λ1 12 λ 1 1I T and λ 1 2 λ1 21 λ1 22 λ 1 2J T are the vectors of Lagrange multlers assocated wth constrants 2.3 and Postartal Horzontal Merger Model In ths secton, we consder the artal horzontal merger case, that s, K frms n I frms are horzontal merged nto a new Frm 1 and K S 1 I, as dected n Fgure 2. The new frm shares manufacturng/remanufacturng lants and dstrbuton/recovery centers of orgnal K frms, that s, the manufactured/remanufactured roducts at any of these lants can be dstrbuted by any of these dstrbuton centers, and the recovered EOL roducts at any of these recovery centers can be transorted to any of these lants. We denote the new network by G 2 N 2,L 2, where N 2 denotes the set of nodes and L 2 denotes the set of oeraton lnks n ths network. The maorty of the requred notaton for the network ost horzontal merger of artal frms s gven n Table 2. For any forward lnk a L 2, we denote by h 2 a the remanufactured roduct flow on lnk a. For any forward lnk b L 2, we denote by h 2 the manufactured roduct flow on lnk b. For b any reverse lnk c L 2, we denote by h 2 c the EOL roduct flow on lnk c. The cost functons are e a e a h 2 a, e b e b h 2 b,ande c e c h 2 c. Snce we have assumed that each frm s a roft maxmzer, smlarly, the otmzaton roblem of Frm can be exressed as follows. Maxmze TP ρ N a L 2N q N P 2N b L 2N x 2 y 2 ρ R e a h 2 a e b h 2 b e c h 2 c. c L 2R q R P 2R z 2 3.1
9 Mathematcal Problems n Engneerng 9 Table 2: Notaton for the closed-loo suly chan network after horzontal merger of artal frms. Notaton L 2N L 2R P 2N P 2R P 2N P 2R P 2N P 2R P 2N M 2N P 2R M 2R x 2 x 2 y 2 y 2 z 2 z 2 Defnton The set of all forward lnks for the Frm, where 1, 2,...,S The set of all reverse lnks for the Frm,where 1, 2,...,S The set of all forward aths connectng the frst layer node 1, 2,...,S wth demand market, where 1, 2,...,J The set of all reverse aths connectng the demand market wth the frst layer node 1, 2,...,S The set of all forward aths between all S nodes wth demand market The set of all reverse aths between all S nodes wth demand market The set of all forward aths between the node 1, 2,...,S wth all demand markets The set of all reverse aths between the node 1, 2,...,S wth all demand markets The set of all forward aths The number of all forward aths The set of all reverse aths The number of all reverse aths The nonnegatve remanufactured roduct flow on the ath P 2N M 2N -dmensonal vector of all remanufactured roduct flows on the aths n P 2N The nonnegatve manufactured roduct flow on the ath P 2N M 2N -dmensonal vector of all manufactured roduct flows on the aths n P 2N The nonnegatve recovered EOL roduct flow on the ath P 2R M 2R -dmensonal vector of all EOL roduct flows on the aths n P 2R X 2 The set of all roduct flows, X 2 x 2,y 2,z 2 Subect to: q N q R P 2N P 2N x 2 y 2,, P 2R z 2, x 2 μ P 2R, z 2, q R σq N,, 3.5 h 2 a δ a x, 2 a L 2N, P 2N 3.6 h 2 b δ b y, 2 b L 2N, P 2N 3.7 h 2 c δ c z 2, c L 2R, P 2R 3.8 x 2 0, y 2 0, P 2N ; z 2 0, P 2R. 3.9
10 10 Mathematcal Problems n Engneerng We assume that the above roft functon s contnuously dfferentable and convex, S frms comete n a noncooeratve manner, and each one s a roft maxmzer. The otmalty condtons for all frms smultaneously, under the above assumtons, concde wth the soluton of the followng varatonal nequalty: determne X 2 R N 2 S J, such that P 2N a L 2N ρ N e a P δ ax 2 2N δ a ρ N P 2N h 2 a q N x 2 y 2 P 2N x 2 P 2N x 2 y 2 y 2 λ 2 x 2,y 2,z 2,λ 2 1,λ2 2 1 σλ2 2 x 2 x 2 P 2N b L 2N e b P δ by 2 2N δ b ρ N h 2 b P 2N x 2 y 2 ρ N P 2N q N x 2 y 2 P 2N x 2 y 2 σλ 2 2 y 2 y 2 P 2R c L 2R e c P δ cz 2 2N δ c ρ R h 2 c P 2R z 2 μ P 2R σ P 2N z 2 x 2 ρ R P 2N P 2R q R x 2 y 2 P 2R z 2 P 2R λ 2 1 λ2 1 z 2 z 2 μλ 2 λ 2 2 λ2 2 X 2 1 λ2 2 0, z 2 z 2 x 2,y 2,z 2,λ 2 1,λ2 2 R N 2 S J, 3.10 where N 2 2M 2N M 2R, λ 2 1 λ2 11 λ2 12 λ 2 1S T and λ 1 2 λ1 21 λ1 22 λ1 2J T, are the vectors of Lagrange multlers assocated wth constrants 3.4 and 3.5.
11 Mathematcal Problems n Engneerng 11 FIRM I M 1 1 M 1 m1 M I 1 M I mi D 1 1 D 1 n1 D I 1 D I ni D 1 1 D 1 n1 D I 1 D I ni C 1 C J Fgure 3: The ntegrated closed-loo suly chan network after comlete horzontal merger of all the frms. 4. Postcomlete Horzontal Merger Integraton Model In ths secton, we develo a ostcomlete merger model n the closed-loo suly chan network. I frms merge nto a new frm, and the new one shares manufacturng/ remanufacturng lants and dstrbuton/recovery centers of orgnal I frms. The closedloo suly chan network ror to horzontal merger s ntegrated, as dected n Fgure 3. There s the frst layer Node 1 whch reresents the ntegraton of all frms n terms of ther closed-loo suly chan network wth addtonal oeraton lnks connectng Node 1 to the nodes of orgnal frms. Moreover, we add the addtonal oeraton lnks connectng the manufacturng/remanufacturng lants of each frm wth the dstrbuton/recovery centers of the other frms. We denote the new network by G 3 N 3,L 3, where N 3 N 1 Node 1 and L 3 L 1 the addtonal oeraton lnks. The maorty of the requred notaton for the network after comlete horzontal merger s gven n Table 3. For any forward lnk a L 3, we denote by h 3 a the remanufactured roduct flow on lnk a. For any forward lnk b L 3, we denote by h 3 the manufactured roduct flow on lnk b. For b any reverse lnk c L 3, we denote by h 3 c theroductflowonlnkc. We defne that the cost functons are e a e a h 3 a, e b e b h 3 b,ande c e c h 3 c. Snce all frms are merged nto a frm, there s no longer cometton. Hence, the roft of the new frm can be exressed as follows.
12 12 Mathematcal Problems n Engneerng Table 3: Notaton for the closed-loo suly chan network after comlete horzontal merger. Notaton Defnton L 3N The set of all forward lnks L 3R The set of all reverse lnks P 3N The set of forward aths between the frst layer node 1 wth the demand market, where 1,...,J P 3R The set of reverse aths between the demand market wth the frst layer node 1 P 3N The set of all forward aths M 3N The number of all forward aths P 3R The set of all reverse aths M 3R The number of all revere aths x 3 The nonnegatve remanufactured roduct flow on the ath P 3N x 3 M 3N -dmensonal vector of all remanufactured roduct flows on the aths n P 3N y 3 The manufactured roduct flow on the ath P 3N y 3 M 3N -dmensonal vector of all manufactured roduct flows on the aths n P 3N z 3 The EOL roduct flow on the ath P 3R z 3 M 3R -dmensonal vector of all EOL roduct flows on the aths n P 3R X 3 The set of all roduct flows, X 3 x 3,y 3,z 3 Maxmze TP ρ N q N P 3N a L 3N e a h 3 a x 3 y 3 b L 3N e b ρ R h 3 b e c h 3 c. c L 3R q R P 3R z Subect to: q N q R P 3N x 3 y 3,, P 3R z 3,, x 3 μ z 3, P 3N P 3R q R σq N,, 4.5 h 3 a δ a x, 3 P 3N a L 3N, 4.6 h 3 b δ b y, 3 P 3N b L 3N, 4.7 h 3 c δ c z 3, P 3R c L 3R, 4.8 x 3 0, y 3 0, P 3N ; z 3 0, P 3R. 4.9
13 Mathematcal Problems n Engneerng 13 The obectve of the model shown n 4.1 s to maxmze the total roft of the frm after comlete merger. Constrant 4.2 reresents that the quantty of manufactured and remanufactured roducts shed to demand market s equal to the demand of the market. Constrant 4.3 reresents that the quantty of recovered EOL roducts from demand market s equal to the suly of them. Constrant 4.4 restrcts that the quantty of remanufactured roducts come from the EOL roducts. Constrant 4.5 reresents that the quantty of EOL roducts recovered must not exceed ther suly at the demand market. Constrant 4.6 reresents that conservaton equaton for the remanufactured roduct flow on forward aths and on oeraton lnks. Constrant 4.7 reresents that conservaton equaton for the manufactured roduct flow on forward aths and on oeraton lnks. Constrant 4.8 reresents conservaton equaton for the EOL roduct flow on reverse aths and on oeraton lnks. Constrant 4.9 reresents the nonnegatve restrcton on roduct flows. Smlarly, we assume that the above roft functon s contnuously dfferentable and convex wth resect to varable X 3. The otmalty condtons for the frm, under the above assumtons, concde wth the soluton of the followng varatonal nequalty: determne X 3 x 3,y 3,z 3,λ 3 1,λ3 2 RN 3 J 1 satsfyng P 3N a L 3N ρ N e a P 3N δ ax 3 h 3 a P 3N P 3N b L 3N P 3R μ c L 3R z 3 P 3R σ P 3N q N ρ N ρ R x 3 y 3 δ a ρ N P 3N e b P 3N δ by 3 h 3 b P 3N q N x 3 e c P δ cz 3 3R h 3 c P 3R q R x 3 P 3N x 3 z 3 y 3 P 3R P 3N x 3 δ b ρ N y 3 P 3R λ 3 1 λ3 1 z 3 δ c ρ R z 3 x 3 y 3 y 3 λ 3 P 3N P 3N x 3 μλ 3 λ 3 2 λ3 2 P 3R 1 σλ3 2 x 3 y 3 z 3 1 λ3 2 X 3 0, y 3 x 3 x 3 σλ 3 2 z 3 z 3 y 3 y 3 x 3,y 3,z 3,λ 3 1,λ3 2 R N 3 J 1, 4.10
14 14 Mathematcal Problems n Engneerng where N 3 2M 3N M 3R, λ 2 1 and λ2 2 λ2 21 λ2 22 λ2 2J T are the vectors of Lagrange multlers assocated wth constrants 4.4 and Dscusson and Numercal Analyss In ths secton, four sets of numercal examles are tested and dscussed on the roosed models. The models are comuted by usng modfed roecton method 21 and mlemented n MATLAB. The convergence crteron used s that the absolute value of the roduct flows between two successve teratons dffered by no more than The constant ste length wthn the modfed roecton method s set to All solutons obtaned satsfy the otmalty condtons wth good accuracy. Examle Set 1. We consder that a closed-loo suly chan network ror to horzontal merger conssts of three frms, each wth ts manufacturng/remanufacturng lants, dstrbuton/recovery centers, and a demand market. Then, Frm 1 and Frm 2 merge nto a new frm. Fnally, the three frms merge comletely. The networks ror to merger, ostartal merger and comlete merger, are dected n Fgure 4. The cost functon on the lnks for the closed-loo suly chan network ror to merger s as follow. The cost functons on the frst layer lnks are e a h 1 a 1.5 h 1 a 2 h 1 a, e b h 1 b 2 h1 b 2 1.5h 1 b,ande c h 1 c 0.2 h 1 c 2. The cost functons on the second layer lnks are e a h 1 a 0.5 h 1 a 2 h 1 a, e b h 1 b 0.5 h1 b 2 h 1 b,ande c h 1 c 0.3 h 1 c 2 0.5h 1 c. The cost functons on the thrd layer lnks are e a h 1 a 0.5 h 1 a 2, e b h 1 b 0.5 h1 b 2,ande c h 1 c 0.3 h 1 c 2.The cost functons on the fourth layer lnks are e a h 1 a 0.1 h 1 a 2, e b h 1 b 0.1 h1 b,ande c h 1 c 0.1 h 1 c 2. The sale rce functon s ρ N 1 qn qn 1. The recovery rce of EOL roducts at demand market s ρ R 1 0.5qR 1. When the frst two frms merge, we set the cost on the new lnks connectng the frst layer Node 1 wth the second layer Nodes 1 and 2, equal to zero, and the cost functons on the new lnks connectng manufacturng/remanufacturng lants wth dstrbuton/recovery centers are dentcal to the cost functons on the lnks of the network ror to merger. When all frms merge, we assume that the cost on the new lnks connectng the frst layer Node 1 wth the second layer Nodes 1, 2, and 3, equal to zero, the cost functons of other new lnks are dentcal to the orgnal functons. Frstly, we set μ 0.6andσ 0. There are three forward aths and three reverse aths n the network ror to merger. The equlbrum results ror to merger can be obtaned by varatonal nequalty 2.10, andx 1 0 for all P 1N, y for all P 1N, z 1 0 for all P 1R. The revenue for each frm s The cost for each frm s , and the roft for each frm s There are fve forward aths and fve reverse aths n the network after artal merger. The equlbrum results after artal merger can be obtaned by varatonal nequalty 3.10, andx 2 0 for all P 2N, z 2 0 for all P 2R. However, y 2 for all P 2N has changed, the manufactured roduct flow on each ath connectng Frm 2 wth the demand market s 15.64, and the roduct flows on the other aths are The revenue of the new Frm 1 s , and the revenue of the new Frm 2 s The cost of the new Frm 1 s , and the cost of the new Frm 2 s The roft of the new Frm 1 s , and the roft of the new Frm 2 s There are nne forward aths and nne reverse aths n the network after comlete merger. The equlbrum results ost comlete merger can be obtaned by varatonal nequalty 4.10, andx for all
15 Mathematcal Problems n Engneerng 15 Frm 1 Frm 2 Frm Frm Frm 1 1 Frm Fgure 4: The networks ror to merger, ostartal merger, and comlete merger. P 3N, y for all P 3N, z for all P 3R. The total revenue s The total cost s The total roft s Secondly, we set μ 0.6, σ 0.2. The equlbrum results for the network ror to merger are x for all P 1N, y for all P 1N, z for all P 1R. The revenue for each frm s The cost for each frm s The roft for each frm s The equlbrum results for the network ost artal merger are obtaned. The remanufactured roduct flow on each forward ath connectng the new Frm 2 wth the demand market s 2.80, and the roduct flows on the other aths are 0.81, resectvely. The manufactured roduct flow on each forward ath connectng the new Frm 2 wth the demand market s 15.42, and the roduct flows on the other ath are The EOL roduct flow on each reverse ath connectng the new Frm 2 wth the demand market s 4.67, and the roduct flows on the other aths are The revenue of the new Frm 1 s , and the revenue of the new Frm 2 s The cost of the new Frm 1 s , and the cost of the new Frm 2 s The roft of the new Frm 1 s , and the roft of the new Frm 2 s The equlbrum results for the network after comlete merger are x for all P 3N, y for all P 3N and z for all P 3R. The total revenue s The total cost s The total roft s Fnally, we set μ 0.6, σ 0.7. The equlbrum results for the network ror to merger are x for all P 1N, y for all P 1N, z for all P 1R. The revenue for each frm s The cost for each frm s The roft for each frm s The equlbrum results for the network ost artal merger are obtaned. The remanufactured roduct flow on each forward ath connectng the new Frm 2 wth the demand market s 5.61, and the roduct flows on the other aths are The manufactured roduct flow on each forward ath connectng the new Frm 2 wth the demand market s 13.74, and the roduct flows on the other aths are The EOL roduct flow on each
16 16 Mathematcal Problems n Engneerng reverse ath connectng the new Frm 2 wth the demand market s 9.34, and the roduct flows on the other aths are The revenue of the new Frm 1 s , and the revenue of the new Frm 2 s The cost of the new Frm 1 s , and the cost of the new Frm 2 s The roft of the new Frm 1 s , and the roft of the new Frm 2 s The equlbrum results for the network after comlete merger are x for all P 3N, y for all P 3N,andz for all P 3R. The total revenue s The total cost s The total roft s The other equlbrum results ncludng the demand quantty, the quantty of recovered EOL roducts, the rces, the total revenues, the total costs, and the total rofts for the networks ror to merger, ostartal merger, and comlete merger from three dfferent ntal arameter settng are resented n Table 4. It s mortant to note that, n each of arameter settng, all frms ganed from the artal merger. The merged Frm 1 has hgher total roft than the sum of those two orgnal frms rofts, and the unmerged Frm 2 orgnal Frm 3 obtans also more roft. It s also worth notng that the total revenues and the total costs are lower n these artal merger examles. Moreover, the new frm after comlete merger obtans more roft than the sum of those three orgnal frms rofts, also more than the sum of the two frms rofts n artal merger case. In addton, n every examle for each arameter settng, the demand for remanufactured and manufactured roducts, the quantty of recovered EOL roducts, and the recovery rce decrease slghtly; however, the demand rce at demand market ncreases. Examle Set 2. The second set of examles uses the same network and cost functons as n Examle Set 1 but assumes that dfferent μ and σ are faced. We assume that μ ncreases from 0.1 to 0.5 and ncreases to 0.8. The rato σ s set to 0.6. When μ 0.1, the revenue for each frm ror to merger s , the cost for each frm s , and the roft for each frm s The revenue of the new Frm 1 after artal merger s , and the revenue of the new Frm 2 s The cost of the new Frm 1 after artal merger s , and the cost of the new Frm 2 s The roft of the new Frm 1 after artal merger s , and the roft of the new Frm 2 s The revenue for the frm after comlete merger s , ts cost s , and ts roft s When μ 0.5, the revenue for each frm ror to merger s , the cost for each frm s , and the roft for each frm s The revenue of the new Frm 1 after artal merger s , and the revenue of the new Frm 2 s The cost of the new Frm 1 after artal merger s , and the cost of the new Frm 2 s The roft of the new Frm 1 after artal merger s , and the roft of the new Frm 2 s The revenue for the frm after comlete merger s , ts cost s , and ts roft s When μ 0.8, the revenue for each frm ror to merger s , the cost for each frm s , and the roft for each frm s The revenue of the new Frm 1 after artal merger s , and the revenue of the new Frm 2 s The cost of the new Frm 1 ost artal merger s , and the cost of the new Frm 2 s The roft of the new Frm 1 ostartal merger s , and the roft of the new Frm 2 s The revenue for the frm after comlete merger s , ts cost s , and ts roft s The other equlbrum results ncludng the demand quantty, the quantty of recovered EOL roducts, the equlbrum rces, the total revenues, the total costs, and the total rofts for the networks ror to merger, ostartal merger, and comlete merger from three dfferent ntal arameter settngs are resented n Table 5.
17 Mathematcal Problems n Engneerng 17 Table 4: Results of Examle Set 1. μ 0.6 σ 0 μ 0.6 σ 0.2 μ 0.6 σ 0.7 Results Pror merger Partal merger Comlete merger Pror merger Partal merger Comlete merger Pror merger Partal merger Comlete merger q N q R ρ N ρ R Total revenue Total cost Total roft
18 18 Mathematcal Problems n Engneerng Table 5: Results of Examle Set 2. μ 0.1 σ 0.6 μ 0.5 σ 0.6 μ 0.8 σ 0.6 Results Pror merger Partal merger Comlete merger Pror merger Partal merger Comlete merger Pror merger Partal merger Comlete merger q N q R ρ N ρ R Total revenue Total cost Total roft
19 Mathematcal Problems n Engneerng 19 Due to the ncreased μ, all frms choose to recover more roducts. As a result, market share ncreases, and the total rofts for the networks ror to merger, ostartal merger, and ostcomlete merger are ncreased. Examle Set 3. The examle uses the same network and cost functons as n Examle Set 1, μ 0.5, σ 0.6, but assumes that the cost functons of the new lnks connectng the frst layer Node 1 wth the second layer Nodes 1 and 2 are e a h 2 a gh 2 a, e b h 2 b gh2 b, e c h 2 c gh 2 c, whch can be regarded as the cost of horzontal merger ncludng drect costs and ndrect costs assocated wth merger. In order to analyze what mact the costs of horzontal merger wll have on rofts of the new Frm 1 and Frm 2 after artal merger, t s feasble to vary the arameter g from 0 to 10, then to 20, and so on, whch means dfferent from the cost of horzontal merger. The results from dfferent arameter settngs are resented n Fgure 5. We fnd that the arameter s set to 140 then the roft of the new Frm 1 after artal merger s zero and t makes no economc sense for such a merger, but the roft of the new Frm 2 reach the maxmum Wth further exermentaton, note that the arameter s equal to 2, then the roft of the new Frm 1 after artal merger s that s greater than the sum of the rofts for the Frm 1 and Frm 2 ror to merger cf. Examle Set 2. Thus,the arameter s equal to or smaller than 2 then, the merged frms can obtan gan from such a merger. However, after the arameter s set to 3, the roft of the new Frm 1 after artal merger s , whch s smaller than the sum of the rofts for the Frm 1 and Frm 2 ror to merger cf. Examle Set 2. Therefore, the arameter s equal to or greater than 3, then the merged frms cannot obtan roft growth from such a merger. Examle Set 4. The examle uses the same network and cost functons as n Examle Set 1, μ 0.8, σ 0.6, but assumes that the cost functons of the new lnks connectng the frst layer Node 0 wth the second lager Nodes 1, 2, and 3 are e a h 2 a gh 2 a, e b h 2 b gh2 b, e c h 2 c gh 2 c. Further, we analyze what mact the costs of horzontal merger wll have on rofts of the new frm after comlete merger. Smlarly, we vary the arameter g from 0 to 10, then to 20, and so on. The results from dfferent arameter settngs are resented n Fgure 6. We fnd that the arameter s set to 160 then the roft of the new frm after comlete merger s zero and the merger has no economc sense. Further, after the arameter s set to 6, the roft of the new frm after comlete merger s , whch s stll greater than the sum of the rofts for all frms ror to merger cf. Examle Set 2. Thus, the arameter s equal to or smaller than 6, then, the merged frms can obtan gan from such a comlete merger. However, after the arameter s set to 7, the roft of the new frm s , whch s smaller than the sum of the rofts for all frms ror to merger cf. Examle Set 2. Therefore, the arameter s equal to or greater than 7, then the merged frms cannot obtan roft growth from ths comlete merger. 6. Concluson Ths aer has studed the closed-loo suly chan network ncludng a number of frms n the same ndustry. The network s reresented by forward and reverse oeraton lnks ncludng manufacturng/remanufacturng lnks, treatment lnks for EOL roducts, transortaton lnks, and storage lnks. The economcal models for the networks ror to merger, ostartal merger, and comlete merger are develoed. The research work has resented the varatonal nequalty formulatons of these models, whose solutons yeld the roducton quantty of new roducts and remanufactured roducts, the roduct flows
20 20 Mathematcal Problems n Engneerng Proft g TP1 TP2 Fgure 5: The total rofts of the Frm 1 and Frm 2 after artal merger from dfferent arameter settngs Proft g TP Fgure 6: The roft of the Frm 1 after comlete merger from dfferent arameter settngs. for new roducts, remanufactured roducts and EOL roducts at every ath, the demand quantty, the quantty of recovered EOL roducts, and the equlbrum rces. The modfed roecton method s aled for all numercal examles tested. In addton, ths aer can be extended n several drectons, such as more merger forms and the models for multroduct closed-loo suly chan network. Acknowledgments Ths aer s suorted by Natonal Nature Scence Foundaton of Chna no , no Ths aer s sonsored by Zheang Provncal Key Research Base for Humantes and Socal Scences Standardzaton and Intellectual Proerty Management and Zheang Provncal Key Research Base for Phlosohy and Socal Scences Industral Develoment Polcy Research Center.
21 Mathematcal Problems n Engneerng 21 References 1 A. Gungor and S. M. Guta, Issues n envronmentally conscous manufacturng and roduct recovery: a survey, Comuters & Industral Engneerng, vol. 36, no. 4, , M. Fleschmann, J. M. Bloemhof-Ruwaard, R. Dekker, E. van der Laan, J. A. E. E. van Nunen, and L. N. van Wassenhove, Quanttatve models for reverse logstcs: a revew, Euroean Journal of Oeratonal Research, vol. 103, no. 1,. 1 17, V. Jayaraman, Producton lannng for closed-loo suly chans wth roduct recovery and reuse: an analytcal aroach, Internatonal Journal of Producton Research, vol. 44, no. 5, , D. Hammond and P. Beullens, Closed-loo suly chan network equlbrum under legslaton, Euroean Journal of Oeratonal Research, vol. 183, no. 2, , F. Schultmann, B. Engels, and O. Rentz, Closed-loo suly chans for sent batteres, Interfaces, vol. 33, no. 6, , G. Easwaran and H. Üster, Tabu search and Benders decomoston aroaches for a caactated closed-loo suly chan network desgn roblem, Transortaton Scence, vol. 43, no. 3, , H. F. Wang and H. W. Hsu, A closed-loo logstc model wth a sannng-tree based genetc algorthm, Comuters & Oeratons Research, vol. 37, no. 2, , M. Chounard, S. D Amours, and D. Aït-Kad, A stochastc rogrammng aroach for desgnng suly loos, Internatonal Journal of Producton Economcs, vol. 113, no. 2, , D. Francas and S. Mnner, Manufacturng network confguraton n suly chans wth roduct recovery, Omega, vol. 37, no. 4, , B. M. Beamon and C. Fernandes, Suly-chan network confguraton for roduct recovery, Producton Plannng & Control, vol. 15, no. 3, , M. I. G. Salema, A. P. Barbosa-Povoa, and A. Q. Novas, Smultaneous desgn and lannng of suly chans wth reverse flows: a generc modellng framework, Euroean Journal of Oeratonal Research, vol. 203, no. 2, , P. L. Anslnger and T. E. Coeland, Growth through acqustons: a fresh look, Harvard Busness Revew, vol. 74, no. 1, , J. L. Bower, Not all M&As are alke and that matters, Harvard Busness Revew, vol. 79, no. 3, , S. R. Chakravarty, Effcent horzontal mergers, Journal of Economc Theory, vol. 82, no. 1, , T. Nlssen and L. Sørgard, Sequental horzontal mergers, Euroean Economc Revew, vol. 42, no. 9, , M. Ivald and F. Verboven, Quantfyng the effects from horzontal mergers n Euroean cometton olcy, Internatonal Journal of Industral Organzaton, vol. 23, no. 9-10, , C. Davdson and A. Mukheree, Horzontal mergers wth free entry, Internatonal Journal of Industral Organzaton, vol. 25, no. 1, , A. Nagurney, A system-otmzaton ersectve for suly chan network ntegraton: the horzontal merger case, Transortaton Research Part E, vol. 45, no. 1,. 1 15, M. S. Bazaraa, H. D. Sheral, and C. M. Shetty, Nonlnear Programmng: Theory and Algorthms, John Wley & Sons, New York, NY, USA, A. Auslender and M. Teboulle, Lagrangan dualty and related multler methods for varatonal nequalty roblems, SIAM Journal on Otmzaton, vol. 10, no. 4, , G. M. Korelevch, The extragradent method for fndng saddle onts and other roblems, Matekon, vol. 13, no. 4, , 1977.
22 Advances n Oeratons Research Hndaw Publshng Cororaton htt:// Advances n Decson Scences Hndaw Publshng Cororaton htt:// Mathematcal Problems n Engneerng Hndaw Publshng Cororaton htt:// Journal of Algebra Hndaw Publshng Cororaton htt:// Probablty and Statstcs The Scentfc World Journal Hndaw Publshng Cororaton htt:// Hndaw Publshng Cororaton htt:// Internatonal Journal of Dfferental Equatons Hndaw Publshng Cororaton htt:// Submt your manuscrts at htt:// Internatonal Journal of Advances n Combnatorcs Hndaw Publshng Cororaton htt:// Mathematcal Physcs Hndaw Publshng Cororaton htt:// Journal of Comlex Analyss Hndaw Publshng Cororaton htt:// Internatonal Journal of Mathematcs and Mathematcal Scences Journal of Hndaw Publshng Cororaton htt:// Stochastc Analyss Abstract and Aled Analyss Hndaw Publshng Cororaton htt:// Hndaw Publshng Cororaton htt:// Internatonal Journal of Mathematcs Dscrete Dynamcs n Nature and Socety Journal of Journal of Dscrete Mathematcs Journal of Hndaw Publshng Cororaton htt:// Aled Mathematcs Journal of Functon Saces Hndaw Publshng Cororaton htt:// Hndaw Publshng Cororaton htt:// Hndaw Publshng Cororaton htt:// Otmzaton Hndaw Publshng Cororaton htt:// Hndaw Publshng Cororaton htt://
Project Networks With Mixed-Time Constraints
Project Networs Wth Mxed-Tme Constrants L Caccetta and B Wattananon Western Australan Centre of Excellence n Industral Optmsaton (WACEIO) Curtn Unversty of Technology GPO Box U1987 Perth Western Australa
More informationSupport Vector Machines
Support Vector Machnes Max Wellng Department of Computer Scence Unversty of Toronto 10 Kng s College Road Toronto, M5S 3G5 Canada wellng@cs.toronto.edu Abstract Ths s a note to explan support vector machnes.
More informationADOPTION OF BIG DATA ANALYTICS IN HEALTHCARE: THE EFFICIENCY AND PRIVACY
ADOPTION OF BIG DATA ANALYTICS IN HEALTHCARE: THE EFFICIENCY AND PRIVACY He L, School of Economc Informaton Engneerng, Southwestern Unversty of Fnance and Economcs, Chengdu, Chna, olverlhe@gmalcom Jng
More informationOptimal maintenance of a production-inventory system with continuous repair times and idle periods
Proceedngs o the 3 Internatonal Conerence on Aled Mathematcs and Comutatonal Methods Otmal mantenance o a roducton-nventory system wth contnuous rear tmes and dle erods T. D. Dmtrakos* Deartment o Mathematcs
More informationA Study on Secure Data Storage Strategy in Cloud Computing
Journal of Convergence Informaton Technology Volume 5, Number 7, Setember 00 A Study on Secure Data Storage Strategy n Cloud Comutng Danwe Chen, Yanjun He, Frst Author College of Comuter Technology, Nanjng
More informationA hybrid global optimization algorithm based on parallel chaos optimization and outlook algorithm
Avalable onlne www.ocpr.com Journal of Chemcal and Pharmaceutcal Research, 2014, 6(7):1884-1889 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCPRC5 A hybrd global optmzaton algorthm based on parallel
More informationResearch Article Enhanced Two-Step Method via Relaxed Order of α-satisfactory Degrees for Fuzzy Multiobjective Optimization
Hndaw Publshng Corporaton Mathematcal Problems n Engneerng Artcle ID 867836 pages http://dxdoorg/055/204/867836 Research Artcle Enhanced Two-Step Method va Relaxed Order of α-satsfactory Degrees for Fuzzy
More informationbenefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).
REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or
More informationANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING
ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING Matthew J. Lberatore, Department of Management and Operatons, Vllanova Unversty, Vllanova, PA 19085, 610-519-4390,
More informationApplied Research Laboratory. Decision Theory and Receiver Design
Decson Theor and Recever Desgn Sgnal Detecton and Performance Estmaton Sgnal Processor Decde Sgnal s resent or Sgnal s not resent Nose Nose Sgnal? Problem: How should receved sgnals be rocessed n order
More informationPower-of-Two Policies for Single- Warehouse Multi-Retailer Inventory Systems with Order Frequency Discounts
Power-of-wo Polces for Sngle- Warehouse Mult-Retaler Inventory Systems wth Order Frequency Dscounts José A. Ventura Pennsylvana State Unversty (USA) Yale. Herer echnon Israel Insttute of echnology (Israel)
More informationInstitute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic
Lagrange Multplers as Quanttatve Indcators n Economcs Ivan Mezník Insttute of Informatcs, Faculty of Busness and Management, Brno Unversty of TechnologCzech Republc Abstract The quanttatve role of Lagrange
More informationRobust Design of Public Storage Warehouses. Yeming (Yale) Gong EMLYON Business School
Robust Desgn of Publc Storage Warehouses Yemng (Yale) Gong EMLYON Busness School Rene de Koster Rotterdam school of management, Erasmus Unversty Abstract We apply robust optmzaton and revenue management
More informationAn Alternative Way to Measure Private Equity Performance
An Alternatve Way to Measure Prvate Equty Performance Peter Todd Parlux Investment Technology LLC Summary Internal Rate of Return (IRR) s probably the most common way to measure the performance of prvate
More informationA New Technique for Vehicle Tracking on the Assumption of Stratospheric Platforms. Department of Civil Engineering, University of Tokyo **
Fuse, Taash A New Technque for Vehcle Tracng on the Assumton of Stratosherc Platforms Taash FUSE * and Ehan SHIMIZU ** * Deartment of Cvl Engneerng, Unversty of Toyo ** Professor, Deartment of Cvl Engneerng,
More informationINVENTORY MANAGEMENT REVISED
Scence & Mltary 2/2011 INVENTORY MANAGEMENT REVISED Analyss of behavoral asects of decson makng wthn Sales & Oeratons Plannng rocess Peter JUREČKA Abstract: The urose of ths artcle s to extend the standard
More informationA Prediction System Based on Fuzzy Logic
Proceedngs of the World Congress on Engneerng and Comuter Scence 2008 WCECS 2008, October 22-24, 2008, San Francsco, USA A Predcton System Based on Fuzzy Logc Vadeh.V,Monca.S, Mohamed Shek Safeer.S, Deeka.M
More informationHow To Calculate The Accountng Perod Of Nequalty
Inequalty and The Accountng Perod Quentn Wodon and Shlomo Ytzha World Ban and Hebrew Unversty September Abstract Income nequalty typcally declnes wth the length of tme taen nto account for measurement.
More informationRisk-based Fatigue Estimate of Deep Water Risers -- Course Project for EM388F: Fracture Mechanics, Spring 2008
Rsk-based Fatgue Estmate of Deep Water Rsers -- Course Project for EM388F: Fracture Mechancs, Sprng 2008 Chen Sh Department of Cvl, Archtectural, and Envronmental Engneerng The Unversty of Texas at Austn
More informationPortfolio Loss Distribution
Portfolo Loss Dstrbuton Rsky assets n loan ortfolo hghly llqud assets hold-to-maturty n the bank s balance sheet Outstandngs The orton of the bank asset that has already been extended to borrowers. Commtment
More informationFormulating & Solving Integer Problems Chapter 11 289
Formulatng & Solvng Integer Problems Chapter 11 289 The Optonal Stop TSP If we drop the requrement that every stop must be vsted, we then get the optonal stop TSP. Ths mght correspond to a ob sequencng
More informationA Novel Methodology of Working Capital Management for Large. Public Constructions by Using Fuzzy S-curve Regression
Novel Methodology of Workng Captal Management for Large Publc Constructons by Usng Fuzzy S-curve Regresson Cheng-Wu Chen, Morrs H. L. Wang and Tng-Ya Hseh Department of Cvl Engneerng, Natonal Central Unversty,
More informationAn MILP model for planning of batch plants operating in a campaign-mode
An MILP model for plannng of batch plants operatng n a campagn-mode Yanna Fumero Insttuto de Desarrollo y Dseño CONICET UTN yfumero@santafe-concet.gov.ar Gabrela Corsano Insttuto de Desarrollo y Dseño
More informationJ. Parallel Distrib. Comput.
J. Parallel Dstrb. Comput. 71 (2011) 62 76 Contents lsts avalable at ScenceDrect J. Parallel Dstrb. Comput. journal homepage: www.elsever.com/locate/jpdc Optmzng server placement n dstrbuted systems n
More informationA DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATION-BASED OPTIMIZATION. Michael E. Kuhl Radhamés A. Tolentino-Peña
Proceedngs of the 2008 Wnter Smulaton Conference S. J. Mason, R. R. Hll, L. Mönch, O. Rose, T. Jefferson, J. W. Fowler eds. A DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATION-BASED OPTIMIZATION
More informationOn the Optimal Control of a Cascade of Hydro-Electric Power Stations
On the Optmal Control of a Cascade of Hydro-Electrc Power Statons M.C.M. Guedes a, A.F. Rbero a, G.V. Smrnov b and S. Vlela c a Department of Mathematcs, School of Scences, Unversty of Porto, Portugal;
More informationForecasting the Direction and Strength of Stock Market Movement
Forecastng the Drecton and Strength of Stock Market Movement Jngwe Chen Mng Chen Nan Ye cjngwe@stanford.edu mchen5@stanford.edu nanye@stanford.edu Abstract - Stock market s one of the most complcated systems
More informationA Comprehensive Analysis of Bandwidth Request Mechanisms in IEEE 802.16 Networks
A Comrehensve Analyss of Bandwdth Reuest Mechansms n IEEE 802.6 Networks Davd Chuck, Kuan-Yu Chen and J. Morrs Chang Deartment of Electrcal and Comuter Engneerng Iowa State Unversty, Ames, Iowa 500, USA
More informationForecasting the Demand of Emergency Supplies: Based on the CBR Theory and BP Neural Network
700 Proceedngs of the 8th Internatonal Conference on Innovaton & Management Forecastng the Demand of Emergency Supples: Based on the CBR Theory and BP Neural Network Fu Deqang, Lu Yun, L Changbng School
More information2008/8. An integrated model for warehouse and inventory planning. Géraldine Strack and Yves Pochet
2008/8 An ntegrated model for warehouse and nventory plannng Géraldne Strack and Yves Pochet CORE Voe du Roman Pays 34 B-1348 Louvan-la-Neuve, Belgum. Tel (32 10) 47 43 04 Fax (32 10) 47 43 01 E-mal: corestat-lbrary@uclouvan.be
More informationPreventive Maintenance and Replacement Scheduling: Models and Algorithms
Preventve Mantenance and Replacement Schedulng: Models and Algorthms By Kamran S. Moghaddam B.S. Unversty of Tehran 200 M.S. Tehran Polytechnc 2003 A Dssertaton Proposal Submtted to the Faculty of the
More informationDynamic Load Balancing of Parallel Computational Iterative Routines on Platforms with Memory Heterogeneity
Dynamc Load Balancng of Parallel Comutatonal Iteratve Routnes on Platforms wth Memory Heterogenety Davd Clare, Alexey Lastovetsy, Vladmr Rychov School of Comuter Scence and Informatcs, Unversty College
More informationThe Development of Web Log Mining Based on Improve-K-Means Clustering Analysis
The Development of Web Log Mnng Based on Improve-K-Means Clusterng Analyss TngZhong Wang * College of Informaton Technology, Luoyang Normal Unversty, Luoyang, 471022, Chna wangtngzhong2@sna.cn Abstract.
More informationAn Interest-Oriented Network Evolution Mechanism for Online Communities
An Interest-Orented Network Evoluton Mechansm for Onlne Communtes Cahong Sun and Xaopng Yang School of Informaton, Renmn Unversty of Chna, Bejng 100872, P.R. Chna {chsun,yang}@ruc.edu.cn Abstract. Onlne
More informationChapter 3: Dual-bandwidth Data Path and BOCP Design
Chater 3: Dual-bandwdth Data Path and BOCP Desgn 3. Introducton The focus of ths thess s on the 4G wreless moble Internet networks to rovde data servces wthn the overlang areas of CDA2000-WLA networks.
More informationDEFINING %COMPLETE IN MICROSOFT PROJECT
CelersSystems DEFINING %COMPLETE IN MICROSOFT PROJECT PREPARED BY James E Aksel, PMP, PMI-SP, MVP For Addtonal Informaton about Earned Value Management Systems and reportng, please contact: CelersSystems,
More informationA method for a robust optimization of joint product and supply chain design
DOI 10.1007/s10845-014-0908-5 A method for a robust optmzaton of jont product and supply chan desgn Bertrand Baud-Lavgne Samuel Bassetto Bruno Agard Receved: 10 September 2013 / Accepted: 21 March 2014
More informationRing structure of splines on triangulations
www.oeaw.ac.at Rng structure of splnes on trangulatons N. Vllamzar RICAM-Report 2014-48 www.rcam.oeaw.ac.at RING STRUCTURE OF SPLINES ON TRIANGULATIONS NELLY VILLAMIZAR Introducton For a trangulated regon
More informationGas Deliverability Model with Different Vertical Wells Properties
PROC. ITB En. Scence Vol. 35 B, No., 003, 5-38 5 Gas Delverablty Model wth Dfferent Vertcal Wells Proertes L. Mucharam, P. Sukarno, S. Srear,3, Z. Syhab, E. Soewono,3, M. Ar 3 & F. Iral 3 Deartment of
More informationLoad Balancing of Parallelized Information Filters
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. XXX, NO. XX, XXXXXXX 2001 1 Load Balancng of Parallelzed Informaton Flters Nel C. Rowe, Member, IEEE Comuter Socety, and Amr Zaky, Member, IEEE
More informationEfficient Computation of Optimal, Physically Valid Motion
Vol. xx No. xx,.1 5, 200x 1 Effcent Comutaton of Otmal, Physcally Vald Moton Anthony C. Fang 1 and Nancy S. Pollard 2 1 Deartment of Comuter Scence, Natonal Unversty of Sngaore 2 Robotcs Insttute, Carnege
More informationNON-CONSTANT SUM RED-AND-BLACK GAMES WITH BET-DEPENDENT WIN PROBABILITY FUNCTION LAURA PONTIGGIA, University of the Sciences in Philadelphia
To appear n Journal o Appled Probablty June 2007 O-COSTAT SUM RED-AD-BLACK GAMES WITH BET-DEPEDET WI PROBABILITY FUCTIO LAURA POTIGGIA, Unversty o the Scences n Phladelpha Abstract In ths paper we nvestgate
More informationL10: Linear discriminants analysis
L0: Lnear dscrmnants analyss Lnear dscrmnant analyss, two classes Lnear dscrmnant analyss, C classes LDA vs. PCA Lmtatons of LDA Varants of LDA Other dmensonalty reducton methods CSCE 666 Pattern Analyss
More informationPerformance Analysis of Energy Consumption of Smartphone Running Mobile Hotspot Application
Internatonal Journal of mart Grd and lean Energy Performance Analyss of Energy onsumpton of martphone Runnng Moble Hotspot Applcaton Yun on hung a chool of Electronc Engneerng, oongsl Unversty, 511 angdo-dong,
More informationThe Greedy Method. Introduction. 0/1 Knapsack Problem
The Greedy Method Introducton We have completed data structures. We now are gong to look at algorthm desgn methods. Often we are lookng at optmzaton problems whose performance s exponental. For an optmzaton
More informationBrigid Mullany, Ph.D University of North Carolina, Charlotte
Evaluaton And Comparson Of The Dfferent Standards Used To Defne The Postonal Accuracy And Repeatablty Of Numercally Controlled Machnng Center Axes Brgd Mullany, Ph.D Unversty of North Carolna, Charlotte
More informationCalculation of Sampling Weights
Perre Foy Statstcs Canada 4 Calculaton of Samplng Weghts 4.1 OVERVIEW The basc sample desgn used n TIMSS Populatons 1 and 2 was a two-stage stratfed cluster desgn. 1 The frst stage conssted of a sample
More informationA GENETIC ALGORITHM-BASED METHOD FOR CREATING IMPARTIAL WORK SCHEDULES FOR NURSES
82 Internatonal Journal of Electronc Busness Management, Vol. 0, No. 3, pp. 82-93 (202) A GENETIC ALGORITHM-BASED METHOD FOR CREATING IMPARTIAL WORK SCHEDULES FOR NURSES Feng-Cheng Yang * and We-Tng Wu
More informationAddendum to: Importing Skill-Biased Technology
Addendum to: Importng Skll-Based Technology Arel Bursten UCLA and NBER Javer Cravno UCLA August 202 Jonathan Vogel Columba and NBER Abstract Ths Addendum derves the results dscussed n secton 3.3 of our
More informationOmega 39 (2011) 313 322. Contents lists available at ScienceDirect. Omega. journal homepage: www.elsevier.com/locate/omega
Omega 39 (2011) 313 322 Contents lsts avalable at ScenceDrect Omega journal homepage: www.elsever.com/locate/omega Supply chan confguraton for dffuson of new products: An ntegrated optmzaton approach Mehd
More informationPayment Cards and Cash.
Interchange Fees and Ine cences n the Substtuton between Payment Cards and Cash. Maranne Verder June 7, 2010 Abstract Ths artcle exlans why the collectve determnaton of nterchange fees n ayment latforms
More informationTHE LOAD PLANNING PROBLEM FOR LESS-THAN-TRUCKLOAD MOTOR CARRIERS AND A SOLUTION APPROACH. Professor Naoto Katayama* and Professor Shigeru Yurimoto*
7th Internatonal Symposum on Logstcs THE LOAD PLAIG PROBLEM FOR LESS-THA-TRUCKLOAD MOTOR CARRIERS AD A SOLUTIO APPROACH Professor aoto Katayama* an Professor Shgeru Yurmoto* * Faculty of Dstrbuton an Logstcs
More informationResearch Article A Time Scheduling Model of Logistics Service Supply Chain with Mass Customized Logistics Service
Hndaw Publshng Corporaton Dscrete Dynamcs n Nature and Socety Volume 01, Artcle ID 48978, 18 pages do:10.1155/01/48978 Research Artcle A Tme Schedulng Model of Logstcs Servce Supply Chan wth Mass Customzed
More informationEnabling P2P One-view Multi-party Video Conferencing
Enablng P2P One-vew Mult-party Vdeo Conferencng Yongxang Zhao, Yong Lu, Changja Chen, and JanYn Zhang Abstract Mult-Party Vdeo Conferencng (MPVC) facltates realtme group nteracton between users. Whle P2P
More informationCan Auto Liability Insurance Purchases Signal Risk Attitude?
Internatonal Journal of Busness and Economcs, 2011, Vol. 10, No. 2, 159-164 Can Auto Lablty Insurance Purchases Sgnal Rsk Atttude? Chu-Shu L Department of Internatonal Busness, Asa Unversty, Tawan Sheng-Chang
More informationThe Retail Planning Problem Under Demand Uncertainty
Vol., No. 5, September October 013, pp. 100 113 ISSN 1059-1478 EISSN 1937-5956 13 05 100 DOI 10.1111/j.1937-5956.01.0144.x 013 Producton and Operatons Management Socety The Retal Plannng Problem Under
More informationA DATA MINING APPLICATION IN A STUDENT DATABASE
JOURNAL OF AERONAUTICS AND SPACE TECHNOLOGIES JULY 005 VOLUME NUMBER (53-57) A DATA MINING APPLICATION IN A STUDENT DATABASE Şenol Zafer ERDOĞAN Maltepe Ünversty Faculty of Engneerng Büyükbakkalköy-Istanbul
More informationHow To Understand The Results Of The German Meris Cloud And Water Vapour Product
Ttel: Project: Doc. No.: MERIS level 3 cloud and water vapour products MAPP MAPP-ATBD-ClWVL3 Issue: 1 Revson: 0 Date: 9.12.1998 Functon Name Organsaton Sgnature Date Author: Bennartz FUB Preusker FUB Schüller
More informationWhat is Candidate Sampling
What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble
More informationHow Sets of Coherent Probabilities May Serve as Models for Degrees of Incoherence
1 st Internatonal Symposum on Imprecse Probabltes and Ther Applcatons, Ghent, Belgum, 29 June 2 July 1999 How Sets of Coherent Probabltes May Serve as Models for Degrees of Incoherence Mar J. Schervsh
More informationModule 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 3 Lossless Compresson: Huffman Codng Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy..
More informationAvailability-Based Path Selection and Network Vulnerability Assessment
Avalablty-Based Path Selecton and Network Vulnerablty Assessment Song Yang, Stojan Trajanovsk and Fernando A. Kupers Delft Unversty of Technology, The Netherlands {S.Yang, S.Trajanovsk, F.A.Kupers}@tudelft.nl
More informationEvaluation of the information servicing in a distributed learning environment by using monitoring and stochastic modeling
MultCraft Internatonal Journal of Engneerng, Scence and Technology Vol, o, 9, -4 ITERATIOAL JOURAL OF EGIEERIG, SCIECE AD TECHOLOGY wwwest-ngcom 9 MultCraft Lmted All rghts reserved Evaluaton of the nformaton
More informationOptimal Bidding Strategies for Generation Companies in a Day-Ahead Electricity Market with Risk Management Taken into Account
Amercan J. of Engneerng and Appled Scences (): 8-6, 009 ISSN 94-700 009 Scence Publcatons Optmal Bddng Strateges for Generaton Companes n a Day-Ahead Electrcty Market wth Rsk Management Taken nto Account
More informationA NEW ACTIVE QUEUE MANAGEMENT ALGORITHM BASED ON NEURAL NETWORKS PI. M. Yaghoubi Waskasi MYaghoubi@ece.ut.ac.ir. M. J. Yazdanpanah Yazdan@ut.ac.
A NEW ACTIVE QUEUE MANAGEMENT ALGORITHM BASED ON NEURAL NETWORKS M. Yaghoub Waskas MYaghoub@ece.ut.ac.r M. J. Yazdananah Yazdan@ut.ac.r N. Yazdan Yazdan@ut.ac.r Control and Intellgent Processng Center
More informationPSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 12
14 The Ch-squared dstrbuton PSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 1 If a normal varable X, havng mean µ and varance σ, s standardsed, the new varable Z has a mean 0 and varance 1. When ths standardsed
More informationA GA Model Development for Decision Making Under Reverse Logistics
Internatonal Journal of Industral Engneerng & Producton Research December 2, Volume 2, umber 4 pp. 2-22 ISS: 28-4889 http://ijiepr.ust.ac.r/ A GA Model Development for Decson Mang Under Reverse Logstcs
More informationPAS: A Packet Accounting System to Limit the Effects of DoS & DDoS. Debish Fesehaye & Klara Naherstedt University of Illinois-Urbana Champaign
PAS: A Packet Accountng System to Lmt the Effects of DoS & DDoS Debsh Fesehaye & Klara Naherstedt Unversty of Illnos-Urbana Champagn DoS and DDoS DDoS attacks are ncreasng threats to our dgtal world. Exstng
More informationA Secure Password-Authenticated Key Agreement Using Smart Cards
A Secure Password-Authentcated Key Agreement Usng Smart Cards Ka Chan 1, Wen-Chung Kuo 2 and Jn-Chou Cheng 3 1 Department of Computer and Informaton Scence, R.O.C. Mltary Academy, Kaohsung 83059, Tawan,
More informationChapter 4 ECONOMIC DISPATCH AND UNIT COMMITMENT
Chapter 4 ECOOMIC DISATCH AD UIT COMMITMET ITRODUCTIO A power system has several power plants. Each power plant has several generatng unts. At any pont of tme, the total load n the system s met by the
More informationThe program for the Bachelor degrees shall extend over three years of full-time study or the parttime equivalent.
Bachel of Commerce Bachel of Commerce (Accountng) Bachel of Commerce (Cpate Fnance) Bachel of Commerce (Internatonal Busness) Bachel of Commerce (Management) Bachel of Commerce (Marketng) These Program
More informationLeveraged Firms, Patent Licensing, and Limited Liability
Leveraged Frms, Patent Lcensng, and Lmted Lablty Kuang-Cheng Andy Wang Socal Scence Dvson Center for General Educaton Chang Gung Unversty and Y-Je Wang Department of Economcs Natonal Dong Hwa Unversty
More information"Research Note" APPLICATION OF CHARGE SIMULATION METHOD TO ELECTRIC FIELD CALCULATION IN THE POWER CABLES *
Iranan Journal of Scence & Technology, Transacton B, Engneerng, ol. 30, No. B6, 789-794 rnted n The Islamc Republc of Iran, 006 Shraz Unversty "Research Note" ALICATION OF CHARGE SIMULATION METHOD TO ELECTRIC
More informationThe Application of Fractional Brownian Motion in Option Pricing
Vol. 0, No. (05), pp. 73-8 http://dx.do.org/0.457/jmue.05.0..6 The Applcaton of Fractonal Brownan Moton n Opton Prcng Qng-xn Zhou School of Basc Scence,arbn Unversty of Commerce,arbn zhouqngxn98@6.com
More informationDynamic Constrained Economic/Emission Dispatch Scheduling Using Neural Network
Dynamc Constraned Economc/Emsson Dspatch Schedulng Usng Neural Network Fard BENHAMIDA 1, Rachd BELHACHEM 1 1 Department of Electrcal Engneerng, IRECOM Laboratory, Unversty of Djllal Labes, 220 00, Sd Bel
More informationTHE DISTRIBUTION OF LOAN PORTFOLIO VALUE * Oldrich Alfons Vasicek
HE DISRIBUION OF LOAN PORFOLIO VALUE * Oldrch Alfons Vascek he amount of captal necessary to support a portfolo of debt securtes depends on the probablty dstrbuton of the portfolo loss. Consder a portfolo
More informationFault tolerance in cloud technologies presented as a service
Internatonal Scentfc Conference Computer Scence 2015 Pavel Dzhunev, PhD student Fault tolerance n cloud technologes presented as a servce INTRODUCTION Improvements n technques for vrtualzaton and performance
More informationOptimal Joint Replenishment, Delivery and Inventory Management Policies for Perishable Products
Optmal Jont Replenshment, Delvery and Inventory Management Polces for Pershable Products Leandro C. Coelho Glbert Laporte May 2013 CIRRELT-2013-32 Bureaux de Montréal : Bureaux de Québec : Unversté de
More informationv a 1 b 1 i, a 2 b 2 i,..., a n b n i.
SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 455 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces we have studed thus far n the text are real vector spaces snce the scalars are
More informationMarginal Revenue-Based Capacity Management Models and Benchmark 1
Margnal Revenue-Based Capacty Management Models and Benchmark 1 Qwen Wang 2 Guanghua School of Management, Pekng Unversty Sherry Xaoyun Sun 3 Ctgroup ABSTRACT To effcently meet customer requrements, a
More informationOverview of monitoring and evaluation
540 Toolkt to Combat Traffckng n Persons Tool 10.1 Overvew of montorng and evaluaton Overvew Ths tool brefly descrbes both montorng and evaluaton, and the dstncton between the two. What s montorng? Montorng
More informationSimulation and optimization of supply chains: alternative or complementary approaches?
Smulaton and optmzaton of supply chans: alternatve or complementary approaches? Chrstan Almeder Margaretha Preusser Rchard F. Hartl Orgnally publshed n: OR Spectrum (2009) 31:95 119 DOI 10.1007/s00291-007-0118-z
More informationWaste to Energy System in Shanghai City
Waste to Energy System n Shangha Cty Group of Envronmental Systems, Department of Envronmental Studes M2 46876 Ya-Y Zhang 1. Introducton In the past ffteen years, the economcs of Chna has mantaned contnuously
More informationLoop Parallelization
- - Loop Parallelzaton C-52 Complaton steps: nested loops operatng on arrays, sequentell executon of teraton space DECLARE B[..,..+] FOR I :=.. FOR J :=.. I B[I,J] := B[I-,J]+B[I-,J-] ED FOR ED FOR analyze
More informationAnswer: A). There is a flatter IS curve in the high MPC economy. Original LM LM after increase in M. IS curve for low MPC economy
4.02 Quz Solutons Fall 2004 Multple-Choce Questons (30/00 ponts) Please, crcle the correct answer for each of the followng 0 multple-choce questons. For each queston, only one of the answers s correct.
More informationInter-domain Alliance Authentication Protocol Based on Blind Signature
Internatonal Journal of Securty Its Alcatons Vol9 No2 (205) 97-206 htt://ddoorg/04257/sa205929 Inter-doman Allance Authentcaton Protocol Based on Blnd Sgnature Zhang Je Zhang Q-kun Gan Yong Yn Yfeng Tan
More information1 Example 1: Axis-aligned rectangles
COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture # 6 Scrbe: Aaron Schld February 21, 2013 Last class, we dscussed an analogue for Occam s Razor for nfnte hypothess spaces that, n conjuncton
More informationPerformance Analysis and Coding Strategy of ECOC SVMs
Internatonal Journal of Grd and Dstrbuted Computng Vol.7, No. (04), pp.67-76 http://dx.do.org/0.457/jgdc.04.7..07 Performance Analyss and Codng Strategy of ECOC SVMs Zhgang Yan, and Yuanxuan Yang, School
More informationSurvey on Virtual Machine Placement Techniques in Cloud Computing Environment
Survey on Vrtual Machne Placement Technques n Cloud Computng Envronment Rajeev Kumar Gupta and R. K. Paterya Department of Computer Scence & Engneerng, MANIT, Bhopal, Inda ABSTRACT In tradtonal data center
More informationIMPACT ANALYSIS OF A CELLULAR PHONE
4 th ASA & μeta Internatonal Conference IMPACT AALYSIS OF A CELLULAR PHOE We Lu, 2 Hongy L Bejng FEAonlne Engneerng Co.,Ltd. Bejng, Chna ABSTRACT Drop test smulaton plays an mportant role n nvestgatng
More informationReal-Time Traffic Signal Intelligent Control with Transit-Priority
738 JOURNAL OF SOFTWARE, VOL. 7, NO. 8, AUGUST 202 Real-Tme Traffc Sgnal Intellgent ontrol wth Transt-Prorty Xanyan Kuang School of vl Engneerng and Transortaton, South hna Unversty of Technology, GuangZhou,
More informationAN APPOINTMENT ORDER OUTPATIENT SCHEDULING SYSTEM THAT IMPROVES OUTPATIENT EXPERIENCE
AN APPOINTMENT ORDER OUTPATIENT SCHEDULING SYSTEM THAT IMPROVES OUTPATIENT EXPERIENCE Yu-L Huang Industral Engneerng Department New Mexco State Unversty Las Cruces, New Mexco 88003, U.S.A. Abstract Patent
More informationCausal, Explanatory Forecasting. Analysis. Regression Analysis. Simple Linear Regression. Which is Independent? Forecasting
Causal, Explanatory Forecastng Assumes cause-and-effect relatonshp between system nputs and ts output Forecastng wth Regresson Analyss Rchard S. Barr Inputs System Cause + Effect Relatonshp The job of
More informationAn Empirical Study of Search Engine Advertising Effectiveness
An Emprcal Study of Search Engne Advertsng Effectveness Sanjog Msra, Smon School of Busness Unversty of Rochester Edeal Pnker, Smon School of Busness Unversty of Rochester Alan Rmm-Kaufman, Rmm-Kaufman
More informationFeature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College
Feature selecton for ntruson detecton Slobodan Petrovć NISlab, Gjøvk Unversty College Contents The feature selecton problem Intruson detecton Traffc features relevant for IDS The CFS measure The mrmr measure
More information1.1 The University may award Higher Doctorate degrees as specified from time-to-time in UPR AS11 1.
HIGHER DOCTORATE DEGREES SUMMARY OF PRINCIPAL CHANGES General changes None Secton 3.2 Refer to text (Amendments to verson 03.0, UPR AS02 are shown n talcs.) 1 INTRODUCTION 1.1 The Unversty may award Hgher
More informationSolving Factored MDPs with Continuous and Discrete Variables
Solvng Factored MPs wth Contnuous and screte Varables Carlos Guestrn Berkeley Research Center Intel Corporaton Mlos Hauskrecht epartment of Computer Scence Unversty of Pttsburgh Branslav Kveton Intellgent
More informationInteger Programming Formulations for the Uncapacitated Vehicle Routing p-hub Center Problem
21st Internatonal Congress on Modellng and Smulaton, Gold Coast, Australa, 29 No to 4 Dec 2015 www.mssanz.org.au/modsm2015 Integer Programmng Formulatons for the Uncapactated Vehcle Routng p-hub Center
More informationSupply network formation as a biform game
Supply network formaton as a bform game Jean-Claude Hennet*. Sona Mahjoub*,** * LSIS, CNRS-UMR 6168, Unversté Paul Cézanne, Faculté Sant Jérôme, Avenue Escadrlle Normande Némen, 13397 Marselle Cedex 20,
More informationChapter 7: Answers to Questions and Problems
19. Based on the nformaton contaned n Table 7-3 of the text, the food and apparel ndustres are most compettve and therefore probably represent the best match for the expertse of these managers. Chapter
More information