Duality for nonsmooth mathematical programming problems with equilibrium constraints
|
|
- Clinton White
- 8 years ago
- Views:
Transcription
1 uu et al. Journal of Inequaltes and Applcatons (2016) 2016:28 DOI /s R E S E A R C H Open Access Dualty for nonsmooth mathematcal programmng problems wth equlbrum constrants Sy-Mng uu 1*, Shash Kant Mshra 2 and Yogendra Pandey 2 * Correspondence: esmguu@mal.cgu.edu.tw 1 College of Management, Chang ung Unversty and Research Dvson, Chang ung Memoral Hosptal, Taoyuan, Tawan Full lst of author nformaton s avalable at the end of the artcle Abstract In ths paper, we consder the mathematcal programs wth equlbrum constrants (MPECs) n Banach space. The objectve functon and functons n the constrant part are assumed to be lower semcontnuous. We study the Wolfe-type dual problem for the MPEC under the convexty assumpton. A Mond-Wer-type dual problem s also formulated and studed for the MPEC under convexty and generalzed convexty assumptons. Condtons for weak dualty theorems are gven to relate the MPEC and two dual programs n Banach space, respectvely. Also condtons for strong dualty theorems are establshed n an Asplund space. MSC: 90C30; 90C46 Keywords: mathematcal programmng problems wth equlbrum constrants; Wolfe-type dual; Mond-Wer dual; convexty; nonsmooth analyss 1 Introducton Luo et al. [1] presented a comprehensve study of MPEC. Flegel and Kanzow [2] obtaned short and elementary proof of the optmalty condtons for MPEC usng the standard Frtz-John condtons. Further, Flegel and Kanzow [3] ntroduced a new Abade-type constrant qualfcaton and a new Slater-type constrant qualfcaton for the MPEC and proved that new Slater-type CQ mples new Abade-type CQ. Ye [4] consdered MPEC and ntroduced varous statonary condtons and establshed that t s suffcent for beng globally or locally optmal under some generalzed convexty assumpton and obtaned new constrant qualfcatons. Outrataet al. [5] derved necessary optmalty condtons for those MPECs whch can be treated by the mplct programmng approach and proposed a soluton method based on the bundle technque of nonsmooth optmzaton. Flegel et al. [6] consdered optmzaton problems wth a dsjunctve structure of the feasble set and obtaned optmalty condtons for dsjunctve programs wth applcaton to MPEC usng ugnard-type constrant qualfcatons. Movahedan and Nobakhtan [7] ntroduced nonsmooth strong statonarty, M-statonarty and generalzed the Abade and ugnard-type constrant qualfcatons for nonsmooth MPEC. Movahedan and Nobakhtan [8] ntroduced a nonsmooth type of the M-statonary condton based on the Mchel-Penot subdfferental and establshed the Frtz-John-type, Kuhn-Tucker-type M-statonary necessary condtons for the 2016 uu et al. Ths artcle s dstrbuted under the terms of the Creatve Commons Attrbuton 4.0 Internatonal Lcense ( whch permts unrestrcted use, dstrbuton, and reproducton n any medum, provded you gve approprate credt to the orgnal author(s) and the source, provde a lnk to the Creatve Commons lcense, and ndcate f changes were made.
2 uu et al. Journal of Inequaltes and Applcatons (2016) 2016:28 Page 2 of 15 nonsmoothmpec. Further,Movahedan andnobakhtan [9] establshed necessary optmalty condtons for Lpschtz MPEC on Asplund space and suffcent optmalty condtons for nonsmooth MPEC n Banach space. We refer to the recent results of Ardal et al. [10], Cheu and Lee [11], uo and Ln [12], uo et al. [13, 14] and Ye and Zhang [15], and the references theren for more detals related to the MPEC. FollowngLuo et al. [1]andMovahedan and Nobakhtan [9], we consder the followng mathematcal programmng problem wth equlbrum constrants (MPEC): (MPEC) mnf (z) subject to: g(z) 0, h(z)=0, (z) 0, H(z) 0, (z), H(z) =0, where X s a Banach space, f : X R s a lower sem-contnuous (lsc) functon, g : X R k, h : X R p, : X R l and H : X R l are functons wth lsc components. The use of equlbrum constrants n modelng process engneerng problems s a relatvely new and exctng feld of research; see Raghunathan and Begler [16]. Hydroeconomc rver basn models (HERBM) based on mathematcal programmng are conventonally formulated as explct aggregate optmzaton problems wth a sngle, aggregate objectve functon. Brtz et al. [17] proposed a new soluton format for hydroeconomc rver basn models, based on a multobjectve optmzaton problem wth equlbrum constrants, whch allowed, nter ala, to express spatal externaltes resultng from asymmetrc access to water use. Wolfe [18] formulateda dualprogramfora nonlnear programmngproblem. Motvated by a specfc problem, namely the mathematcal descrpton of the rotatng heavy chan, Toland [19, 20] ntroduced the noton of dualty and establshed the dualty theory for nonconvex optmzaton problems. Rockafellar [21, 22] studed fundamental dualty theory for convex programs usng a conjugate functon and establshed a generalzed verson of the Fenchelís dualty theorem. In the last four decades there has been an extensve nterest n the dualty theory of nonlnear programmng problems; see Mangasaran [23] andmshra and org [24]. To the best of our knowledge, the dual problem to a nonsmooth MPEC has not been gven n the lterature as yet. In ths paper, we ntroduce Wolfe-type and Mond-Wer-type dual programs to the nonsmooth MPEC. We have establshed weak and strong dualty theorems relatng the nonsmooth MPEC and the two dual programs. The paper s organzed as follows: n Secton 2, we gve some prelmnares, defntons, and results. In Secton 3, wederveweakand strong dualty theorems relatng to the nonsmooth MPEC and the two dual models under convexty and generalzed convexty assumptons. 2 Prelmnares In ths secton, we gve some notatons, basc defntons, and prelmnary results, whch wll be used later n the paper. The Clarke-Rockafellar subdfferental of f s defned by c f (x)= { x X : x, v f (x; v), v X },
3 uu et al. Journal of Inequaltes and Applcatons (2016) 2016:28 Page 3 of 15 where f (x; v)=sup nf ɛ>0 γ >0 δ>0 >0 sup y B(x;γ ) f (y) f (x)+δ t (0,) f (y + tw) f (y) nf w B(v;ɛ) t s the Clarke-Rockafellar drectonal dervatve. Defnton 2.1 (Rockafellar [25]) The lsc functon f : X R {+ } s drectonally Lpschtzan at x f for some y X, lm sup sup x f x t 0 y y f (x + ty ) f (x ) t <. The functon f : X R {+ } s sad to be radally nonconstant (rnc) f x, y X, z (x, y), wth f (z) f (x),.e., one cannot fnd any lne segment on whch f s constant. Defnton 2.2 (Avrel et al. [26]) The lsc functon f : X R {+ } s sad to be a quasconvex functon, f for any x, y X,onehas f (z) max { f (x), f (y) }, x, y X, z [x, y], where [x, y]={x + t(y x):t (0, 1)}. Defnton 2.3 (Clarke [27]) The lsc functon f : X R {+ } s sad to be a convex functon at x X,f,forallx X, f (x) f ( x)+ ξ, x x, ξ c f ( x). Defnton 2.4 (Aussel [28]) The lsc functon f : X R {+ } s sad to be pseudoconvex functon at x X,f,forallx X, ξ, x x 0, for some ξ c f ( x) f (x) f ( x), f (x)<f ( x) ξ, x x <0, ξ c f ( x). Theorem 2.5 (Aussel [28]) Let f : X R {+ } be lsc, quasconvex and rnc on a convex open set U X. Moreover, assume that f s fnte at x Uandf ( x;0)>. Then, for each x U, f (x) f ( x) ξ c f ( x): ξ, x x 0. ven a feasble vector z for the MPEC,we defne the followngndex sets: I g := I g ( z):= { =1,2,...,k : g ( z)=0 }, α := α( z)= { =1,2,...,l : ( z)=0,h ( z)>0 },
4 uu et al. Journal of Inequaltes and Applcatons (2016) 2016:28 Page 4 of 15 β := β( z)= { =1,2,...,l : ( z)=0,h ( z)=0 }, γ := γ ( z)= { =1,2,...,l : ( z)>0,h ( z)=0 }. The set β s known as a degenerate set. If β s empty, the vector z s sad to satsfy the strct complementarty condton. Movahedan and Nobakhtan [8] ntroduced a nonsmooth type of M-statonary va the Mchel-Penot subdfferental for fnte-dmensonal spaces. Further, Movahedan and Nobakhtan [9] extend the M-statonary noton to nonsmooth MPEC n terms of the Clarke-Rockafellar subdfferental n Banach spaces. The followng defnton of the M-statonary pont for the nonsmooth MPEC s taken from Defnton 3.1 n Movahedan and Nobakhtan [9]. Defnton 2.6 Afeasblepont z of MPEC s called the Mordukhovch statonary pont f there exsts =( g, h,, H ) R k+p+2l, such that the followng condtons hold: 0 c f ( z)+ I g g cg ( z)+ h ch ( z) [ c ( z)+ H c H ( z) ], g I g 0, γ =0, H α =0, ether >0, H >0or H =0, β. The followng defnton of the no nonzero abnormal multpler constrant qualfcaton for MPEC s taken from Defnton 3.3 n Movahedan and Nobakhtan [9]. Defnton 2.7 Let z be a feasble pont of MPEC. We say that the No Nonzero Abnormal Multpler Constrant Qualfcaton (NNAMCQ) s satsfed at z f there s no nonzero vector =( g, h,, H ) R k+p+2l,suchthat 0 I g g cg ( z)+ h ch ( z) [ c ( z)+ H c H ( z) ], g I g 0, γ =0, H α =0, ether >0, H >0or H =0, β. Defnton 2.8 (Mordukhovch [29]) A Banach space X s Asplund, or t has the Asplund property, f every convex contnuous functon φ : U R defned on an open convex subset U of X s a Frechet dfferental on a dense subset of U. In the followng theorem,movahedan and Nobakhtan [9] proved a necessary optmalty condton for Lpschtz MPEC on Asplund spaces. Theorem 2.9 Let z be a local optmal pont for the MPEC where X s an Asplund space and all of the functons are locally Lpschtz around z. Then z s an M-statonary pont provded that the NNAMCQ holds at z. Now, dvde the ndex sets as follows. Let J + := { : h >0 }, J := { : h <0 }, β + := { β : >0, H >0 },
5 uu et al. Journal of Inequaltes and Applcatons (2016) 2016:28 Page 5 of 15 β + := { β : =0, H >0 }, β := { β : =0, H <0 }, β H + := { β : H =0, >0 }, β H := { β : H =0, <0 }, α + := { α : >0 }, α := { α : <0 }, γ + := { γ : H >0 }, γ := { γ : H <0 }. 3 Dualty In ths secton, we formulate and study a Wolfe-type dual problem for the MPEC under the convexty assumpton. A Mond-Wer-type dual problem s also formulated and studed for the MPEC under convexty and generalzed convexty assumptons. The Wolfe-type dual problem s formulated as follows: WDMPEC( z) max f (u)+ g g (u)+ u, I g h h (u) [ (u)+ H H (u) ] subject to 0 c f (u)+ I g g cg (u)+ h ch (u) [ c (u)+ H c H (u) ], (3.1) g I g 0, γ =0, H α =0, ether >0, H >0or H =0, β, where =( g, h,, H ) R k+p+2l. Theorem 3.1 (Weak dualty) Let zbefeasbleformpec where X s a Banach space,(u, ) feasble for WDMPEC( z), and ndex sets I g, α, β, γ defned accordngly. Suppose that f, g ( I g ), h ( J + ), ( α β H ), H ( γ β ) are convex at u and radally nonconstant. Also, assume that h ( J ), ( α + β H + β+ ), H ( γ + β + β+ ) are drectonally Lpschtzan, convex at u, and radally nonconstant. If α γ β β H = φ, then, for any z feasble for the MPEC,we have f (z) f (u)+ I g g g (u)+ h h (u) [ (u)+ H H (u) ]. Proof Let z be any feasble pont for MPEC. Then we have g (z) 0, I g and h (z)=0, =1,2,...,p. Snce f s convex at u, f (z) f (u) ξ, z u, ξ c f (u). (3.2) Smlarly, we have g (z) g (u) ξ g, z u, h (z) h (u) ξ h, z u, ξ g c g (u), I g, (3.3) ξ h c h (u), J +, (3.4)
6 uu et al. Journal of Inequaltes and Applcatons (2016) 2016:28 Page 6 of 15 h (z)+h (u) ξ h, z u, (z)+ (u) ξ, z u, ξ h c h (u), J, (3.5) ξ c (u), α + β H + β+, (3.6) H (z)+h (u) ξ H, z u, ξ H c H (u), γ + β + β+. (3.7) If α γ β β H = φ, multplyng (3.3)-(3.7)byg 0( I g), h >0( J + ), h >0 ( J ), >0( α + β H + β+ ), H >0( γ + β + β+ ), respectvely, and addng (3.2)-(3.7), we get f (z) f (u)+ I g g g (z) I g g g (u)+ h h (z) h h (u) (z) + (u) H H (z)+ ξ + g ξ g + h ξ h I g H H (u) [ ξ + H ξ H ], z u. From (3.1), there exst ξ c f (u), ξ g c g (u), ξ h c h (u), ξ c (u), and ξ H c H (u), such that ξ + Ig g ξ g + h ξ h [ ξ + H ξ H ] =0. So, f (z) f (u)+ I g g g (z) I g g g (u)+ h h (z) h h (u) (z)+ (u) H H (z)+ H H (u) 0. Now, usng the feasblty of z for MPEC, that s, g (z) 0, h (z)=0, (z) 0, H (z) 0, we get f (z) f (u) I g g g (u) h h (u)+ (u)+ H H (u) 0. Hence, f (z) f (u)+ I g g g (u)+ h h (u) [ (u)+ ] H H (u). Ths completes the proof. The followng corollary s a drect consequence of Theorem 3.1.
7 uu et al. Journal of Inequaltes and Applcatons (2016) 2016:28 Page 7 of 15 Corollary 3.2 Let z befeasbleformpec where all constrant functons g, h,, H are affne and ndex sets I g, α, β, γ defned accordngly. Then, for any z feasble for the MPEC and (u, ) feasble for WDMPEC( z), we have f (z) f (u)+ I g g g (u)+ h h (u) [ (u)+ H H (u) ]. Analogously, we have the followng result for Asplund spaces. Theorem 3.3 (Weak dualty) Let z befeasbleformpec where X s an Asplund space, (u, ) feasble for WDMPEC( z) and ndex sets I g, α, β, γ defned accordngly. Suppose that f, g ( I g ), h ( J + ), ( α β H ), H ( γ β ) are convex at u and radally nonconstant. Also, assume that h ( J ), ( α + β H + β+ ), H ( γ + β + β+ ) are drectonally Lpschtzan, convex at u, and radally nonconstant. If α γ β β H = φ, then, for any z feasble for the MPEC, we have f (z) f (u)+ I g g g (u)+ h h (u) [ (u)+ H H (u) ]. Proof The proof follows the lnes of the proof of Theorem 3.1. Theorem 3.4 (Strong dualty) Assume z s a locally optmal soluton of MPEC where X s an Asplund space, such that NNAMCQ s satsfed at z and the ndex sets I g, α, β, γ are defned accordngly. Let f, g ( I g ), h ( J + ), h ( J ), ( α β H ), ( α + β H + β+ ), H ( γ β ), H ( γ + β + β+ ) satsfy the assumpton of the Theorem 3.3. Then there exsts, such that ( z, ) s an optmal soluton of WDMPEC( z) and the respectve objectve values are equal. Proof Snce z s a locally optmal soluton of MPEC and the NNAMCQ s satsfed at z, hence, by Theorem 2.9, =( g, h,, H ) R k+p+2l, such that the nonsmooth M- statonarty condtons for MPEC are satsfed, that s, there exst ξ c f ( z), ξ g c g ( z), ξ h c h ( z), ξ c ( z), and ξ H c H ( z), such that 0= ξ + I g g ξ g + h ξ h [ ξ + H ξ H ], g I g 0, γ =0, H α =0, ether >0, H >0or H =0, β. Therefore, ( z, )sfeasbleforwdmpec( z). By Theorem 3.3,wehave f ( z) f (u)+ I g g g (u)+ h h (u) [ (u)+ H H (u) ], (3.8) for any feasble soluton (u, ) forwdmpec( z). Also, from the feasblty condton of MPEC and WDMPEC( z), that s, for I g ( z), g ( z)=0,andh ( z)=0, ( z)=0, α β,
8 uu et al. Journal of Inequaltes and Applcatons (2016) 2016:28 Page 8 of 15 H ( z)=0, β γ,wehave f ( z)=f ( z)+ I g g g ( z)+ h h ( z) [ ( z)+ H H ( z) ]. (3.9) Usng (3.8)and(3.9), we have f ( z)+ I g g g ( z)+ h h ( z) [ ( z)+ H H ( z) ] f (u)+ I g g g (u)+ h h (u) [ (u)+ H H (u) ]. Hence, ( z, ) s an optmal soluton for WDMPEC( z) andtherespectveobjectvevalues are equal. Example 3.1 Consder the followng MPEC n R 2 : MPEC(1) mn z 1 + z2 2 subject to : z 1 + z 2 0, z 2 0, ( ) z 2 z1 + z 2 =0. Now, we formulate Wolfe-type dual problem WDMPEC( z) for MPEC(1): max u, u 1 + u 2 2 [ ( u 1 + u 2 ) + H ( u 2 ) ] subject to ( ) ( ) ( ) ( ) 0 ξ = η H 0, 0 2u where ξ, η [ 1, 1]. If β s non-empty, then ether >0, H >0, or H =0. If we take the pont z = (0, 0) from the feasble regon, then the ndex sets α(0, 0) and γ (0, 0) are empty sets, but β := β(0, 0) s non-empty. Also, from solvng a constrant equaton n the feasble regon of WDMPEC(0, 0), we get = ξ η and H = ξ η 2u 2,where η 0.Snceβ s non-empty, we consder a β +, β +, β+ H to decde the feasble regon of WDMPEC(0, 0). It s clear that the assumptons of Theorem 3.1 are satsfed, so Theorem 3.1holdsbetween MPEC(1) and WDMPEC(0, 0). It s clear that z = (0, 0) s the optmal soluton of MPEC(1) and NNAMCQ s satsfed at z. Hence, the assumptons of the Theorem 3.4 are satsfed. Then, by Theorem 3.4, there
9 uu et al. Journal of Inequaltes and Applcatons (2016) 2016:28 Page 9 of 15 exsts such that ( z, )s anoptmalsolutonof WDMPEC(0,0)andtherespectve values are equal. We now prove the dualty relaton between the mathematcal programmng problem wth equlbrum constrants (MPEC) and the followng Mond-Wer-type dual problem MWDMPEC( z) max f (u) u, subject to 0 c f (u)+ I g g cg (u)+ h ch (u) [ c (u)+ H c H (u) ], (3.10) g (u) 0 ( I g ), h (u)=0 ( =1,...,p), (u) 0 ( α β), H (u) 0 ( β γ ), g I g 0, γ =0, H α =0, ether >0, H >0or H =0, β, where =( g, h,, H ) R k+p+2l. Theorem 3.5 (Weak dualty) Let zbefeasbleformpec where X s a Banach space,(u, ) be feasble for MWDMPEC( z), and the ndex sets I g, α, β, γ are defned accordngly. Suppose that f, g ( I g ), h ( J + ), ( α β H ), H ( γ β ) are convex at u and radally nonconstant. Also, assume that h ( J ), ( α + β H + β+ ), H ( γ + β + β+ ) are drectonally Lpschtzan, convex at u, and radally nonconstant. If α γ β β H = φ, then, for any z feasble for the MPEC, we have f (z) f (u). Proof Snce f s convex at u, f (z) f (u) ξ, z u, ξ c f (u). (3.11) Smlarly, we have g (z) g (u) ξ g, z u, h (z) h (u) ξ h, z u, ξ g c g (u), I g, (3.12) ξ h c h (u), J +, (3.13) h (z)+h (u) ξ h, z u, (z)+ (u) ξ, z u, ξ h c h (u), J, (3.14) ξ c (u), α + β + H β+, (3.15) H (z)+h (u) ξ H, z u, ξ H c H (u), γ + β + β+. (3.16) If α γ β β H = φ, multplyng (3.12)-(3.16)byg 0( I g), h >0( J + ), h >0 ( J ), >0( α + β H + β+ ), H >0( γ + β + β+ ), respectvely, and addng
10 uu et al. Journal of Inequaltes and Applcatons (2016) 2016:28 Page 10 of 15 (3.11)-(3.16), we get f (z) f (u)+ I g g g (z) I g g g (u)+ h h (z) h h (u) (z) + (u) H H (z)+ ξ + g ξ g + h ξ h I g H H (u) [ ξ + H ξ H ], z u. From (3.10), there exst ξ c f (u), ξ g c H (u), such that c g (u), ξ h c h (u), ξ c (u), and ξ H ξ + Ig g ξ g + h ξ h [ ξ + H ξ H ] =0. So, f (z) f (u)+ I g g g (z) I g g g (u)+ h h (z) h h (u) (z)+ (u) H H (z)+ H H (u) 0. Now, usng the feasblty of z and u for MPEC and MWDMPEC( z),respectvely, we get f (z) f (u). Ths completes the proof. The followng corollary s a drect consequence of Theorem 3.5. Corollary 3.6 Let z befeasbleformpec where all constrant functons g, h,, H are affne and the ndex sets I g, α, β, γ defned accordngly. Then, for any z feasble for the MPEC and (u, ) feasble for MWDMPEC( z), we have f (z) f (u). Analogously, we have the followng result for Asplund spaces. Theorem 3.7 (Weak dualty) Let z befeasbleformpec where X s an Asplund space, (u, ) be feasble for MWDMPEC( z) and the ndex sets I g, α, β, γ are defned accordngly. Suppose that f, g ( I g ), h ( J + ), ( α β H ), H ( γ β ) are convex at u and radally nonconstant. Also, assume that h ( J ), ( α + β H + β+ ), H ( γ + β + β+ ) are drectonally Lpschtzan, convex at u, and radally nonconstant. If α
11 uu et al. Journal of Inequaltes and Applcatons (2016) 2016:28 Page 11 of 15 γ β β H = φ, then, for any z feasble for the MPEC, we have f (z) f (u). Proof The proof follows the lnes of the proof of Theorem 3.5. Theorem 3.8 (Strong dualty) Assume z s a locally optmal soluton of MPEC where X s an Asplund space, such that NNAMCQ s satsfed at z and the ndex sets I g, α, β, γ defned accordngly. Let f, g ( I g ), h ( J + ), h ( J ), ( α β H ), ( α + β + H β+ ), H ( γ β ), H ( γ + β + β+ ) satsfy the assumpton of the Theorem 3.7. Then there exsts, such that ( z, ) s an optmal soluton of MWDMPEC( z), and the respectve objectve values are equal. Proof z s a locally optmal soluton of MPEC and the NNAMCQ s satsfed at z,bytheorem 2.9, =( g, h,, H ) R k+p+2l, such that the nonsmooth M-statonarty condtons for MPEC are satsfed, that s, there exst ξ c f ( z), ξ g c g ( z), ξ h c h ( z), ξ c ( z) and ξ H c H ( z), such that 0= ξ + I g g ξ g + h ξ h [ ξ + H ξ H ], g I g 0, γ =0, H α =0, ether >0, H >0or H =0, β. Snce z s an optmal soluton for MPEC, we have g g ( z)=0, I g h h ( z)=0, ( z)=0, H H ( z)=0. Therefore, ( z, ) s feasblefor MWDMPEC( z). Also, by Theorem 3.7, for any feasble (u, ), we have f ( z) f (u). Thus, ( z, ) s an optmal soluton for MWDMPEC( z) andtherespectveobjectvevalues are equal. Ths completes the proof. Example 3.2 Consder the followng MPEC problem n R 2 : MPEC mn z 1 + z 2 subject to z 1 + z 2 0, z 2 z 1 0, ( z1 + z 2 )( z2 z 1 ) =0. The Mond-Wer-type dual problem MWDMPEC( z)forthempecs max u, u 1 + u 2
12 uu et al. Journal of Inequaltes and Applcatons (2016) 2016:28 Page 12 of 15 subject to ( ) ( ) ( ) ( ) 0 ξ 1 = ξ 2 H η, (3.17) where ξ 1, ξ 2, η [ 1, 1], ( u 1 + u 2 ) 0, (3.18) H( u 2 u 1 ) 0, (3.19) f β s non-empty, then ether >0, H >0, or H =0. From (3.17), ξ 2 + H η = ξ 1,and + H =1,weget H = ξ 2 ξ 1 ξ 2 η and = ξ 1 η ξ 2 η,where ξ 2 η. If z = (0, 0), then the ndex sets α(0, 0) and γ (0, 0) are empty sets, but β(0, 0) s non-empty. It s clear that the assumptons of Corollary 3.6 are satsfed. So,Corollary 3.6 holds between MPEC and MWDMPEC(0, 0). Also, we can see that the NNAMCQ s satsfed at z. Then by Theorem 3.8 there exsts =(, H )suchthat( z, ) s an optmal soluton of MWDMPEC(0, 0) and the optmal values are equal. Now, we establsh weak and strong dualty theorems for the MPEC and ts Mond-Wertype dual problem under generalzed convexty assumptons. Theorem 3.9 (Weak dualty) Let zbefeasbleformpec where X s a Banach space,(u, ) be feasble for MWDMPEC( z), and the ndex sets I g, α, β, γ are defned accordngly. Suppose that f s pseudoconvex at z, g ( I g ), h ( J + ), ( α β H ), H ( γ β ) are quasconvex at u and radally nonconstant. Also, assume that h ( J ), ( α + β H + β+ ), H ( γ + β + β+ ) are drectonally Lpschtzan, quasconvex at u, and radally nonconstant. If α γ β β H = φ, then, for any z feasble for the MPEC, we have f (z) f (u). Proof Supposethat,forsomefeasblepontz, suchthatf (z)<f (u), then, by pseudoconvexty of f at u,wehave ξ, z u <0, ξ c f (u). (3.20) From (3.10), there exst ξ g c g (u) ( I g ), ξ h α β)and ξ H c H (u)( β γ ), such that I g g ξ g h ξ h + α β ξ + β γ H c h (u) ( = 1,...,p), ξ c (u) ( ξ H c f (u). (3.21)
13 uu et al. Journal of Inequaltes and Applcatons (2016) 2016:28 Page 13 of 15 By (3.20), we get ( g ξ g h ξ h + I g α β ξ + β γ H ξ H ), z u <0. (3.22) For each I g, g (z) 0 g (u). Hence, by Theorem 4.4 n [9], we have ξ, z u 0, ξ c g (u), I g. (3.23) Smlarly, we have ξ, z u 0, ξ c h (u), J +. (3.24) Now, for any feasble pont u of MWDMPEC( z), and for each J,0= h (u)=h (z). On the other hand, (z) (u), α + β H +,and H (z) H (u), γ + β +.Snce all of these functons are drectonally Lpschtzan, by Theorem 2.5,weget ξ, z u 0, ξ c h (u), J, (3.25) ξ, z u 0, ξ c (u), α + β + H, (3.26) ξ, z u 0, ξ c H (u), γ + β +. (3.27) From equaton (3.23)-(3.27), t s clear that ξ g, z u 0 ( I g ), ξ h, z u 0 ( J +), ξ h, z u 0 ( J ), ξ, z u 0, α + β H +, ξ H, z u 0, γ + β +. Snce α γ β β H = φ,wehave α β ξ, z u 0, g ξ g, z u 0, I g β γ H ξ H, z u 0, h ξ h, z u 0. Therefore, ( g ξ g h ξ h + I g α β ξ + β γ H ξ H ), z u 0, whch contradcts (3.22). Hence, f (z) f (u). Ths completes the proof. Analogously, we have the followng result for Asplund spaces. Theorem 3.10 (Weak dualty) Let z befeasbleformpec where X s an Asplund space, (u, ) be feasble for MWDMPEC( z), and the ndex sets I g, α, β, γ are defned accordngly.
14 uu et al. Journal of Inequaltes and Applcatons (2016) 2016:28 Page 14 of 15 Suppose that f s pseudoconvex at z, g ( I g ), h ( J + ), ( α β H ), H ( γ β ) are quasconvex at u and radally nonconstant. Also, assume that h ( J ), ( α + β H + β+ ), H ( γ + β + β+ ) are drectonally Lpschtzan, quasconvex at u, and radally nonconstant. If α γ β β H = φ, then, for any z feasble for the MPEC, we have f (z) f (u). Proof The proof follows the lnes of the proof of Theorem 3.9. Theorem 3.11 (Strong dualty) Assume z s a locally optmal soluton of MPEC where X s an Asplund space, such that NNAMCQ s satsfed at z, and the ndex sets I g, α, β, γ are defned accordngly. Let f, g ( I g ), h ( J + ), h ( J ), ( α β H ), ( α + β H + β+ ), H ( γ β ), H ( γ + β + β+ ) satsfy the assumpton of Theorem Then there exsts, such that ( z, ) s an optmal soluton of MWDMPEC( z), and the respectve objectve values are equal. Proof The proof follows the lnes of the proof of Theorem 3.8, nvokng Theorem Results and dscusson We have studed mathematcal programs wth equlbrum constrants (MPECs). The objectve functon and functons n the constrant part are assumed to be lower semcontnuous. We studed the Wolfe-type dual problem for the MPEC under the convexty assumpton. A Mond-Wer-type dual problem was also formulated and studed for the MPEC under convexty and generalzed convexty assumptons. Condtons for weak dualty theorems were gven to relate the MPEC and two dual programs n Banach space, respectvely. Also condtons for strong dualty theorems were establshed n an Asplund space. We also dscussed the cases when all the constrant functons are affne. Two numercal examples were gven to llustrate the Wolfe-type dualty and the Mond-Wer-type dualty wth our MPECs, respectvely. Competng nterests The authors declare that they have no competng nterests. Authors contrbutons YP conceved of the study and drafted the manuscrpt ntally. S-M partcpated n ts desgn, coordnaton and fnalzed the manuscrpt. SKM outlned the scope and desgn of the study. All authors read and approved the fnal manuscrpt. Author detals 1 College of Management, Chang ung Unversty and Research Dvson, Chang ung Memoral Hosptal, Taoyuan, Tawan. 2 Department of Mathematcs, Banaras Hndu Unversty, Varanas, , Inda. Acknowledgements The authors would lke to express ther deep apprecaton to the helpful comments of revewers. The research of S-M uu was partally supported by NSC E MY3 of the Natonal Scence Councl, Tawan and BMRPD017 of Chang ung Memoral Hosptal, Tawan. The research of Yogendra Pandey was supported by the Councl of Scentfc and Industral Research, New Delh, Mnstry of Human Resource Development, overnment of Inda. rant 09/013(0388)2011-EMR Receved: 14 July 2015 Accepted: 14 January 2016
15 uu et al. Journal of Inequaltes and Applcatons (2016) 2016:28 Page 15 of 15 References 1. Luo, ZQ, Pang, JS, Ralph, D: Mathematcal Programs wth Equlbrum Constrants. Cambrdge Unversty Press, Cambrdge (1996) 2. Flegel, ML, Kanzow, C: A Frtz John approach to frst order optmalty condtons for mathematcal programs wth equlbrum constrants. Optmzaton 52, (2003) 3. Flegel, ML, Kanzow, C: Abade-type constrant qualfcaton for mathematcal programs wth equlbrum constrants. J. Optm. Theory Appl. 124, (2005) 4. Ye, JJ: Necessary and suffcent optmalty condtons for mathematcal programs wth equlbrum constrants. J. Math. Anal. Appl. 307, (2005) 5. Outrata, JV, Kocvara, M, Zowe, J: Nonsmooth approach to optmzaton problems wth equlbrum constrants. In: Theory, Applcatons and Numercal Results. Kluwer Academc, Dordrecht (1998) 6. Flegel, ML, Kanzow, C, Outrata, JV: Optmalty condtons for dsjunctve programs wth applcaton to mathematcal programs wth equlbrum constrants. Set-Valued Anal. 15, (2006) 7. Movahedan, N, Nobakhtan, S: Constrant qualfcatons for nonsmooth mathematcal programs wth equlbrum constrants. Set-Valued Anal. 17,65-95 (2009) 8. Movahedan, N, Nobakhtan, S: Nondfferentable multpler rules for optmzaton problems wth equlbrum constrants. J. Convex Anal. 16(1), (2009) 9. Movahedan, N, Nobakhtan, S: Necessary and suffcent condtons for nonsmooth mathematcal programs wth equlbrum constrants. Nonlnear Anal. 72, (2010) 10. Ardal, AA, Movahedan, N, Nobakhtan, S: Optmalty condtons for nonsmooth equlbrum problems va Hadamard drectonal dervatve. Set-Valued Var. Anal. (2015). do: /s Cheu, NH, Lee, M: A relaxed constant postve lnear dependence constrant qualfcaton for mathematcal programs wth equlbrum constrants. J. Optm. Theory Appl. 158, (2013) 12. uo, L, Ln, H: Notes on some constrant qualfcatons for mathematcal programs wth equlbrum constrants. J. Optm. Theory Appl. 156, (2013) 13. uo, L, Ln, H, Ye, JJ: Second order optmalty condtons for mathematcal programs wth equlbrum constrants. J. Optm. Theory Appl. 158, (2013) 14. uo, L, Ln, H, Ye, JJ: Solvng mathematcal programs wth equlbrum constrants. J. Optm. Theory Appl. 166, (2015) 15. Ye, JJ, Zhang, J: Enhanced Karush-Kuhn-Tucker condtons for mathematcal programs wth equlbrum constrants. J. Optm. Theory Appl. 163, (2014) 16. Raghunathan, AU, Begler, LT: Mathematcal programs wth equlbrum constrants (MPECs) n process engneerng. Comput. Chem. Eng. 27, (2003) 17. Brtz, W, Ferrs, M, Kuhn, A: Modelng water allocatng nsttutons based on multple optmzaton problems wth equlbrum constrants. Envron. Model. Softw. 46, (2013) 18. Wolfe, P: A dualty theorem for non-lnear programmng. Q. Appl. Math. 19, (1961) 19. Toland, JF: A dualty prncple for non-convex optmsaton and the calculus of varatons. Arch. Raton. Mech. Anal. 71(1), (1979) 20. Toland, JF: Dualty n nonconvex optmzaton. J. Math. Anal. Appl. 66(2), (1978) 21. Rockafellar, RT: Dualty theorems for convex functons. Bull. Am. Math. Soc. 70, (1964) 22. Rockafellar, RT: Convex Analyss. Prnceton Unversty Press, Prnceton (1970) 23. Mangasaran, OL: Nonlnear Programmng. Mcraw-Hll, New York (1969); SIAM, Phladelpha (1994) 24. Mshra, SK, org, : Invexty and Optmzaton. Sprnger, New York (2008) 25. Rockafellar, RT: Drectonally Lpschtzan functons and subgradental calculus. Proc. Lond. Math. Soc. 39(2), (1979) 26. Avrel, M, Dewert, EW, Schable, S, Zang, I: eneralzed Concavty. Plenum, New York (1988) 27. Clarke, FH: Optmzaton and Nonsmooth Analyss. Wlley, New York (1983) 28. Aussel, D: Subdfferental propertes of quasconvex and pseudoconvex functons: unfed approach. J. Optm. Theory Appl. 97(1), (1998) 29. Mordukhovch, BS: Varatons Analyss and eneralzed Dfferentaton, I: Basc Theory. rundlehren Seres (Fundamental Prncples of Mathematcal Scences). Sprnger, Berln (2006)
Recurrence. 1 Definitions and main statements
Recurrence 1 Defntons and man statements Let X n, n = 0, 1, 2,... be a MC wth the state space S = (1, 2,...), transton probabltes p j = P {X n+1 = j X n = }, and the transton matrx P = (p j ),j S def.
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 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 informationFisher Markets and Convex Programs
Fsher Markets and Convex Programs Nkhl R. Devanur 1 Introducton Convex programmng dualty s usually stated n ts most general form, wth convex objectve functons and convex constrants. (The book by Boyd and
More informationThe descriptive complexity of the family of Banach spaces with the π-property
Arab. J. Math. (2015) 4:35 39 DOI 10.1007/s40065-014-0116-3 Araban Journal of Mathematcs Ghadeer Ghawadrah The descrptve complexty of the famly of Banach spaces wth the π-property Receved: 25 March 2014
More information8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by
6 CHAPTER 8 COMPLEX VECTOR SPACES 5. Fnd the kernel of the lnear transformaton gven n Exercse 5. In Exercses 55 and 56, fnd the mage of v, for the ndcated composton, where and are gven by the followng
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 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 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 informationBERNSTEIN POLYNOMIALS
On-Lne Geometrc Modelng Notes BERNSTEIN POLYNOMIALS Kenneth I. Joy Vsualzaton and Graphcs Research Group Department of Computer Scence Unversty of Calforna, Davs Overvew Polynomals are ncredbly useful
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 informationOn Lockett pairs and Lockett conjecture for π-soluble Fitting classes
On Lockett pars and Lockett conjecture for π-soluble Fttng classes Lujn Zhu Department of Mathematcs, Yangzhou Unversty, Yangzhou 225002, P.R. Chna E-mal: ljzhu@yzu.edu.cn Nanyng Yang School of Mathematcs
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 informationA Lyapunov Optimization Approach to Repeated Stochastic Games
PROC. ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, OCT. 2013 1 A Lyapunov Optmzaton Approach to Repeated Stochastc Games Mchael J. Neely Unversty of Southern Calforna http://www-bcf.usc.edu/
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 informationPERRON FROBENIUS THEOREM
PERRON FROBENIUS THEOREM R. CLARK ROBINSON Defnton. A n n matrx M wth real entres m, s called a stochastc matrx provded () all the entres m satsfy 0 m, () each of the columns sum to one, m = for all, ()
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 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 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 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 informationStability, observer design and control of networks using Lyapunov methods
Stablty, observer desgn and control of networks usng Lyapunov methods von Lars Naujok Dssertaton zur Erlangung des Grades enes Doktors der Naturwssenschaften - Dr. rer. nat. - Vorgelegt m Fachberech 3
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 informationResearch Article Some Existence Results for Impulsive Nonlinear Fractional Differential Equations with Closed Boundary Conditions
Hndaw Publshng Corporaton Abstract and Appled Analyss Volume 2012, Artcle ID 387629, 15 pages do:10.1155/2012/387629 Research Artcle Some Exstence Results for Impulsve Nonlnear Fractonal Dfferental Equatons
More informationRate Monotonic (RM) Disadvantages of cyclic. TDDB47 Real Time Systems. Lecture 2: RM & EDF. Priority-based scheduling. States of a process
Dsadvantages of cyclc TDDB47 Real Tme Systems Manual scheduler constructon Cannot deal wth any runtme changes What happens f we add a task to the set? Real-Tme Systems Laboratory Department of Computer
More informationJoint Scheduling of Processing and Shuffle Phases in MapReduce Systems
Jont Schedulng of Processng and Shuffle Phases n MapReduce Systems Fangfe Chen, Mural Kodalam, T. V. Lakshman Department of Computer Scence and Engneerng, The Penn State Unversty Bell Laboratores, Alcatel-Lucent
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 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 informationA Two Stage Stochastic Equilibrium Model for Electricity Markets with Two Way Contracts
A Two Stage Stochastc Equlbrum Model for Electrcty Markets wth Two Way Contracts Dal Zhang and Hufu Xu School of Mathematcs Unversty of Southampton Southampton SO17 1BJ, UK Yue Wu School of Management
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 informationn + d + q = 24 and.05n +.1d +.25q = 2 { n + d + q = 24 (3) n + 2d + 5q = 40 (2)
MATH 16T Exam 1 : Part I (In-Class) Solutons 1. (0 pts) A pggy bank contans 4 cons, all of whch are nckels (5 ), dmes (10 ) or quarters (5 ). The pggy bank also contans a con of each denomnaton. The total
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 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 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 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 informationCautiousness and Measuring An Investor s Tendency to Buy Options
Cautousness and Measurng An Investor s Tendency to Buy Optons James Huang October 18, 2005 Abstract As s well known, Arrow-Pratt measure of rsk averson explans a ratonal nvestor s behavor n stock markets
More informationFinancial Mathemetics
Fnancal Mathemetcs 15 Mathematcs Grade 12 Teacher Gude Fnancal Maths Seres Overvew In ths seres we am to show how Mathematcs can be used to support personal fnancal decsons. In ths seres we jon Tebogo,
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 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 informationProduct-Form Stationary Distributions for Deficiency Zero Chemical Reaction Networks
Bulletn of Mathematcal Bology (21 DOI 1.17/s11538-1-9517-4 ORIGINAL ARTICLE Product-Form Statonary Dstrbutons for Defcency Zero Chemcal Reacton Networks Davd F. Anderson, Gheorghe Cracun, Thomas G. Kurtz
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 informationGlobal stability of Cohen-Grossberg neural network with both time-varying and continuous distributed delays
Global stablty of Cohen-Grossberg neural network wth both tme-varyng and contnuous dstrbuted delays José J. Olvera Departamento de Matemátca e Aplcações and CMAT, Escola de Cêncas, Unversdade do Mnho,
More informationEnergy Efficient Routing in Ad Hoc Disaster Recovery Networks
Energy Effcent Routng n Ad Hoc Dsaster Recovery Networks Gl Zussman and Adran Segall Department of Electrcal Engneerng Technon Israel Insttute of Technology Hafa 32000, Israel {glz@tx, segall@ee}.technon.ac.l
More informationProduction. 2. Y is closed A set is closed if it contains its boundary. We need this for the solution existence in the profit maximization problem.
Producer Theory Producton ASSUMPTION 2.1 Propertes of the Producton Set The producton set Y satsfes the followng propertes 1. Y s non-empty If Y s empty, we have nothng to talk about 2. Y s closed A set
More informationThe literature on many-server approximations provides significant simplifications toward the optimal capacity
Publshed onlne ahead of prnt November 13, 2009 Copyrght: INFORMS holds copyrght to ths Artcles n Advance verson, whch s made avalable to nsttutonal subscrbers. The fle may not be posted on any other webste,
More informationWe are now ready to answer the question: What are the possible cardinalities for finite fields?
Chapter 3 Fnte felds We have seen, n the prevous chapters, some examples of fnte felds. For example, the resdue class rng Z/pZ (when p s a prme) forms a feld wth p elements whch may be dentfed wth the
More informationFINANCIAL MATHEMATICS. A Practical Guide for Actuaries. and other Business Professionals
FINANCIAL MATHEMATICS A Practcal Gude for Actuares and other Busness Professonals Second Edton CHRIS RUCKMAN, FSA, MAAA JOE FRANCIS, FSA, MAAA, CFA Study Notes Prepared by Kevn Shand, FSA, FCIA Assstant
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 informationPeriod and Deadline Selection for Schedulability in Real-Time Systems
Perod and Deadlne Selecton for Schedulablty n Real-Tme Systems Thdapat Chantem, Xaofeng Wang, M.D. Lemmon, and X. Sharon Hu Department of Computer Scence and Engneerng, Department of Electrcal Engneerng
More informationProject 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 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 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 informationOptimization of network mesh topologies and link capacities for congestion relief
Optmzaton of networ mesh topologes and ln capactes for congeston relef D. de Vllers * J.M. Hattngh School of Computer-, Statstcal- and Mathematcal Scences Potchefstroom Unversty for CHE * E-mal: rwddv@pu.ac.za
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 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 informationExtending Probabilistic Dynamic Epistemic Logic
Extendng Probablstc Dynamc Epstemc Logc Joshua Sack May 29, 2008 Probablty Space Defnton A probablty space s a tuple (S, A, µ), where 1 S s a set called the sample space. 2 A P(S) s a σ-algebra: a set
More informationA Probabilistic Theory of Coherence
A Probablstc Theory of Coherence BRANDEN FITELSON. The Coherence Measure C Let E be a set of n propostons E,..., E n. We seek a probablstc measure C(E) of the degree of coherence of E. Intutvely, we want
More informationSection C2: BJT Structure and Operational Modes
Secton 2: JT Structure and Operatonal Modes Recall that the semconductor dode s smply a pn juncton. Dependng on how the juncton s based, current may easly flow between the dode termnals (forward bas, v
More information+ + + - - This circuit than can be reduced to a planar circuit
MeshCurrent Method The meshcurrent s analog of the nodeoltage method. We sole for a new set of arables, mesh currents, that automatcally satsfy KCLs. As such, meshcurrent method reduces crcut soluton to
More informationLecture 3: Force of Interest, Real Interest Rate, Annuity
Lecture 3: Force of Interest, Real Interest Rate, Annuty Goals: Study contnuous compoundng and force of nterest Dscuss real nterest rate Learn annuty-mmedate, and ts present value Study annuty-due, and
More informationOn Robust Network Planning
On Robust Network Plannng Al Tzghadam School of Electrcal and Computer Engneerng Unversty of Toronto, Toronto, Canada Emal: al.tzghadam@utoronto.ca Alberto Leon-Garca School of Electrcal and Computer Engneerng
More informationMAC Layer Service Time Distribution of a Fixed Priority Real Time Scheduler over 802.11
Internatonal Journal of Software Engneerng and Its Applcatons Vol., No., Aprl, 008 MAC Layer Servce Tme Dstrbuton of a Fxed Prorty Real Tme Scheduler over 80. Inès El Korb Ecole Natonale des Scences de
More informationLuby s Alg. for Maximal Independent Sets using Pairwise Independence
Lecture Notes for Randomzed Algorthms Luby s Alg. for Maxmal Independent Sets usng Parwse Independence Last Updated by Erc Vgoda on February, 006 8. Maxmal Independent Sets For a graph G = (V, E), an ndependent
More informationLogistic Regression. Lecture 4: More classifiers and classes. Logistic regression. Adaboost. Optimization. Multiple class classification
Lecture 4: More classfers and classes C4B Machne Learnng Hlary 20 A. Zsserman Logstc regresson Loss functons revsted Adaboost Loss functons revsted Optmzaton Multple class classfcaton Logstc Regresson
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 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 informationSection 5.4 Annuities, Present Value, and Amortization
Secton 5.4 Annutes, Present Value, and Amortzaton Present Value In Secton 5.2, we saw that the present value of A dollars at nterest rate per perod for n perods s the amount that must be deposted today
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 informationarxiv:1311.2444v1 [cs.dc] 11 Nov 2013
FLEXIBLE PARALLEL ALGORITHMS FOR BIG DATA OPTIMIZATION Francsco Facchne 1, Smone Sagratella 1, Gesualdo Scutar 2 1 Dpt. of Computer, Control, and Management Eng., Unversty of Rome La Sapenza", Roma, Italy.
More informationEmbedding lattices in the Kleene degrees
F U N D A M E N T A MATHEMATICAE 62 (999) Embeddng lattces n the Kleene degrees by Hsato M u r a k (Nagoya) Abstract. Under ZFC+CH, we prove that some lattces whose cardnaltes do not exceed ℵ can be embedded
More informationNonparametric Data-Driven Algorithms for Multi-Product Inventory Systems with Censored Demand
Submtted to Operatons Research manuscrpt OPRE-2014-07-390.R3 Nonparametrc Data-Drven Algorthms for Mult-Product Inventory Systems wth Censored Demand Cong Sh, Wedong Chen Industral and Operatons Engneerng,
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 informationOptimal resource capacity management for stochastic networks
Submtted for publcaton. Optmal resource capacty management for stochastc networks A.B. Deker H. Mlton Stewart School of ISyE, Georga Insttute of Technology, Atlanta, GA 30332, ton.deker@sye.gatech.edu
More informationIDENTIFICATION AND CORRECTION OF A COMMON ERROR IN GENERAL ANNUITY CALCULATIONS
IDENTIFICATION AND CORRECTION OF A COMMON ERROR IN GENERAL ANNUITY CALCULATIONS Chrs Deeley* Last revsed: September 22, 200 * Chrs Deeley s a Senor Lecturer n the School of Accountng, Charles Sturt Unversty,
More informationThe Distribution of Eigenvalues of Covariance Matrices of Residuals in Analysis of Variance
JOURNAL OF RESEARCH of the Natonal Bureau of Standards - B. Mathem atca l Scence s Vol. 74B, No.3, July-September 1970 The Dstrbuton of Egenvalues of Covarance Matrces of Resduals n Analyss of Varance
More informationESTABLISHING TRADE-OFFS BETWEEN SUSTAINED AND MOMENTARY RELIABILITY INDICES IN ELECTRIC DISTRIBUTION PROTECTION DESIGN: A GOAL PROGRAMMING APPROACH
ESTABLISHIG TRADE-OFFS BETWEE SUSTAIED AD MOMETARY RELIABILITY IDICES I ELECTRIC DISTRIBUTIO PROTECTIO DESIG: A GOAL PROGRAMMIG APPROACH Gustavo D. Ferrera, Arturo S. Bretas, Maro O. Olvera Federal Unversty
More informationSection 2 Introduction to Statistical Mechanics
Secton 2 Introducton to Statstcal Mechancs 2.1 Introducng entropy 2.1.1 Boltzmann s formula A very mportant thermodynamc concept s that of entropy S. Entropy s a functon of state, lke the nternal energy.
More informationPOLYSA: A Polynomial Algorithm for Non-binary Constraint Satisfaction Problems with and
POLYSA: A Polynomal Algorthm for Non-bnary Constrant Satsfacton Problems wth and Mguel A. Saldo, Federco Barber Dpto. Sstemas Informátcos y Computacón Unversdad Poltécnca de Valenca, Camno de Vera s/n
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 informationActuator forces in CFD: RANS and LES modeling in OpenFOAM
Home Search Collectons Journals About Contact us My IOPscence Actuator forces n CFD: RANS and LES modelng n OpenFOAM Ths content has been downloaded from IOPscence. Please scroll down to see the full text.
More informationAbteilung für Stadt- und Regionalentwicklung Department of Urban and Regional Development
Abtelung für Stadt- und Regonalentwcklung Department of Urban and Regonal Development Gunther Maer, Alexander Kaufmann The Development of Computer Networks Frst Results from a Mcroeconomc Model SRE-Dscusson
More informationTo manage leave, meeting institutional requirements and treating individual staff members fairly and consistently.
Corporate Polces & Procedures Human Resources - Document CPP216 Leave Management Frst Produced: Current Verson: Past Revsons: Revew Cycle: Apples From: 09/09/09 26/10/12 09/09/09 3 years Immedately Authorsaton:
More informationDynamic Online-Advertising Auctions as Stochastic Scheduling
Dynamc Onlne-Advertsng Auctons as Stochastc Schedulng Isha Menache and Asuman Ozdaglar Massachusetts Insttute of Technology {sha,asuman}@mt.edu R. Srkant Unversty of Illnos at Urbana-Champagn rsrkant@llnos.edu
More informationBusiness Process Improvement using Multi-objective Optimisation K. Vergidis 1, A. Tiwari 1 and B. Majeed 2
Busness Process Improvement usng Mult-objectve Optmsaton K. Vergds 1, A. Twar 1 and B. Majeed 2 1 Manufacturng Department, School of Industral and Manufacturng Scence, Cranfeld Unversty, Cranfeld, MK43
More informationAllocating Collaborative Profit in Less-than-Truckload Carrier Alliance
J. Servce Scence & Management, 2010, 3: 143-149 do:10.4236/jssm.2010.31018 Publshed Onlne March 2010 (http://www.scrp.org/journal/jssm) 143 Allocatng Collaboratve Proft n Less-than-Truckload Carrer Allance
More informationOptimality in an Adverse Selection Insurance Economy. with Private Trading. November 2014
Optmalty n an Adverse Selecton Insurance Economy wth Prvate Tradng November 2014 Pamela Labade 1 Abstract Prvate tradng n an adverse selecton nsurance economy creates a pecunary externalty through the
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 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 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 information1. Fundamentals of probability theory 2. Emergence of communication traffic 3. Stochastic & Markovian Processes (SP & MP)
6.3 / -- Communcaton Networks II (Görg) SS20 -- www.comnets.un-bremen.de Communcaton Networks II Contents. Fundamentals of probablty theory 2. Emergence of communcaton traffc 3. Stochastc & Markovan Processes
More informationMooring Pattern Optimization using Genetic Algorithms
6th World Congresses of Structural and Multdscplnary Optmzaton Ro de Janero, 30 May - 03 June 005, Brazl Moorng Pattern Optmzaton usng Genetc Algorthms Alonso J. Juvnao Carbono, Ivan F. M. Menezes Luz
More informationOn the Interaction between Load Balancing and Speed Scaling
On the Interacton between Load Balancng and Speed Scalng Ljun Chen and Na L Abstract Speed scalng has been wdely adopted n computer and communcaton systems, n partcular, to reduce energy consumpton. An
More informationTesting and Debugging Resource Allocation for Fault Detection and Removal Process
Internatonal Journal of New Computer Archtectures and ther Applcatons (IJNCAA) 4(4): 93-00 The Socety of Dgtal Informaton and Wreless Communcatons, 04 (ISSN: 0-9085) Testng and Debuggng Resource Allocaton
More informationOPTIMAL INVESTMENT POLICIES FOR THE HORSE RACE MODEL. Thomas S. Ferguson and C. Zachary Gilstein UCLA and Bell Communications May 1985, revised 2004
OPTIMAL INVESTMENT POLICIES FOR THE HORSE RACE MODEL Thomas S. Ferguson and C. Zachary Glsten UCLA and Bell Communcatons May 985, revsed 2004 Abstract. Optmal nvestment polces for maxmzng the expected
More informationSimple Interest Loans (Section 5.1) :
Chapter 5 Fnance The frst part of ths revew wll explan the dfferent nterest and nvestment equatons you learned n secton 5.1 through 5.4 of your textbook and go through several examples. The second part
More informationLinear Circuits Analysis. Superposition, Thevenin /Norton Equivalent circuits
Lnear Crcuts Analyss. Superposton, Theenn /Norton Equalent crcuts So far we hae explored tmendependent (resste) elements that are also lnear. A tmendependent elements s one for whch we can plot an / cure.
More informationUsing Series to Analyze Financial Situations: Present Value
2.8 Usng Seres to Analyze Fnancal Stuatons: Present Value In the prevous secton, you learned how to calculate the amount, or future value, of an ordnary smple annuty. The amount s the sum of the accumulated
More informationNew Approaches to Support Vector Ordinal Regression
New Approaches to Support Vector Ordnal Regresson We Chu chuwe@gatsby.ucl.ac.uk Gatsby Computatonal Neuroscence Unt, Unversty College London, London, WCN 3AR, UK S. Sathya Keerth selvarak@yahoo-nc.com
More informationOn the Interaction between Load Balancing and Speed Scaling
On the Interacton between Load Balancng and Speed Scalng Ljun Chen, Na L and Steven H. Low Engneerng & Appled Scence Dvson, Calforna Insttute of Technology, USA Abstract Speed scalng has been wdely adopted
More informationEqulbra Exst and Trade S effcent proportionally
On Compettve Nonlnear Prcng Andrea Attar Thomas Marott Franços Salané February 27, 2013 Abstract A buyer of a dvsble good faces several dentcal sellers. The buyer s preferences are her prvate nformaton,
More information