RESOLUTION OF THE LINEAR FRACTIONAL GOAL PROGRAMMING PROBLEM


 Cody Garrett
 2 years ago
 Views:
Transcription
1 Revsa Elecrónca de Comuncacones y Trabajos de ASEPUMA. Volumen Págnas 7 a 40. RESOLUTION OF THE LINEAR FRACTIONAL GOAL PROGRAMMING PROBLEM RAFAEL CABALLERO Unversdad de Málaga / Deparameno de Economía Aplcada Maemácas Campus El ejdo s/n Málaga MÓNICA HERNÁNDEZ Unversdad de Málaga / Deparameno de Economía Aplcada Maemácas Campus El ejdo s/n Málaga Recbdo 8/0/00 Revsado 8/04/00 Acepado 0/05/00 RESUMEN: En ese rabajo se resuelve el problema de Programacón por Meas cuando dchas meas adopan una formulacón fracconal lneal. La gran dfculad de ese po de problemas radca en las resrccones no lneales que aparecen al resolver el correspondene problema de programacón asocado al problema de mea Cuando esen solucones alcanzando odas las meas, el problema es fácl de resolver a ravés de la resolucón de un problema lneal asocado. En ese rabajo nos cenramos en el caso en el que no odas las meas se consguen sasfacer. En dcho caso, enconramos la solucón que más se acerca a los nveles de aspracón esablecdos por el decsor desde odas las apromacones del problema de meas que se conemplan en la leraura: Ponderadas, Mnma y Lecográfca Cada seccón se ermna con un análss de sensbldad de dchos nveles de aspracón. Palabras claves: Programacón Maemáca No Lneal, Programacón Fracconal, Programacón Mulobjevo, Programacón por Mea ABSTRACT: Ths work deals wh he resoluon of he goal programmng problem wh lnear fraconal crera. The man dffculy of hese problems s he nonlnear consrans of he mahemacal programmng models ha have o be solved. When here es soluons sasfyng all arge values, he problem s easy o solve by solvng a lnear problem. So, n hs paper we deal wh hose nsances where here s no guaranee such soluons es, and herefore we look for hose pons n he opporuny se closes o he arge value Ths sudy has been done akng no accoun all he dfferen approaches avalable for solvng a goal programmng problem, creang soluonsearch algorhms based on hese approaches, and performng a sensvy analyss of he arge value Keywords: Non Lnear Programmng, Fraconal Programmng, Mulobjecve Programmng, Goal programmng. 7
2 8 Rafael Caballero, Mónca Hernández. Inroducon The man neres n fraconal programmng was generaed by he fac ha a lo of opmzaon problems from engneerng, naural resources and economcs requre he opmzaon of a rao beween physcal and/or economc funcon Such problems, where he objecve funcons appear as a rao or quoen of oher funcons, consue a fraconal programmng problem. When hese quoens have o verfy ceran arge values, we would have a se of fraconal goal In goal programmng GP problems s assumed ha he decsonmaker gves up opmzaon whle he/she esablshes arge values for each objecve. When he levels are verfed, he epecaons or desres of he decsonmaker are sasfed. In addon, he decsonmaker usually ses a seres of preferences regardng he objecves and orders hem accordng o her relave mporance. In GP problems, when he objecves are lnear fraconal funcons, he formulaon of he correspondng goal problem o be solved s raher comple due o s nonlnear consran The resoluon of hs ype of problems by drec lnearzaon s no feasble []. In [], Hannan presens a characerzaon of he condons for he lnear problem such ha s equvalen o he orgnal fraconal problem. However, Soyser and Lev [3] argued ha Hannan's resul was erroneous by usng a counereample. These auhors developed a es problem whch, once solved, could be used o fnd ou wheher we are dealng wh equvalen problems or no. See [4] for furher nformaon and references abou hs ssue. Afer hese sudes, and wh he ecepon of he work of Kornbluh and Seuer [5], here have been very few references of goal programmng wh fraconal goal Fnally, Aude e al [6] have used global opmzaon echnques o solve hs problem. In hs paper, we propose soluon algorhms for he goal programmng problem where he goals ake a lnear fraconal form under all goal programmng formulaon Praccal eamples of fraconal goal programmng problems occur n many decson problems where he crera are epressed as a rao of wo gven funcons such as prof/capal, cos/me, cos/volume, oupu/npu, ec. Thus, hs model has mporan applcaons n areas such as fnance, ransporaon, nformaon heory, foresry managemen, agrculural economcs, educaon, resource allocaon and ohers see [7] and [8]. Recenly, he fraconal problem have appeared n envronmenal and naural resources problems [9], [0], [], among ohers. Prevous work by Caballero and Hernández [] shows ha by usng a smple lnear es s possble o deermne beforehand he esence or absence of soluons ha sasfy all he goals of he problem under sudy. Here we assume ha no all goals can be sasfed and solve he lnear fraconal goal programmng problem drecly. Then we carry ou a sensvy analyss for he arge values se by he decsonmaker, ha have been oo consrcve. As sad, n GP problems he decsonmaker esablshes arge values for each objecve. In general, he purpose of GP s o reach hese arge values as closes as
3 Resoluon of he Lnear Fraconal Goal Programmng Problem 9 possble, mnmzng he devaon beween he arge value and he level acheved for he correspondng arbue. The decsonmaker s preferences regardng he achevemen of he arges may be ncorporaed n hs scheme followng dfferen way Thus, here are several GP varans such as weghed GP, mnma GP and lecographc GP, among oher Weghed GP mples a mahemacal cardnal specfcaon of weghs for each goal and seeks for a soluon ha mnmzes he weghed sum of all he unwaned devaon varable The mnma GP approach mnmzes he mamum devaon from he arge Fnally, Lecographc GP nvolves a preempve, ordnal weghng of goals ha allocaes hem no prory levels and mnmzes he unwaned devaon varables n a lecographc order. Formally, weghed GP and mnma GP can be vewed as a parcular case of lecographc GP wh a sngle prory level. Therefore, whou loss of generaly, we assume ha we are dealng wh he laer approach. A lecographc GP problem can have a sngle goal or more whn each prory level. Ths paper sudes and solves he model generaed n boh nsance When here s more han one goal a a sngle prory level, we wll ake no accoun whch approach.e. weghed or mnma has been used o aggregae he goals of he level. When approprae, a worked eample s ncluded n he secon n order o asss he undersandng of he algorhm. Thus, ne secon deals wh he case of a sngle goal for a ceran prory level. Followng secons descrbe nsances of more han one goal whn a gven prory level. In Secon 3, we assume ha goals were added usng he weghed approach, and n Secon 4 s assumed ha he mnma approach was he mehod chosen for addng goals n he level. Fnally, we summarze he mos sgnfcan conclusons of hs work followed by he reference. One goal per prory level We assume ha our problem has p lnear fraconal objecves and a consran se ha s a conve polyhedron. Whou loss of generaly, we assume ha he decsonmaker mposes a mnmum arge value for each objecve. Thus, he unwaned devaon varables are he negave ones, ha s, n for,, p. In he presen secon, we assume ha, usng he Lecographc GP approach, he prory levels are mposed n such a way ha n a gven level s here s only one goal, correspondng o he h objecve. In hs case, n level s, where he nde se of he goals n s wll be denoed by N s he problem o be solved s as follows: mn n A b j f j u j g f n p u g, n, p 0 j N,..., N s
4 30 Rafael Caballero, Mónca Hernández where A M mn R and b R m. Le X s { R n / A b, 0, f j g j u j j N,..., N }, whch s ncludes he consrans lnear ha mpose he sasfacon of goals n he prevous levels; and f j c j α j, g j d j β j where c j, d j R n, α j, β j R, j,..., p. In addon, we assume ha g j, j,..., p are srcly posve for every X. Le us call f g ϕ j,...,p. j j j I s clear ha problem s no easy o solve due o he nonlnear consran correspondng o he goal we are aempng o sasfy. Takng no accoun he followng assocaed problem, mn n ' X f g u n ', p ' 0 s n ' p ' 0 Awerbuch e al n [] showed ha he soluon of he lnear problem * s no necessarly he soluon of. However, n [] s shown ha f he soluon of n he opmum s zero, hen hs pon wll be also he pon soluon of. In he oher case, where he opmum of s n * > 0, he followng heorem deermnes he soluon pon of. Theorem.. Le ** be he soluon of he sngleobjecve lnear fraconal problem ma ϕ If when solvng he soluon s such ha n * > 0, hen **, n **, 0 s he soluon of where n ** u ϕ **. Proof. On he one hand, he consrans of are verfed by pon **, u ϕ **, 0 because: ** X s ϕ ** u ϕ ** 0 u. By hypohess, he goal s no verfed n any pon of X s. Therefore s no verfed n **, whch means ϕ ** < u. Tha s, n ** u ϕ ** > 0. Obvously p ** 0 0. On he oher hand, hs pon also mnmzes he value of n among hose ha verfy he consran By reduco ad absurdum, suppose *, n *, p * s a soluon of. Accordng o our hypohess and Theorem n Caballero and Hernández [], gven ha n * > 0, hen also n * > 0, ha s, u > ϕ *. Gven ha hs pon has o verfy he X s
5 Resoluon of he Lnear Fraconal Goal Programmng Problem 3 consrans of he problem, hen necessarly ϕ * n * p * u, where n * > 0 and p * 0, and herefore, p * 0. In oher words ϕ * n * u, whch means ha n * u ϕ *. However, assumng ha *, n *, 0 s a soluon of would mean ha n * < n **. Tha s, u ϕ * < u ϕ **. Ths would mean ha ϕ * > ϕ **, where ** s he mamum of he funcon ϕ n X s. Ths s a conradcon and hus pon **, n **, 0 s he soluon of. As sad n he nroducon, Soyser and Lev [3] desgned a es problem ha can be used o esablsh he equvalence beween problems and. If he opmal value of such a problem s zero, he equvalence beween soluons for and s guaraneed. Usng our noaon, hs es problem s as follows: Le *, n *, p * be he soluon of wh n * > 0. Then, f he opmal soluon of he problem ma f ϕ * g X s s zero, hen * also solves. So, Theorem s no more han a generalzaon of Soyser and Lev resul because all hs es problem does s o use he mehod of Dnkelbach [3] o verfy wheher * s or s no he soluon of ma ϕ Once he goal programmng problem has been solved, makes sense o perform a sensvy analyss of he arge values whch have been se. In hs sense, he soluon pon of problem self offers he sensvy analyss we are lookng for and provdes us wh an nerval whn whch we can be sure ha here are pons whch sasfy he  h goal. Indeed, f ** s he soluon of, wh n ** > 0, ** s he pon of X s ha mnmzes he unachevemen of he goal and hs mnmum unachevemen s precsely n **. Therefore, he sensvy nerval s, u n **]. Thus, gven a arge value for he goal whch s whn he sad nerval, we can guaranee he esence of a leas one pon ha wll sasfy such a goal sasfyng prevous levels. On he oher hand, f he arge value s ou of he nerval, we guaranee ha he goal s no gong o be sasfed. X s 3. More han one goal per prory level. Weghed GP approach. In hs secon we wll solve he followng problem:
6 3 Rafael Caballero, Mónca Hernández mn X f n p u g n, p k λ n s 0,..., k,..., k 3 Where parameer λ represens he wegh of each goal n he weghed GP k approach. So hese weghs mus verfy ha λ, λ 0,, k. In order o solve problem 3, we consder s assocaed lnear problem mn X λ n' f g u n' p' 0 n', p' 0 k s,..., k,..., k 4 Smlarly o he case of he prevous secon, f when solvng 4 we oban a k soluon such ha λ n ' * > 0, n such a case here s no soluon ha sasfes all goals k n such prory level and he value λ n' * does no necessarly provde us wh he mnmum unachevemen n X s of he goals n he curren prory level. Le us solve problem 3 drecly, ha s, we seek a feasble soluon X s whch mnmzes he weghed sum of devaons of he fraconal crera from her arge value Gven an X s, for every {,..., k}, when consran f g u n p 0 s verfed, we have: f c u d α u β > 0, hen n c u d α u β f c u d α u β 0, hen n 0 Gven ha n n / g, hen we can esablsh he followng epressons of he varables n n relaon o, for a gven whn and k: f c u d α u β > 0, n c u d α u β / d β 5 f c u d α u β 0, n 0 In hs way, o fnd he soluon pon of 3, we jus have o mnmze n X s he weghed sum of epressons 5. However, n order o do hs, we frs have o esablsh he goals ha can gve rse o wo dfferen epressons of n whn X s. These goals are he ones ha verfy { / ϕ u } X s and spl he se X s no wo subess: for one of hem, n 0; whle for he oher, n s gven by epresson 5. To locae hose goals we propose solvng for each wh k a GP problem wh a sngle goal,
7 Resoluon of he Lnear Fraconal Goal Programmng Problem 33 where he achevemen funcon s hn, p n p, and hen check wheher he value of funcon h n he opmal soluon s zero. Le us assume ha ou of he k goals n he curren level, he frs m goals fulfl such requremen, where m k. We consder a paron of X s ha ncludes all possble combnaons of he consrans ϕ u on he one hand, and of ϕ u on he oher for,..., m. The consrans ha have o be added o hose esng n X s o creae he subses of he paron are showed n Table : Table. Consrans o be added o X s Subse Consrans o be added o he consrans of X s Y ϕ u, ϕ u, ϕ 3 u 3,..., ϕ m u m Y ϕ u, ϕ u, ϕ 3 u 3,..., ϕ m u m Y m ϕ u, ϕ u, ϕ 3 u 3,..., ϕ m u m ϕ u, ϕ u, ϕ 3 u 3,..., ϕ m u m Y m Y m ϕ u, ϕ u, ϕ 3 u 3,..., ϕ m u m Ths paron of X s s made up of, a mos, m polyhedral subses, where some of hese subses mgh be he empy se. To fnd he soluon of 3, we propose o mnmze he weghed sum of he correspondng epressons of n for each of hese subse Therefore, he followng m problems have o be solved, for each r from o m : c ud α uβ mn λ d β I r Y r where I r {,..., k such ha ϕ u n Y r } and λ s he wegh correspondng o he h goal whch we assume has already been normalzed. Le us consder he opmal soluon r *, wh a value n he objecve funcon O r *, for r,..., m, and le mn O r * O r0 *.Then r0 * s he opmal soluon o he r,..., m orgnal goal programmng problem 3. Thus, for solvng 3, he followng algorhm s suggesed: Algorhm 3.. Sep. Le {,..., k / {ϕ u } X s } {,, m}. Sep. Make a paron of he se X s no m subses Y r as was descrbed earler. Le r.
8 34 Rafael Caballero, Mónca Hernández Sep 3. Gven r, f Y r, go o sep 4. If Y r, usng he algorhm n [4], solve he problem mn I r c λ Y r u d d α u β β where I r {,..., k such ha ϕ u n Y r }. Le r * be s soluon wh a value of he objecve funcon O r *. Sep 4. If r m, go o sep 5. If r m, le r r and go back o Sep 3. Sep 5. Le J {r,..., m / Y r }. Calculae mn O r * O*. r J If O * mn O r *, STOP: * s he soluon of 3. r J Before carryng ou he sensvy analyss, noe ha f here was only one goal a hs level, he prevous process would gve he same resuls as hose descrbed n Secon. Indeed, n he case of a sngle goal per level, gven ha he goal has no beng sasfed, he number m of possble goals o be sasfed s m 0. Ths means ha he paron for X s s made by a sngle subse whch s he acual X s. Gven ha n X s we have ϕ u, he epresson of n s n c u d α u β / d β, ha s, n f ug g ϕ u. Gven ha u s a consan, he pon n X s ha mnmzes hs epresson of n also mamzes he funcon ϕ n X s. Regardng he sensvy analyss, le us assume ha he soluon of problem 3, found wh he suggesed algorhm, s *, n *,..., n k *, p *,..., p k *. Thus, and usng smlar reasonng o ha used n he prevous secon, we reach he concluson ha, a leas, we have o lower he arge values o he correspondng value of ϕ * for each,..., k. Ths asseron s based on he fac ha pon *, obaned as a soluon o problem 3, s he pon ha mnmzes he weghed sum of he unachevemens of he goals esablshed n hs prory level. Le us conclude hs secon wh a worked eample ha res o asss n he undersandng of he soluon algorhm. Eample 3. Assume a problem whose opporuny se s X {, R / 4, 4, 5 } and suppose ha n he frs prory level we have he followng goals, all wh he same wegh:
9 Resoluon of he Lnear Fraconal Goal Programmng Problem ; 5 8 ; 5 5 ; 4 3 ϕ ϕ ϕ ϕ So ha he problem ha has o be solved s he followng:,...,4 0, mn p n p n p n p n p n s n 6 Afer solvng he lnear problem assocaed wh 6, he soluon n he opmum s greaer han zero, so we conclude ha here are no pons ha sasfy all he goal Fgure. Fgure of Eample 3. problem So we have o apply he algorhm proposed n order o solve 6 drecly. The frs sep s o denfy whch of he four goals could be sasfed n hs level. Fgure
10 36 Rafael Caballero, Mónca Hernández clearly shows ha only goals ϕ 3  and ϕ 4 sasfy hs requremen, and herefore, m. Thus, we have o paron he se X no 4 subses, such as shown n Fgure : Y { X / ϕ 3 , ϕ 4 }, Y { X / ϕ 3 , ϕ 4 } Y 3 { X / ϕ 3 , ϕ 4 }, Y 4 { X / ϕ 3 , ϕ 4 }. The followng s o solve hree opmsaon problems, one for each nonempy subse of X. Because he wo frs goals canno be sasfed n eher of hese four subses, n all of hem we have o consder ha ϕ and ϕ. Therefore, he frs problem o solve s he followng: mn 5 Y Afer applyng he algorhm n [4], we fnd ha s soluon s * 3, 4 where he value of he objecve funcon s O *.5. The second problem o solve s 7 mn 5 7 Y 3 whose soluon s 3 *, 4 wh a value for he objecve funcon of O 3 * The hrd problem o solve s 7 3 mn Y4 whose soluon s 4 *, 3 wh a value for he objecve funcon of O 4 *. Therefore, akng O* mn {O *, O 3 *, O 4 *} O 3 *.9667, he pon ha solves 6 s pon 3 *, 4, snce he weghed sum of devaons of he fraconal crera from her arge values o he se X are mnmzed n hs pon. The values of he goals n hs soluon pon are ϕ * 0.75, ϕ * 0, ϕ 3 * , ϕ 4 * /3 and herefore, he sensvy analyss esablshes ha he arge values of he frs wo goals have o be dropped a leas o values u 0.75 and u 0 and n he fourh goal o value u 4 /3 n order o oban pons sasfyng he goals n hs level. We even can ncrease he arge value for he hrd goal up o value u We wan o pon ou ha hose are he values ha mnmzed he sum of he unachevemen In hs case, hs mnmum sum of unachevemen s O* Alhough here are oher ways of lowerng he arge values ha lead o soluons sasfyng he goals, hese oher ways mply a sum of devaons from he orgnal arge values greaer han O*.
11 Resoluon of he Lnear Fraconal Goal Programmng Problem More han one goal per prory level. Mnma GP approach. In hs secon we suppose ha he k goals n he curren level s are added under he mnma approach. In hs case he problem o solve s as follows: mn d X f n p u g λ n d n, p s 0,..., k,..., k,..., k As n prevous cases, we assocae a lnear problem wh he orgnal problem whch, once solved, wll ell us wheher here are any soluons ha sasfy all he goals n ha level or no. The lnear problem s epressed as follows: mn d' X f g u n' p' 0 λ n' d' n', p' 0 s,..., k,..., k,..., k However, o solve 7 drecly we should bear n mnd ha hs problem s equvalen o mn ma λ u ϕ 9 X s,..., k Gven ha for,, k ϕ are lnear fraconal funcons and he u values are prevously gven, he funcons of hs mnma problem are also lnear fraconal funcons and herefore we are dealng wh Generalzed Fraconal Programmng. Ths problem has been wdely suded n he leraure and dfferen algorhms are proposed o solve. See, for eample, he Newmodm algorhm [5]. Ne, we wll carry ou he sensvy analys Once 7 has been solved, where * s s soluon, f * s he unque soluon, hen he arge values of he goals whch have no been sasfed have o decrease o he value he goals ake a hs specfc pon. However, f * s no he unque soluon of 7, we have o connue wh he analyss because here mgh be some objecve funcons for whch mgh be possble o esablsh arge values hgher han hose reached n * and sll have pons sasfyng all he goal For hs case we propose an erave algorhm ha would lead us o he pon where he unachevemen of he goals a hs level s mnmzed and so, provde us wh he sensvy analyss sough. In each eraon of hs algorhm we ake, from he goals no sasfed, hose where he devaon varable d has reached s hghes value d*. For hese goals, we assume ha are he frs m goals we consder he followng consrans: ϕ u d* ϕ *,,m 7 8
12 38 Rafael Caballero, Mónca Hernández We add hese o problem 7 as hard consrans, and elmnae he sof consrans correspondng o hose goal We connue wh he process n hs way unl we eher reach a unque soluon for some of hese problems or have fnshed mprovng all possble mamum values for he arge values of he goals ha have no been sasfed. The algorhm suggesed s as follows: Algorhm 4. Sep. Le k ; X X s and I {,..., k}. Sep. Solve he lnear fraconal mnma problem usng he Newmodm algorhm mn ma λ u ϕ X k I k Le k * be he soluon pon and θ k * he value of he objecve n k *. Sep 3. Esablsh he followng nde se J k, whn I k : J k { I k / θ k * u ϕ k *}. Le I k I k \ J k. Sep 4. If I k, STOP: k * * s he pon ha mnmzes he unachevemen of he goal If I k, hen le X k X k { / ϕ u θ k * / J k }. Le k k, and reurn o sep. Ths s a fully convergen algorhm because n each eraon he se I k becomes smaller because, gven he acual consrucon of he value θ k *, he nde se J k can never be an empy se. So, f * s he pon obaned afer applyng he algorhm, for,, k, le be u ϕ * f u > ϕ *, and u u f u ϕ *. Wh hese new arge values, we make sure ha he mnma GP problem correspondng o he curren prory level s has a soluon ha sasfes all he goals, gven ha a leas pon * s one of hem. However, wh arge values hgher han u for hose goals where u > ϕ * we guaranee he nonesence of pons sasfyng all he goals of he problem. Ths s ensured because * s he pon ha mnmzes he mamum unachevemen of he goals esablshed. Neverheless, for arge values such ha u ϕ *, we can asser ha hese arge values could sll be ncreased up o he value of ϕ * and sll be pons ha sasfy all he goal
13 Resoluon of he Lnear Fraconal Goal Programmng Problem Conclusons In hs work we have eamned he goal programmng GP problem from all possble perspecves when he objecves assocaed wh he goals are lnear fraconal funcon We have carred ou a comprehensve sudy and have derved algorhms capable of fndng he pons ha solve he problem n a gven prory level. We have eplored all he possble cases, one goal per prory level and several goals per prory level. In hs laer case, he problem was also separaely analysed for goals grouped accordng o he weghed GP approach or he mnma GP approach. In all he cases he nonlnear problem derved has been solved. Once he lnear fraconal goal programmng problem was solved for each case, we also carred ou a sensvy analyss of he arge values se by he decsonmaker. Thus, each secon of he work ncludes relaaon values for he arges whch guaranee he esence of soluons ha sasfy all he goals n he curren prory level. References. S. Awerbuch and J.G. Ecker, W.A. Wallace, A noe: Hdden nonlneares n he applcaon of goal programmng, Manage Sc E.L. Hannan, An nerpreaon of fraconal objecves n goal programmng as relaed o papers by Awerbuch e al. and Hannan, Manage Sc. 7, A.L. Soyser and B. Lev, An nerpreaon of fraconal objecves n goal programmng as relaed o papers by Awerbuch e al. and Hannan, Manage Sc C. Romero, Handbook of Crcal Issues n Goal Programmng, Pergamon Press, Oford, J.S.H. Kornbluh and R.E. Seuer, Goal programmng wh lnear fraconal crera, Eur J Oper Res, C. Aude, E. Carrzosa and P. Hansen, An eac mehod for fraconal goal programmng, J Global Opm, S. Schable, Fraconal programmng, n Handbook of Global Opmzaon, ed R. Hors and P. Pardalos Kluwer Academc Publshers, Dordrech, Neherlands, I. M. SancuMnasan, A sh bblography of fraconal programmng. Opmzaon. 55, C. Casrodeza, P. Lara and T. Peña, Mulcrera fraconal model for feed formulaon: economc, nuronal and envronmenal crera, Agr Sys, 86, T. Gómez, M. Hernández, M. A. León and R. Caballero, A fores plannng problem solved va a lnear fraconal goal programmng model, For Ecol Manage, T. Gómez, M. Hernández, J. Molna, M. A. León and R. Caballero, Aspecos medoambenales denro de la planfcacón foresal con objevos múlples: Capura de
14 40 Rafael Caballero, Mónca Hernández carbono y resrccones de adyacenca, Revsa Elecrónca de Comuncacones y Trabajos de ASEPUMA, R. Caballero and M. Hernández, Resoraon of effcency n a goal programmng problem wh lnear fraconal crera, Eur J Oper Res, W. Dnkelbach, On nonlnear fraconal programmng, Manage Sc, 3, J.E. Falk and S.W. Palocsay, Opmzng he sum of lnear fraconal funcons, n Recen advances n global opmzaon, ed Ch. A. Floudas and P.M. Pardalos Prnceon Unversy Press, Prnceon, New Jersey, J.A.Ferland and J.Y. Povn, Generalzed fraconal programmng: Algorhms and numercal epermenaon, Eur J Oper Res, 0,
MORE ON TVM, "SIX FUNCTIONS OF A DOLLAR", FINANCIAL MECHANICS. Copyright 2004, S. Malpezzi
MORE ON VM, "SIX FUNCIONS OF A DOLLAR", FINANCIAL MECHANICS Copyrgh 2004, S. Malpezz I wan everyone o be very clear on boh he "rees" (our basc fnancal funcons) and he "fores" (he dea of he cash flow model).
More informationSpline. Computer Graphics. Bsplines. BSplines (for basis splines) Generating a curve. Basis Functions. Lecture 14 Curves and Surfaces II
Lecure 4 Curves and Surfaces II Splne A long flexble srps of meal used by drafspersons o lay ou he surfaces of arplanes, cars and shps Ducks weghs aached o he splnes were used o pull he splne n dfferen
More informationCapacity Planning. Operations Planning
Operaons Plannng Capacy Plannng Sales and Operaons Plannng Forecasng Capacy plannng Invenory opmzaon How much capacy assgned o each producon un? Realsc capacy esmaes Sraegc level Moderaely long me horzon
More informationHEURISTIC ALGORITHM FOR SINGLE RESOURCE CONSTRAINED PROJECT SCHEDULING PROBLEM BASED ON THE DYNAMIC PROGRAMMING
Yugoslav Journal o Operaons Research Volume 19 (2009) Number 2, 281298 DOI:10.2298/YUJOR0902281S HEURISTIC ALGORITHM FOR SINGLE RESOURCE CONSTRAINED PROJECT SCHEDULING PROBLEM BASED ON THE DYNAMIC PROGRAMMING
More informationLarge Scale PDE Optimization with FAIPA,
Large Scale PDE Opmzaon wh FAIPA, he Feasble Arc Ineror Pon Algorhm José Hersovs * José Mguel Arozegu * Alfredo Canelas ** * OpmzE  Engneerng Opmzaon Lab Mechancal Eng. Program, COPPE Federal Unversy
More informationMathematical Model of Data Backup and Recovery
6 IJCSNS Inernaonal Journal of Compuer Scence and Nework Secury, VOL.4 No.7, July 04 Mahemacal Model of Daa Backup and Recovery Karel Burda The Faculy of Elecrcal Engneerng and Communcaon Brno Unversy
More informationMULTIWORKDAY ERGONOMIC WORKFORCE SCHEDULING WITH DAYS OFF
Proceedngs of he 4h Inernaonal Conference on Engneerng, Projec, and Producon Managemen (EPPM 203) MULTIWORKDAY ERGONOMIC WORKFORCE SCHEDULING WITH DAYS OFF Tar Raanamanee and Suebsak Nanhavanj School
More informationHEAT CONDUCTION PROBLEM IN A TWOLAYERED HOLLOW CYLINDER BY USING THE GREEN S FUNCTION METHOD
Journal of Appled Mahemacs and Compuaonal Mechancs 3, (), 455 HEAT CONDUCTION PROBLEM IN A TWOLAYERED HOLLOW CYLINDER BY USING THE GREEN S FUNCTION METHOD Sansław Kukla, Urszula Sedlecka Insue of Mahemacs,
More informationY2K* Stephanie SchmittGrohé. Rutgers Uni ersity, 75 Hamilton Street, New Brunswick, New Jersey 08901 Email: grohe@econ.rutgers.edu.
Revew of Economc Dynamcs 2, 850856 Ž 1999. Arcle ID redy.1999.0065, avalable onlne a hp:www.dealbrary.com on Y2K* Sephane SchmGrohé Rugers Unersy, 75 Hamlon Sree, New Brunswc, New Jersey 08901 Emal:
More informationGUIDANCE STATEMENT ON CALCULATION METHODOLOGY
GUIDANCE STATEMENT ON CALCULATION METHODOLOGY Adopon Dae: 9/28/0 Effecve Dae: //20 Reroacve Applcaon: No Requred www.gpssandards.org 204 CFA Insue Gudance Saemen on Calculaon Mehodology GIPS GUIDANCE STATEMENT
More informationMarketClearing Electricity Prices and Energy Uplift
MarkeClearng Elecrcy Prces and Energy Uplf Paul R. Grbk, Wllam W. Hogan, and Susan L. Pope December 31, 2007 Elecrcy marke models requre energy prces for balancng, spo and shorerm forward ransacons.
More informationInsurance. By Mark Dorfman, Alexander Kling, and Jochen Russ. Abstract
he Impac Of Deflaon On Insurance Companes Offerng Parcpang fe Insurance y Mar Dorfman, lexander Klng, and Jochen Russ bsrac We presen a smple model n whch he mpac of a deflaonary economy on lfe nsurers
More informationLinear Extension Cube Attack on Stream Ciphers Abstract: Keywords: 1. Introduction
Lnear Exenson Cube Aack on Sream Cphers Lren Dng Yongjuan Wang Zhufeng L (Language Engneerng Deparmen, Luo yang Unversy for Foregn Language, Luo yang cy, He nan Provnce, 47003, P. R. Chna) Absrac: Basng
More informationfinish line dr 1 L 1 v b v r finish line.
Answer, Key { Homewor { Rubn H Landau 1 Ths prnou should have 1 quesons. Chec ha s complee before leavng he prner. Also, mulplechoce quesons may connue on he nex column or page: nd all choces before
More informationOptimization of Nurse Scheduling Problem with a TwoStage Mathematical Programming Model
Asa Pacfc Managemen Revew 15(4) (2010) 503516 Opmzaon of Nurse Schedulng Problem wh a TwoSage Mahemacal Programmng Model ChangChun Tsa a,*, ChengJung Lee b a Deparmen of Busness Admnsraon, Trans World
More informationA robust optimisation approach to project scheduling and resource allocation. Elodie Adida* and Pradnya Joshi
In. J. Servces Operaons and Informacs, Vol. 4, No. 2, 2009 169 A robus opmsaon approach o projec schedulng and resource allocaon Elode Adda* and Pradnya Josh Deparmen of Mechancal and Indusral Engneerng,
More informationLecture 40 Induction. Review Inductors Selfinduction RL circuits Energy stored in a Magnetic Field
ecure 4 nducon evew nducors Selfnducon crcus nergy sored n a Magnec Feld 1 evew nducon end nergy Transfers mf Bv Mechancal energy ransform n elecrc and hen n hermal energy P Fv B v evew eformulaon of
More informationThe Rules of the Settlement Guarantee Fund. 1. These Rules, hereinafter referred to as "the Rules", define the procedures for the formation
Vald as of May 31, 2010 The Rules of he Selemen Guaranee Fund 1 1. These Rules, herenafer referred o as "he Rules", defne he procedures for he formaon and use of he Selemen Guaranee Fund, as defned n Arcle
More informationBoosting for Learning Multiple Classes with Imbalanced Class Distribution
Boosng for Learnng Mulple Classes wh Imbalanced Class Dsrbuon Yanmn Sun Deparmen of Elecrcal and Compuer Engneerng Unversy of Waerloo Waerloo, Onaro, Canada y8sun@engmal.uwaerloo.ca Mohamed S. Kamel Deparmen
More informationCLoud computing has recently emerged as a new
1 A Framework of Prce Bddng Confguraons for Resource Usage n Cloud Compung Kenl L, Member, IEEE, Chubo Lu, Keqn L, Fellow, IEEE, and Alber Y. Zomaya, Fellow, IEEE Absrac In hs paper, we focus on prce bddng
More informationRevision: June 12, 2010 215 E Main Suite D Pullman, WA 99163 (509) 334 6306 Voice and Fax
.3: Inucors Reson: June, 5 E Man Sue D Pullman, WA 9963 59 334 636 Voce an Fax Oerew We connue our suy of energy sorage elemens wh a scusson of nucors. Inucors, lke ressors an capacors, are passe woermnal
More informationThe Multishift Vehicle Routing Problem with Overtime
The Mulshf Vehcle Roung Problem wh Overme Yngao Ren, Maged Dessouy, and Fernando Ordóñez Danel J. Epsen Deparmen of Indusral and Sysems Engneerng Unversy of Souhern Calforna 3715 McClnoc Ave, Los Angeles,
More informationMethodology of the CBOE S&P 500 PutWrite Index (PUT SM ) (with supplemental information regarding the CBOE S&P 500 PutWrite TW Index (PWT SM ))
ehodology of he CBOE S&P 500 PuWre Index (PUT S ) (wh supplemenal nformaon regardng he CBOE S&P 500 PuWre TW Index (PWT S )) The CBOE S&P 500 PuWre Index (cker symbol PUT ) racks he value of a passve
More informationHow Much Life Insurance is Enough?
How Much Lfe Insurance s Enough? UlyBased pproach By LJ Rossouw BSTRCT The paper ams o nvesgae how much lfe nsurance proecon cover a uly maxmsng ndvdual should buy. Ths queson s relevan n he nsurance
More informationAPPLICATION OF CHAOS THEORY TO ANALYSIS OF COMPUTER NETWORK TRAFFIC Liudvikas Kaklauskas, Leonidas Sakalauskas
The XIII Inernaonal Conference Appled Sochasc Models and Daa Analyss (ASMDA2009) June 30July 3 2009 Vlnus LITHUANIA ISBN 9789955284635 L. Sakalauskas C. Skadas and E. K. Zavadskas (Eds.): ASMDA2009
More informationAn Antispam Filter Combination Framework for TextandImage Emails through Incremental Learning
An Anspam Fler Combnaon Framework for TexandImage Emals hrough Incremenal Learnng 1 Byungk Byun, 1 ChnHu Lee, 2 Seve Webb, 2 Danesh Iran, and 2 Calon Pu 1 School of Elecrcal & Compuer Engr. Georga
More informationEstimating intrinsic currency values
Cung edge Foregn exchange Esmang nrnsc currency values Forex marke praconers consanly alk abou he srenghenng or weakenng of ndvdual currences. In hs arcle, Jan Chen and Paul Dous presen a new mehodology
More informationIndex Mathematics Methodology
Index Mahemacs Mehodology S&P Dow Jones Indces: Index Mehodology Ocober 2015 Table of Conens Inroducon 4 Dfferen Varees of Indces 4 The Index Dvsor 5 Capalzaon Weghed Indces 6 Defnon 6 Adjusmens o Share
More informationCONTROLLER PERFORMANCE MONITORING AND DIAGNOSIS. INDUSTRIAL PERSPECTIVE
Copyrgh IFAC 5h Trennal World Congress, Barcelona, Span CONTROLLER PERFORMANCE MONITORING AND DIAGNOSIS. INDUSTRIAL PERSPECTIVE Derrck J. Kozub Shell Global Soluons USA Inc. Weshollow Technology Cener,
More informationOptimal Taxation. 1 WarmUp: The Neoclassical Growth Model with Endogenous Labour Supply. β t u (c t, L t ) max. t=0
Opmal Taxaon Reference: L&S 3rd edon chaper 16 1 WarmUp: The Neoclasscal Growh Model wh Endogenous Labour Supply You looked a lle b a hs for Problem Se 3. Sudy planner s problem: max {c,l,,k +1 } =0 β
More informationTHE IMPACT OF UNSECURED DEBT ON FINANCIAL DISTRESS AMONG BRITISH HOUSEHOLDS. Ana del Río and Garry Young. Documentos de Trabajo N.
THE IMPACT OF UNSECURED DEBT ON FINANCIAL DISTRESS AMONG BRITISH HOUSEHOLDS 2005 Ana del Río and Garry Young Documenos de Trabajo N.º 0512 THE IMPACT OF UNSECURED DEBT ON FINANCIAL DISTRESS AMONG BRITISH
More informationA Heuristic Solution Method to a Stochastic Vehicle Routing Problem
A Heursc Soluon Mehod o a Sochasc Vehcle Roung Problem Lars M. Hvaum Unversy of Bergen, Bergen, Norway. larsmh@.ub.no Arne Løkkeangen Molde Unversy College, 6411 Molde, Norway. Arne.Lokkeangen@hmolde.no
More informationKalman filtering as a performance monitoring technique for a propensity scorecard
Kalman flerng as a performance monorng echnque for a propensy scorecard Kaarzyna Bjak * Unversy of Souhampon, Souhampon, UK, and Buro Informacj Kredyowej S.A., Warsaw, Poland Absrac Propensy scorecards
More informationWe analyze the problem faced by companies that rely on TL (Truckload) and LTL (Less
Effecve ZeroInvenoryOrderng Polces for he SngleWarehouse Mulrealer Problem wh Pecewse Lnear Cos Srucures LapMu Ann Chan Ana Murel ZuoJun Max Shen Davd SmchLev ChungPaw Teo School of Managemen, Unversy
More informationTime Series. A thesis. Submitted to the. Edith Cowan University. Perth, Western Australia. David Sheung Chi Fung. In Fulfillment of the Requirements
Mehods for he Esmaon of Mssng Values n Tme Seres A hess Submed o he Faculy of Communcaons, ealh and Scence Edh Cowan Unversy Perh, Wesern Ausrala By Davd Sheung Ch Fung In Fulfllmen of he Requremens For
More information12/7/2011. Procedures to be Covered. Time Series Analysis Using Statgraphics Centurion. Time Series Analysis. Example #1 U.S.
Tme Seres Analyss Usng Sagraphcs Cenuron Nel W. Polhemus, CTO, SaPon Technologes, Inc. Procedures o be Covered Descrpve Mehods (me sequence plos, auocorrelaon funcons, perodograms) Smoohng Seasonal Decomposon
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 informationINTERNATIONAL JOURNAL OF STRATEGIC MANAGEMENT
IJSM, Volume, Number, 0 ISSN: 5554 INTERNATIONAL JOURNAL OF STRATEGIC MANAGEMENT SPONSORED BY: Angelo Sae Unversy San Angelo, Texas, USA www.angelo.edu Managng Edors: Professor Alan S. Khade, Ph.D. Calforna
More informationREVISTA INVESTIGACION OPERACIONAL Vol. 25, No. 1, 2004. k n ),
REVISTA INVESTIGACION OPERACIONAL Vol 25, No, 24 RECURRENCE AND DIRECT FORMULAS FOR TE AL & LA NUMBERS Eduardo Pza Volo Cero de Ivesgacó e Maemáca Pura y Aplcada (CIMPA), Uversdad de Cosa Rca ABSTRACT
More informationCooperative Distributed Scheduling for Storage Devices in Microgrids using Dynamic KKT Multipliers and Consensus Networks
Cooperave Dsrbued Schedulng for Sorage Devces n Mcrogrds usng Dynamc KK Mulplers and Consensus Newors Navd RahbarAsr Yuan Zhang MoYuen Chow Deparmen of Elecrcal and Compuer Engneerng Norh Carolna Sae
More informationThe impact of unsecured debt on financial distress among British households
The mpac of unsecured deb on fnancal dsress among Brsh households Ana DelRío* and Garr Young** Workng Paper no. 262 * Banco de España. Alcalá, 50. 28014 Madrd, Span Emal: adelro@bde.es ** Fnancal Sabl,
More informationLevyGrantSchemes in Vocational Education
LevyGranSchemes n Vocaonal Educaon Sefan Bornemann Munch Graduae School of Economcs Inernaonal Educaonal Economcs Conference Taru, Augus 26h, 2005 Sefan Bornemann / MGSE Srucure Movaon and Objecve Leraure
More informationA STUDY ON THE CAUSAL RELATIONSHIP BETWEEN RELATIVE EQUITY PERFORMANCE AND THE EXCHANGE RATE
A STUDY ON THE CAUSAL RELATIONSHIP BETWEEN RELATIVE EQUITY PERFORMANCE AND THE EXCHANGE RATE The Swedsh Case Phlp Barsk* and Magnus Cederlöf Maser s Thess n Inernaonal Economcs Sockholm School of Economcs
More informationFinance and Economics Discussion Series Divisions of Research & Statistics and Monetary Affairs Federal Reserve Board, Washington, D.C.
Fnance and Economcs Dscusson Seres Dvsons of Research & Sascs and Moneary Affars Federal Reserve Board, Washngon, D.C. Prcng Counerpary Rs a he Trade Level and CVA Allocaons Mchael Pyhn and Dan Rosen 2000
More informationThe Virtual Machine Resource Allocation based on Service Features in Cloud Computing Environment
Send Orders for Reprns o reprns@benhamscence.ae The Open Cybernecs & Sysemcs Journal, 2015, 9, 639647 639 Open Access The Vrual Machne Resource Allocaon based on Servce Feaures n Cloud Compung Envronmen
More informationTHE USE IN BANKS OF VALUE AT RISK METHOD IN MARKET RISK MANAGEMENT. Ioan TRENCA *
ANALELE ŞTIINłIFICE ALE UNIVERSITĂłII ALEXANDRU IOAN CUZA DIN IAŞI Tomul LVI ŞnŃe Economce 009 THE USE IN BANKS OF VALUE AT RISK METHOD IN MARKET RISK MANAGEMENT Ioan TRENCA * Absrac In sophscaed marke
More informationLinear methods for regression and classification with functional data
Lnear mehods for regresson and classfcaon wh funconal daa Glber Sapora Chare de Sasue Appluée & CEDRIC Conservaore Naonal des Ars e Méers 9 rue San Marn, case 44 754 Pars cedex 3, France sapora@cnam.fr
More informationAn Architecture to Support Distributed Data Mining Services in ECommerce Environments
An Archecure o Suppor Dsrbued Daa Mnng Servces n ECommerce Envronmens S. Krshnaswamy 1, A. Zaslavsky 1, S.W. Loke 2 School of Compuer Scence & Sofware Engneerng, Monash Unversy 1 900 Dandenong Road, Caulfeld
More informationGenetic Algorithm with Range Selection Mechanism for Dynamic Multiservice Load Balancing in CloudBased Multimedia System
ISSN : 23478446 (Onlne) Inernaonal Journal of Advanced Research n Genec Algorhm wh Range Selecon Mechansm for Dynamc Mulservce Load Balancng n CloudBased Mulmeda Sysem I Mchael Sadgun Rao Kona, II K.Purushoama
More informationEvent Based Project Scheduling Using Optimized Ant Colony Algorithm Vidya Sagar Ponnam #1, Dr.N.Geethanjali #2
Inernaonal Journal of Compuer Trends and Technology (IJCTT) Volume 18 Number 6 Dec 2014 Even Based Projec Schedulng Usng Opmzed An Colony Algorhm Vdya Sagar Ponnam #1, Dr.N.Geehanjal #2 1 Research Scholar,
More informationA Background Layer Model for Object Tracking through Occlusion
A Background Layer Model for Obec Trackng hrough Occluson Yue Zhou and Ha Tao Deparmen of Compuer Engneerng Unversy of Calforna, Sana Cruz, CA 95064 {zhou,ao}@soe.ucsc.edu Absrac Moon layer esmaon has
More informationPedro M. Castro Iiro Harjunkoski Ignacio E. Grossmann. Lisbon, Portugal Ladenburg, Germany Pittsburgh, USA
Pedro M. Casro Iro Harjunkosk Ignaco E. Grossmann Lsbon Porugal Ladenburg Germany Psburgh USA 1 Process operaons are ofen subjec o energy consrans Heang and coolng ules elecrcal power Avalably Prce Challengng
More informationUnit 5 Electrical Damped Oscillation
Un 5 Elecrcal Dampe Oscllaon Keywors: rcu, Oscllaon, Dampe Oscllaon, Force Oscllaon, esonance, Smple Harmonc Moon SHM, Dampe Smple Harmonc Moon, Krchhoff s loop rule Obecve:,, are he mos basc elemens of
More information(Im)possibility of Safe Exchange Mechanism Design
(Im)possbly of Safe Exchange Mechansm Desgn Tuomas Sandholm Compuer Scence Deparmen Carnege Mellon Unversy 5 Forbes Avenue Psburgh, PA 15213 sandholm@cs.cmu.edu XaoFeng Wang Deparmen of Elecrcal and Compuer
More informationCase Study on Web Service Composition Based on MultiAgent System
900 JOURNAL OF SOFTWARE, VOL. 8, NO. 4, APRIL 2013 Case Sudy on Web Servce Composon Based on MulAgen Sysem Shanlang Pan Deparmen of Compuer Scence and Technology, Nngbo Unversy, Chna PanShanLang@gmal.com
More informationP R = P 0. The system is shown on the next figure:
TPG460 Reservor Smulaon 06 page of INTRODUCTION TO RESERVOIR SIMULATION Analycal and numercal soluons of smple onedmensonal, onephase flow equaons As an nroducon o reservor smulaon, we wll revew he smples
More informationSocial security, education, retirement and growth*
Hacenda P úblca Espa ñola / Revsa de Econom ía P úblca, 198(3/2011): 936 2011, Insuo de Esudos Fscales Socal secury, educaon, reremen and growh* CRUZ A. ECHEVARR ÍA AMAIA IZA** Unversdad del Pa ís Vasco
More informationA DecisionTheoretic Generalization of OnLine Learning and an Application to Boosting*
journal of compuer and sysem scences 55, 119139 (1997) arcle no. SS971504 A Decsonheorec Generalzaon of OnLne Learnng and an Applcaon o Boosng* Yoav Freund and Rober E. Schapre  A6 Labs, 180 Park Avenue,
More informationProt sharing: a stochastic control approach.
Pro sharng: a sochasc conrol approach. Donaen Hanau Aprl 2, 2009 ESC Rennes. 35065 Rennes, France. Absrac A majory of lfe nsurance conracs encompass a guaraneed neres rae and a parcpaon o earnngs of he
More informationUNIFICATION OF OVERHEAD LINES IN THE CONDITIONS OF THE MARKET OF TWOPARTY AGREEMENTS AND BALANCING ELECTRIC ENERGY MARKET
ENERGETIS AND ELETRIAL ENGINEERING P. D. Lezhnuk, Dc. Sc. (Eng.), Prof.; M. M. heremsn, and. Sc. (Eng.), Prof.; V. V. herkashna, and. Sc. (Eng.), Ass. Prof. UNIFIATION OF OVERHEAD LINES IN THE ONDITIONS
More informationNetwork Effects on Standard Software Markets: A Simulation Model to examine Pricing Strategies
Nework Effecs on Sandard Sofware Markes Page Nework Effecs on Sandard Sofware Markes: A Smulaon Model o examne Prcng Sraeges Peer Buxmann Absrac Ths paper examnes sraeges of sandard sofware vendors, n
More informationPricing Rainbow Options
Prcng Ranbow Opons Peer Ouwehand, Deparmen of Mahemacs and Appled Mahemacs, Unversy of Cape Town, Souh Afrca Emal address: peer@mahs.uc.ac.za Graeme Wes, School of Compuaonal & Appled Mahemacs, Unversy
More informationC.V. Starr Center for Applied Economics
ECONOMIC RESEARCH REPORTS Imperfec Knowledge and Asse Prce Dynamcs: Modelng he Forecasng of Raonal Agens, Dynamc Prospec Theory and Uncerany Prema on Foregn Exchange by Roman Frydman & Mchael D. Goldberg
More informationThe performance of imbalancebased trading strategy on tender offer announcement day
Invesmen Managemen and Fnancal Innovaons, Volume, Issue 2, 24 HanChng Huang (awan), YongChern Su (awan), YChun Lu (awan) he performance of mbalancebased radng sraegy on ender offer announcemen day
More informationGlobal supply chain planning for pharmaceuticals
chemcal engneerng research and desgn 8 9 (2 0 1 1) 2396 2409 Conens lss avalable a ScenceDrec Chemcal Engneerng Research and Desgn journal homepage: www.elsever.com/locae/cherd Global supply chan plannng
More informationarxiv:1407.5820v1 [cs.sy] 22 Jul 2014
Approxmae Regularzaon Pah for Nuclear Norm Based H Model Reducon Nclas Blomberg, Crsan R. Rojas, and Bo Wahlberg arxv:47.58v [cs.sy] Jul 4 Absrac Ths paper concerns model reducon of dynamcal sysems usng
More informationThe Prediction Algorithm Based on Fuzzy Logic Using Time Series Data Mining Method
The Predcon Algorhm Based on Fuzzy Logc Usng Tme Seres Daa Mnng Mehod I Aydn, M Karakose, and E Akn Asrac Predcon of an even a a me seres s que mporan for engneerng and economy prolems Tme seres daa mnng
More informationSPCbased Inventory Control Policy to Improve Supply Chain Dynamics
Francesco Cosanno e al. / Inernaonal Journal of Engneerng and Technology (IJET) SPCbased Invenory Conrol Polcy o Improve Supply Chan ynamcs Francesco Cosanno #, Gulo Gravo #, Ahmed Shaban #3,*, Massmo
More informationMOSFET Threshold Voltage: Definition, Extraction, and Applications
MOSFET Threshold Volage: efnon, Exracon, and Applcaons M. B. Machado, O. F. Sebel, M. C. Schneder, and C. GalupMonoro Federal Unversy of Sana Caarna Brazl Conens 1 Classcal and currenbased hreshold defnon
More informationA Hybrid AANNKPCA Approach to Sensor Data Validation
Proceedngs of he 7h WSEAS Inernaonal Conference on Appled Informacs and Communcaons, Ahens, Greece, Augus 46, 7 85 A Hybrd AANNKPCA Approach o Sensor Daa Valdaon REZA SHARIFI, REZA LANGARI Deparmen of
More informationTECNICHE DI DIAGNOSI AUTOMATICA DEI GUASTI. Silvio Simani silvio.simani@unife.it. References
TECNICHE DI DIAGNOSI AUTOMATICA DEI GUASTI Re Neural per l Idenfcazone d Ssem non Lnear e Paern Recognon slvo.sman@unfe. References Texbook suggesed: Neural Neworks for Idenfcaon, Predcon, and Conrol,
More informationBoth human traders and algorithmic
Shuhao Chen s a Ph.D. canddae n sascs a Rugers Unversy n Pscaaway, NJ. bhmchen@sa.rugers.edu Rong Chen s a professor of Rugers Unversy n Pscaaway, NJ and Peng Unversy, n Bejng, Chna. rongchen@sa.rugers.edu
More informationFundamental Analysis of Receivables and Bad Debt Reserves
Fundamenal Analyss of Recevables and Bad Deb Reserves Mchael Calegar Assocae Professor Deparmen of Accounng Sana Clara Unversy emal: mcalegar@scu.edu February 21 2005 Fundamenal Analyss of Recevables
More informationThe Feedback from Stock Prices to Credit Spreads
Appled Fnance Projec Ka Fa Law (Keh) The Feedback from Sock Prces o Cred Spreads Maser n Fnancal Engneerng Program BA 3N Appled Fnance Projec Ka Fa Law (Keh) Appled Fnance Projec Ka Fa Law (Keh). Inroducon
More informationGround rules. Guide to the calculation methods of the FTSE Actuaries UK Gilts Index Series v1.9
Ground rules Gude o he calculaon mehods of he FTSE Acuares UK Gls Index Seres v1.9 fserussell.com Ocober 2015 Conens 1.0 Inroducon... 4 1.1 Scope... 4 1.2 FTSE Russell... 5 1.3 Overvew of he calculaons...
More informationSHIPPING ECONOMIC ANALYSIS FOR ULTRA LARGE CONTAINERSHIP
Journal of he Easern Asa Socey for Transporaon Sudes, Vol. 6, pp. 936951, 2005 SHIPPING ECONOMIC ANALYSIS FOR ULTRA LARGE CONTAINERSHIP ChaugIng HSU Professor Deparen of Transporaon Technology and Manageen
More informationA binary powering Schur algorithm for computing primary matrix roots
Numercal Algorhms manuscr No. (wll be nsered by he edor) A bnary owerng Schur algorhm for comung rmary marx roos Federco Greco Bruno Iannazzo Receved: dae / Acceed: dae Absrac An algorhm for comung rmary
More informationA Hybrid Method for Forecasting Stock Market Trend Using SoftThresholding Denoise Model and SVM
A Hybrd Mehod for Forecasng Sock Marke Trend Usng SofThresholdng Denose Model and SVM Xueshen Su, Qnghua Hu, Daren Yu, Zongxa Xe, and Zhongyng Q Harbn Insue of Technology, Harbn 150001, Chna Suxueshen@Gmal.com
More informationThe Definition and Measurement of Productivity* Mark Rogers
The Defnon and Measuremen of Producvy* Mark Rogers Melbourne Insue of Appled Economc and Socal Research The Unversy of Melbourne Melbourne Insue Workng Paper No. 9/98 ISSN 13284991 ISBN 0 7325 0912 6
More informationInformationbased trading, price impact of trades, and trade autocorrelation
Informaonbased radng, prce mpac of rades, and rade auocorrelaon Kee H. Chung a,, Mngsheng L b, Thomas H. McInsh c a Sae Unversy of New York (SUNY) a Buffalo, Buffalo, NY 426, USA b Unversy of Lousana
More informationWho are the sentiment traders? Evidence from the crosssection of stock returns and demand. April 26, 2014. Luke DeVault. Richard Sias.
Who are he senmen raders? Evdence from he crosssecon of sock reurns and demand Aprl 26 2014 Luke DeVaul Rchard Sas and Laura Sarks ABSTRACT Recen work suggess ha senmen raders shf from less volale o speculave
More informationManaging banks exposure to the property market in a low interest rate environment: Hong Kong s experience
BOE/CCBS Chef Economss Workshop Managng banks exposure o he propery marke n a low neres rae envronmen: Hong Kong s experence Dong He Hong Kong Moneary Auhory 18 May 211 1 Hong Kong dollar neres raes have
More informationAttribution Strategies and Return on Keyword Investment in Paid Search Advertising
Arbuon Sraeges and Reurn on Keyword Invesmen n Pad Search Adversng by Hongshuang (Alce) L, P. K. Kannan, Sva Vswanahan and Abhshek Pan * December 15, 2015 * Honshuang (Alce) L s Asssan Professor of Markeng,
More informationThe SarbanesOxley Act and Small Public Companies
The SarbanesOxley Ac and Small Publc Companes Smry Prakash Randhawa * June 5 h 2009 ABSTRACT Ths sudy consrucs measures of coss as well as benefs of mplemenng Secon 404 for small publc companes. In hs
More informationANALYSIS OF SOURCE LOCATION ALGORITHMS Part I: Overview and noniterative methods
ANALYSIS OF SOURCE LOCATION ALGORITHMS Par I: Overvew and nonerave mehods MAOCHEN GE Pennsylvana Sae Unversy, Unversy Park PA 1680 Absrac Ths arcle and he accompanyng one dscuss he source locaon heores
More informationProceedings of the Annual Meeting of the American Statistical Association, August 59, 2001
Proceedngs of he Annual Meeng of he Amercan Sascal Assocaon, Augus 59, 00 SHELF LIFE ESTIMATION FOR DRUG PRODUCTS WITH TWO COMPONENTS Annpey Pong and Damaraju Raghavarao Bosascs, Novars Pharmaceucals
More informationAn Ensemble Data Mining and FLANN Combining Shortterm Load Forecasting System for Abnormal Days
JOURNAL OF SOFTWARE, VOL. 6, NO. 6, JUNE 0 96 An Ensemble Daa Mnng and FLANN Combnng Shorerm Load Forecasng Sysem for Abnormal Days Mng L College of Auomaon, Guangdong Unversy of Technology, Guangzhou,
More informationOPENING THE INTERREGIONAL TRADE BLACK BOX : THE CINTEREG DATABASE FOR THE SPANISH ECONOMY (19952005)
OPENING THE INTERREGIONAL TRADE BLACK BOX : THE CINTEREG DATABASE FOR THE SPANISH ECONOMY (19952005) AUTHORS: Carlos Llano Economc Analyss Deparmen. and L.R.Klen InsueCEPREDE. Faculad de CC.EE y EE.
More informationDistributed Load Balancing in a Multiple Server System by ShiftInvariant Protocol Sequences
03 IEEE Wreess Communcaons and Neorkng Conference (WCNC): NETWORS Dsrbued Load Baancng n a Mupe Server Sysem by ShfInvaran rooco Sequences Yupeng Zhang and Wng Shng Wong Deparmen of Informaon Engneerng
More informationDecentralized Model Reference Adaptive Control Without Restriction on Subsystem Relative Degrees
1464 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL 44, NO 7, JULY 1999 [5] S Kosos, Fne npu/oupu represenaon of a class of Volerra polynoal syses, Auoaca, vol 33, no 2, pp 257 262, 1997 [6] S Kosos and D
More informationA Reverse Logistics Model for the Distribution of Waste/Byproducts. Hamid Pourmohammadi, Maged Dessouky*, and Mansour Rahimi
A Reverse Logscs Model for he Dsrbuon of Wase/Byproducs Hamd Pourmohammad, Maged Dessouy*, and Mansour Rahm Unversy of Souhern Calforna Epsen Deparmen of Indusral and Sysems Engneerng 375 McClnoc Avenue,
More informationTesting techniques and forecasting ability of FX Options Implied Risk Neutral Densities. Oren Tapiero
Tesng echnques and forecasng ably of FX Opons Impled Rsk Neural Denses Oren Tapero 1 Table of Conens Absrac 3 Inroducon 4 I. The Daa 7 1. Opon Selecon Crerons 7. Use of mpled spo raes nsead of quoed spo
More informationThe Cause of ShortTerm Momentum Strategies in Stock Market: Evidence from Taiwan
he Cause of Shorerm Momenum Sraeges n Sock Marke: Evdence from awan HungChh Wang 1, Y. Angela Lu 2, and ChunHua Susan Ln 3+ 1 B. A. Dep.,C C U, and B. A. Dep., awan Shoufu Unversy, awan (.O.C. 2 Dep.
More informationTAX COMPETITION AND BRAIN DRAIN IN THE EUROPEAN UNION MEMBERS
Year V, No.7/2008 133 AX COMPEON AND BRAN DRAN N HE EUROPEAN UNON MEMBERS Lec. Raluca DRĂCEA, PhD Lec. Crsan SANCU, PhD Unversy of Craova 1. nroducon he presen paper ams o sudy he correlaon beween he bran
More informationWorking Paper Tracking the new economy: Using growth theory to detect changes in trend productivity
econsor www.econsor.eu Der OpenAccessPublkaonsserver der ZBW LebnzInformaonszenrum Wrschaf The Open Access Publcaon erver of he ZBW Lebnz Informaon Cenre for Economcs Kahn James A.; Rch Rober Workng
More informationInternational Journal of Mathematical Archive7(5), 2016, 193198 Available online through www.ijma.info ISSN 2229 5046
Inernaonal Journal of Mahemacal rchve75), 06, 998 valable onlne hrough wwwjmanfo ISSN 9 506 NOTE ON FUZZY WEKLY OMPLETELY PRIME  IDELS IN TERNRY SEMIGROUPS U NGI REDDY *, Dr G SHOBHLTH Research scholar,
More informationInventory Management MILP Modeling for Tank Farm Systems
2 h European Sympoum on Compuer Aded Proce Engneerng ESCAPE2 S. Perucc and G. Buzz Ferrar (Edor) 2 Elever B.V. All rgh reerved. Invenory Managemen MILP Modelng for Tank Farm Syem Suana Relva a Ana Paula
More informationWorking PaPer SerieS. risk SPillover among hedge funds The role of redemptions and fund failures. no 1112 / november 2009
Workng PaPer SereS no 1112 / november 2009 rsk SPllover among hedge funds The role of redemptons and fund falures by Benjamn Klaus and Bronka Rzepkowsk WORKING PAPER SERIES NO 1112 / NOVEMBER 2009 RISK
More informationBounding Equilibrium Payoffs in Repeated Games with Private Monitoring: Online Appendix
Boundng Equlbrum Payoffs n Repeaed Games wh Prvae Monorng: Onlne Appendx Takuo Sugaya and Alexander Wolzky Sanford Graduae School of Busness and MIT Aprl 25, 2016 Proof of Proposon 2 We prove ha E alk
More informationA multiitem production lot size inventory model with cycle dependent parameters
INERNAIONA JOURNA OF MAHEMAICA MODE AND MEHOD IN APPIED CIENCE A mulem producon lo ze nvenory model wh cycle dependen parameer Zad. Balkh, Abdelazz Foul AbracIn h paper, a mulem producon nvenory model
More information