The solution of transport problems by the method of structural optimization
|
|
- Christiana Underwood
- 6 years ago
- Views:
Transcription
1 Scentfc Journls Mrtme Unversty of Szczecn Zeszyty Nukowe Akdem Morsk w Szczecne 2013, 34(106) pp , 34(106) s ISSN The soluton of trnsport problems by the method of structurl optmzton Sergey A. Krgnov e-ml: sergey.krgnov@gml.com; krgnov@yndex.ru Key words: trnsportton problem, optmzton, the blnce of nterests, the compenston of dmges of the prtes Abstrct Currently do not tke nto ccount the possblty of constructng seprte supply of the product optml desgns for supplers nd consumers. Ths mpedes the development of optmzed trffc flow n the country. The proposed method of structurl optmzton llows to fnd compromse pln for optml delvery of products. Introducton The key feture of trnsport problems s tht the obects re homogeneous nd nterchngeble pln on how to use. Dstrbuton s only one type of resource, of whch ech unt dependng on the locton of ts orgnl locton nd plce of ts ntended use receves dfferent estmte of the totl cost of delvery. Trnsport problems re solved usng two methods: the smplex method nd the method of potentls. Both methods yeld the sme optml solutons tht re ndependent of the wll of reserchers to the nterests of ether supplers or consumers. When solvng rel-world trnsportton problems such optml soluton would be vrtully mpossble to mplement becuse provders nd recpents of products re well nformed bout mrket prces, trnsportton nd producton, nd no optml or expert methods of delverng ther products cn not force them to dopt economclly dsdvntgeous decson. The method of structurl optmzton, used for solvng trnsport problems nd developed by the uthor of ths work, helps to vod these shortcomngs nd fnd compromse soluton. When usng ths method, the phrse... the best structure... should be understood s n optml scheme of processes (optons for delvery of products), whch ensures complnce wth gven constrnts on supply nd demnd of products t the lowest cost of trnsportton. An lgorthm of the structurl optmzton method nd the results of ts use re llustrted n ths pper on the exmples of problem solvng number 85 nd number 71 from the textbook [1]. Exercse number 85. Mchnng Dvson hs t ts dsposl three mchnes: M 1, M 2, M 3 whch cn produce four knds of detls: D 1, D 2, D 3, D 4. Tme spent (n mnutes) s gven n the tble 1. Tble 1. The tme these mchnes need to produce one pece of ech type detls M M M The cceptble workng hours of mchne tools (ndctor A ) equls for the tool: А mn, А mn, А mn. The plnned producton of tools (ndctor B ) equls: В peces, В peces, В peces nd В peces. The tsk s to dstrbute the producton of prts for mchne tools so s not to exceed the tme lmt the use of mchnery to ensure the plnned volumes of producton prts re reched, tkng the optmzton crteron s the mnmum totl tme of usng the mchne tools. Zeszyty Nukowe 34(106) 59
2 Sergey A. Krgnov Soluton. Accordng to the optmzton crteron, the mthemtcl model tkes the followng form: x ) 12x 15x wth constrnts: 10x x 32 x 21 8x x 2x x mn 1) x 2x 10x 12x ) x 8x 2x ) x x (1) 4) x x x 200 (2) ) x x x ) x x x ) x x x where: mount of tme (mn) of tool (suppler) for producton of one detl of type (for consumer); х mount of detl type (for consumer), produced on tool (delvered by suppler). After solvng the problem wth the smplex method we hve: x ) = 5200, when the vlue of vrbles re: х 11 = 200, х 23 = 200, х 24 = 600 nd х 32 = 800. Consder soluton of ths problem provded tht the optmzton s crred out n the nterests of consumers of prts. In ths cse, the process of fndng the optml soluton wll consst of two steps: The frst step. Set prortes for ech consumer (the problem s consumers re detls) for the servces supplers (.e. the processng tme of detls): B P (3) Obvously, the greter the P () (Tble 2), the hgher the prorty of the provder detls. Therefore, the crteron of cost optmzton for the producton of detls cn be gven by the followng functon: Tble 2. The vlues of ndvdul prortes (P () ) for components ( ) M 1 40* M * 120* M * * ( ) P ( ) mx (4) where v = 1 for dmssble, under the ssumed constrnts, technologcl methods of delvery, wth hghest prorty. Step 2. Determne the optmum dstrbuton of volumes (X ) of detls n ech of the mchnes ccordng to the mxmum vlue of crteron (3) for every product. In tble 2, the vlues of these qunttes re mrked wth *. As for the detls of D 4 prortes of ts producton on mchne M 2 nd M 3 re equl, then the output of ths prt should be plnned on mchne whch s the lest utlzed n the producton, whch n ths exmple, hppens to be mchne M 2. The resultng optml (from the pont of consumers of these detls) dstrbuton of producton nd supply of detls for mchne tools s gven n tble 3. Tble 3. Optml dstrbuton detls to customers M M M The totl mnmum processng tme of prts x ) s: F ( ) mn. x However, the obtned soluton represents only the nterests of one sde detls of consumers who re nterested n reducng producton cost. Another spects of ths exmple re the prts supplers, whch, n turn, re more nterested n the rtonl (economcl nd unform) usng equpment owned by them. Therefore, for producers of the detls functon optmzton (4) becomes (5): A ( ) P( ) mx (5) The dstrbuton of the detls to the crter (5) under constrnts (2) n ths cse cn lso be relzed n two steps: Step 1. Settng prortes (P () ) 1 of mchnes 2 durng the processng of the detls of type tht re provded n tble 4. In tble 4 the sgn * mrks the best optons of dstrbutng of detls for producton on mchnes. 1 In ths exmple, the mxmum relese of detls of vrous types on prtculr mchne, but n generl lmtng shpments of smlr products ech suppler. 2 Assume tht the mchnes vlble for lesng. 60 Scentfc Journls 34(106)
3 The soluton of trnsport problems by the method of structurl optmzton Tble 4. Prortes for the producton of detls n ech of the mchnes M * ,33 M * 2000 M * Step 2. Allocte producton of detls for the mchnes of gven the vlues found prortes. For mchnes M 2 follow to be fxed s producton detls D 1 (P 2(1) = 1000) nd detls of D 4 (P 2(4) = 2000). Gven tht the producton of detls D 2 s benefcl for the speclzton of the two mchnes (M 1 nd M 3 ), the dstrbuton of producton detls D 2 between them should be mde proportonl to the vlues of the prortes of these mchnes n the producton of ech of the detls. So, f necessry, the producton of detls on two mchnes (k nd l) the dstrbuton of producton volumes of detls should be mde ccordng to formuls (6). B k( ) Pk ( ) B( ) ; Bl ( ) B Bk ( ) (6) P P k( ) l( ) In ths exmple, the dstrbuton of producton detls D 2 between M 1 nd M 3 wll be respectvely 274 unts [ /( )] nd 526 detls ( ). The dstrbuton of the plnned producton volume detls D 2 nd other detls re gven n tble 5. Tble 5. The optml producton pln for supplers of detls M M M Totl mnmum tme of mchne utlzton wll be n ths cse: x ) mn. If you compre the optons plns submtted n tbles 3 nd 6, berng n mnd the tme of mchne utlzton, t cn see tht the optmzton ccordng to crteron (6) relly reflects the nterests of the owner of mchnes (the mnufcturer): the totl tme of mchne utlzton ncresed by 1.25 tmes (6474:5200), s result of ncresed producton on M 2,.e. the mchne tht hs the hghest tme of utlzton. At the sme tme ncresed the volume of delveres of products from the mchne M 1 from 200 to 274 prts. It s obvous tht such lrge dscrepncy between the best possble solutons to ths problem for supplers nd consumers wll be the mn detls of the reson why none of the optml desgn of delvery detls wll not be relzed. However, both prtes nvolved n solvng ths trnsportton problem nd ts soluton should eqully consder the nterests (prortes) of both supplers nd customers of products. Therefore, the clculton of the bsolute prortes for the generl optons under consderton, the supply of products to solve trnsportton problems by structurl optmzton should be performed ccordng to formul (7): A B P P P (7) In ths cse, functon optmzton (v ) tkes the form: A B ( ) P mx (8) Note, tht ths method does not prortze the obvous dvntges to ny of the plyers n ths process. In ts fnl form of n lgorthm for solvng trnsport problems by the method of structurl optmzton cn be gven by: The frst step. Settng prortes (P ) of technologcl solutons to problems usng the formul (8), gven n tble 6. Tble 6. Uncondtonl prortes of technologcl optons for producton nd delvery of detls M ,3 M * * 2120* M 3 193,3 3200* The second step. Dstrbuton of the producton of prts for the mchne tools, ccordng to the mxmum vlue of P (n decresng order), whch re prortes n the tble mrked wth *. The optml soluton, obtned tkng nto ccount the bsolute prortes, s gven n tble 7. Tble 7. Combned optml producton nd delvery detls M 1 M M Zeszyty Nukowe 34(106) 61
4 Sergey A. Krgnov The totl mnmum processng tme of detls x ) mount n ths cse to: F ( ) mn. x The resultng optml pln not only reflects the needs of the detls to mnmze the processng tme, but wll lso mke one mchne (M 1 ) redundnt. Exercse number 71. A mnufcturer of buldng mterls hve three wrehouses (W 1, W 2, W 3 ) n dfferent prts of the cty provdes brcks to compny, whch constructs prtments n four dfferent vllges (V 1, V 2, V 3, V 4 ). In wrehouses locted respectvely 100, 50 nd 80 thousnd brck, nd constructon stes needs ccount for respectvely 40, 70, 30 nd 50 thousnd brcks. The costs of the constructon frm to delver one thousnd brcks from the wrehouses to constructon stes re shown n tble 8. The cost of storng thousnd peces of brck n wrehouses s 10, 12.5 nd 10 PLN. Tble 8. Costs (n PLN for 1 thousnd peces) for the vrous technologcl optons for delvery of brcks Wrehouse Vllges W W W Accordng to the pror rrngements vllge V 1 should receve no less thn 30 thousnd peces of brcks from the wrehouse W 1, vllge V 2 35 thousnd peces from the wrehousew 1, nd V 3 10 thousnd peces from the wrehouse W 2 nd no less thn 10 thousnd peces from wrehousew 1. Tkng nto ccount the submtted dt the pln of the brck trffc provdng wth the mnmum trnsportton costs nd storge costs should be drwn. One more queston to nswer s wht trnsportton nd storge costs would be f prelmnry rrngements fled. Soluton. Gven the prelmnry rrngements for mndtory supply of brck from wrehouses to consumers, brck wrehouses whch re free to dstrbute stock (А *), consttute (n thousnd peces): n wrehouse W 1 25( ); n wrehouse W 2 40(50 10) nd W 2 n wrehouse 80 thousnd of peces of brcks, nd the not yet met needs (B *) n buldng stes wll be respectvely: 10(40 30), 35(70 35), 10( ) nd 50. The overll cost of prelmnry greements reched 4950 thousnd PLN ( ). Tkng nto consderton the prelmnry greements, the trnsport problem tkes the form presented n the tble 9. Tble 9. Trnsportton costs of one thousnd brcks nd the remnng brcks n wrehouses (А *) nd yet not met needs for brck n vllges (n B *) Wrehouse Vllges А * W W W В * The frst step. Settng prortes (P ) of technologcl solutons to ths problem ccordng to formul (8). The prortes re presented n the tble 10. Tble 10. The vlues of the bsolute prortes of dfferent technologcl delvery vrnts for prevously not conducted delveres Wrehouse Vllges W W * W * 7.667* 1.800* The tble 10 the symbol * denotes gven vrnts of mxmum dstrbuton. The result of ths llocton s gven n tble 11. Tble 11. The prelmnry pln of optml supply of yet undelvered brcks Wrehouse Vllges W 1 W 2 40 W The second step. Snce the dstrbuton n the supply of brcks for the mxmum vlues of the bsolute prortes of the technologcl methods of delvery of brcks produced n the frst step of clcultons (Tble 10), dd not provde full sze requrements n the supply of brcks to vllge V 4 (P 3;4 = 2.167). The mssng brcks n need for ths vllge n order of prorty cn be suppled from stock W 3. Tble 12. The optml supply pln blnces the need for brcks Wrehouses А * W 1 25 W 2 40* 40 W 3 10* 35* 10* 10* 80 В * Scentfc Journls 34(106)
5 The soluton of trnsport problems by the method of structurl optmzton For technology optons dentfed n the tble 12 the symbol * needs nd supples of brck re equl wth the possbltes of meetng them. If we dd to the mounts n tble 12 gven the prelmnry rrngements whch hve lredy tken plce, the full mount of the optml supply of brcks tkes the form shown n the tble 13. Tble 13. The optml verson of the pln delvery of brcks (n thousnds) tkng nto ccount pre-rrngements Wrehouses А * W W * W В * 40* 70* 30* 50* As follows from the dt presented n tble 13 the possbltes of wrehouses W 1 nd W 2 hve not been fully utlzed. The remns of brcks n those stocks ccount for 25 nd 15 thousnd unts, respectvely. And the nnul storge costs mount to 400 thousnd PLN ( ). The totl mnmum cost of trnsportng the brcks n the optml verson of the pln wll be: x ) thousnds PLN It should be noted tht ths opton s the optml pln whch ws presented n tble 13 concded wth the verson of the pln clculted wth the smplex method. The ddtonl queston of Exercse 71 concerned the trnsportton nd storge costs f the prelmnry rrngements fled. The nswer to ths queston usng the structurl optmzton method cn be obtned on the bss of complete (wthout the prelmnry rrngements) vlues of the bsolute prortes lsted n tble 14. Tble 14. The vlues of the bsolute prortes of dfferent technologcl delvery vrnts for prevously wthout the prelmnry rrngements Wrehouses W W W Then the optml delvery pln formed n the order of decresng bsolute prortes,.e. by (8), tkes the form presented n tble 15. Tble 15. The optml progrm of brcks delvery wthout pror greement, drwn up by structurl optmzton method Wrehouses А * W W * W * В * 40* 70* 30* 50* Gven ths concrete verson of the pln, the trnsportton chrges wll be: x ) thousnds PLN At the sme tme storge chrges of the remnng brcks n the stock W 1,.e. 40 thousnd peces wll be 400 thousnd PLN (40 10), nd the totl costs of storge nd trnsportton 6050 thousnd PLN. It should be observed tht by solvng ths problem by the smplex method (Tble 16) the totl costs of brck storge nd trnsportton would mount to only 6000 thousnd PLN. Tble 16. The optml progrm of brck delvery wthout pror greement, drwn up by the smplex method Wrehouses А * W W * W * В * 40* 70* 30* 50* Although n ths optml soluton the levels of brck delvery from W 1 nd W 3 re the sme, ther costs re dfferent. The totl cost of trnsportton from the wrehouse number 3 wll ncrese by 250 thousnd PLN, nd from the wrehouse number 1 on the contrry wll decrese by 300 thousnds PLN. At the sme tme verge of the costs trnsportton thousnd peces of brcks from the wrehouse W 1 to ll the consumers [( ):4] re hgher thn the delvery costs from W 3 [( ):4] by 1.7 tmes nd n ths optml soluton by tmes! It s therefore evdent tht the soluton of ths problem of the smplex method or potentl method would be uncceptble to consumers brck wrehouse W 1, but becuse of ths optml pln wll never be relzed. Conclusons Whle summrzng the presentton of the method of structurl optmzton nd exmples of Zeszyty Nukowe 34(106) 63
6 Sergey A. Krgnov ts mplementton, the smplcty nd verstlty of the method should be hghlghted. As the exmples presented n the pper hve demonstrted, the method of potentls nd the smplex method cnnot be lwys successfully used. Becuse the trnsportton of products s connected wth costs whch re pd by both consumers nd dstrbutors, then the dstrbuton method should stsfy the needs nd requrements of both prtes nvolved n the trnscton. The pln, drwn up usng the crteron (8) does not only stsfy the needs of the prtes of contrct, but lso better fts the fnncl condtons of the prtes. The method of structurl optmzton cn become n mportnt rgument whle doptng mutully dvntgeous condtons n trnsportton trnsctons, but lso the bss for determnng socl snctons for volton of the rules of the optml delvery of products n fvor of ether supplers or customers (the effects of monopoly of ether producers or consumers). References 1. JĘDRZEJCZYK Z., KUKUŁA K., SKRZYPEK J., WALKOSZ A.: Bdn opercyne w przykłdch zdnch. Redktor nukowy Krol Kukuł. Wydwnctwo Nukowe PWN, Wrszw Scentfc Journls 34(106)
UNIVERSITY OF IOANNINA DEPARTMENT OF ECONOMICS. M.Sc. in Economics MICROECONOMIC THEORY I. Problem Set II
Mcroeconomc Theory I UNIVERSITY OF IOANNINA DEPARTMENT OF ECONOMICS MSc n Economcs MICROECONOMIC THEORY I Techng: A Lptns (Note: The number of ndctes exercse s dffculty level) ()True or flse? If V( y )
More informationApplied Statistics Qualifier Examination
Appled Sttstcs Qulfer Exmnton Qul_june_8 Fll 8 Instructons: () The exmnton contns 4 Questons. You re to nswer 3 out of 4 of them. () You my use ny books nd clss notes tht you mght fnd helpful n solvng
More informationChapter Newton-Raphson Method of Solving a Nonlinear Equation
Chpter.4 Newton-Rphson Method of Solvng Nonlner Equton After redng ths chpter, you should be ble to:. derve the Newton-Rphson method formul,. develop the lgorthm of the Newton-Rphson method,. use the Newton-Rphson
More informationDCDM BUSINESS SCHOOL NUMERICAL METHODS (COS 233-8) Solutions to Assignment 3. x f(x)
DCDM BUSINESS SCHOOL NUMEICAL METHODS (COS -8) Solutons to Assgnment Queston Consder the followng dt: 5 f() 8 7 5 () Set up dfference tble through fourth dfferences. (b) Wht s the mnmum degree tht n nterpoltng
More informationDennis Bricker, 2001 Dept of Industrial Engineering The University of Iowa. MDP: Taxi page 1
Denns Brcker, 2001 Dept of Industrl Engneerng The Unversty of Iow MDP: Tx pge 1 A tx serves three djcent towns: A, B, nd C. Ech tme the tx dschrges pssenger, the drver must choose from three possble ctons:
More informationRank One Update And the Google Matrix by Al Bernstein Signal Science, LLC
Introducton Rnk One Updte And the Google Mtrx y Al Bernsten Sgnl Scence, LLC www.sgnlscence.net here re two dfferent wys to perform mtrx multplctons. he frst uses dot product formulton nd the second uses
More information4. Eccentric axial loading, cross-section core
. Eccentrc xl lodng, cross-secton core Introducton We re strtng to consder more generl cse when the xl force nd bxl bendng ct smultneousl n the cross-secton of the br. B vrtue of Snt-Vennt s prncple we
More informationChapter Newton-Raphson Method of Solving a Nonlinear Equation
Chpter 0.04 Newton-Rphson Method o Solvng Nonlner Equton Ater redng ths chpter, you should be ble to:. derve the Newton-Rphson method ormul,. develop the lgorthm o the Newton-Rphson method,. use the Newton-Rphson
More informationJens Siebel (University of Applied Sciences Kaiserslautern) An Interactive Introduction to Complex Numbers
Jens Sebel (Unversty of Appled Scences Kserslutern) An Interctve Introducton to Complex Numbers 1. Introducton We know tht some polynoml equtons do not hve ny solutons on R/. Exmple 1.1: Solve x + 1= for
More informationLecture 4: Piecewise Cubic Interpolation
Lecture notes on Vrtonl nd Approxmte Methods n Appled Mthemtcs - A Perce UBC Lecture 4: Pecewse Cubc Interpolton Compled 6 August 7 In ths lecture we consder pecewse cubc nterpolton n whch cubc polynoml
More information523 P a g e. is measured through p. should be slower for lesser values of p and faster for greater values of p. If we set p*
R. Smpth Kumr, R. Kruthk, R. Rdhkrshnn / Interntonl Journl of Engneerng Reserch nd Applctons (IJERA) ISSN: 48-96 www.jer.com Vol., Issue 4, July-August 0, pp.5-58 Constructon Of Mxed Smplng Plns Indexed
More informationThe Schur-Cohn Algorithm
Modelng, Estmton nd Otml Flterng n Sgnl Processng Mohmed Njm Coyrght 8, ISTE Ltd. Aendx F The Schur-Cohn Algorthm In ths endx, our m s to resent the Schur-Cohn lgorthm [] whch s often used s crteron for
More informationDemand. Demand and Comparative Statics. Graphically. Marshallian Demand. ECON 370: Microeconomic Theory Summer 2004 Rice University Stanley Gilbert
Demnd Demnd nd Comrtve Sttcs ECON 370: Mcroeconomc Theory Summer 004 Rce Unversty Stnley Glbert Usng the tools we hve develoed u to ths ont, we cn now determne demnd for n ndvdul consumer We seek demnd
More informationKatholieke Universiteit Leuven Department of Computer Science
Updte Rules for Weghted Non-negtve FH*G Fctorzton Peter Peers Phlp Dutré Report CW 440, Aprl 006 Ktholeke Unverstet Leuven Deprtment of Computer Scence Celestjnenln 00A B-3001 Heverlee (Belgum) Updte Rules
More informationLinear and Nonlinear Optimization
Lner nd Nonlner Optmzton Ynyu Ye Deprtment of Mngement Scence nd Engneerng Stnford Unversty Stnford, CA 9430, U.S.A. http://www.stnford.edu/~yyye http://www.stnford.edu/clss/msnde/ Ynyu Ye, Stnford, MS&E
More informationPhysics 121 Sample Common Exam 2 Rev2 NOTE: ANSWERS ARE ON PAGE 7. Instructions:
Physcs 121 Smple Common Exm 2 Rev2 NOTE: ANSWERS ARE ON PAGE 7 Nme (Prnt): 4 Dgt ID: Secton: Instructons: Answer ll 27 multple choce questons. You my need to do some clculton. Answer ech queston on the
More informationM/G/1/GD/ / System. ! Pollaczek-Khinchin (PK) Equation. ! Steady-state probabilities. ! Finding L, W q, W. ! π 0 = 1 ρ
M/G//GD/ / System! Pollcze-Khnchn (PK) Equton L q 2 2 λ σ s 2( + ρ ρ! Stedy-stte probbltes! π 0 ρ! Fndng L, q, ) 2 2 M/M/R/GD/K/K System! Drw the trnston dgrm! Derve the stedy-stte probbltes:! Fnd L,L
More informationINTRODUCTION TO COMPLEX NUMBERS
INTRODUCTION TO COMPLEX NUMBERS The numers -4, -3, -, -1, 0, 1,, 3, 4 represent the negtve nd postve rel numers termed ntegers. As one frst lerns n mddle school they cn e thought of s unt dstnce spced
More informationInvestigation phase in case of Bragg coupling
Journl of Th-Qr Unversty No.3 Vol.4 December/008 Investgton phse n cse of Brgg couplng Hder K. Mouhmd Deprtment of Physcs, College of Scence, Th-Qr, Unv. Mouhmd H. Abdullh Deprtment of Physcs, College
More informationRemember: Project Proposals are due April 11.
Bonformtcs ecture Notes Announcements Remember: Project Proposls re due Aprl. Clss 22 Aprl 4, 2002 A. Hdden Mrov Models. Defntons Emple - Consder the emple we tled bout n clss lst tme wth the cons. However,
More informationInternational Journal of Pure and Applied Sciences and Technology
Int. J. Pure Appl. Sc. Technol., () (), pp. 44-49 Interntonl Journl of Pure nd Appled Scences nd Technolog ISSN 9-67 Avlle onlne t www.jopst.n Reserch Pper Numercl Soluton for Non-Lner Fredholm Integrl
More informationQuiz: Experimental Physics Lab-I
Mxmum Mrks: 18 Totl tme llowed: 35 mn Quz: Expermentl Physcs Lb-I Nme: Roll no: Attempt ll questons. 1. In n experment, bll of mss 100 g s dropped from heght of 65 cm nto the snd contner, the mpct s clled
More informationElectrochemical Thermodynamics. Interfaces and Energy Conversion
CHE465/865, 2006-3, Lecture 6, 18 th Sep., 2006 Electrochemcl Thermodynmcs Interfces nd Energy Converson Where does the energy contrbuton F zϕ dn come from? Frst lw of thermodynmcs (conservton of energy):
More informationGAUSS ELIMINATION. Consider the following system of algebraic linear equations
Numercl Anlyss for Engneers Germn Jordnn Unversty GAUSS ELIMINATION Consder the followng system of lgebrc lner equtons To solve the bove system usng clsscl methods, equton () s subtrcted from equton ()
More informationJean Fernand Nguema LAMETA UFR Sciences Economiques Montpellier. Abstract
Stochstc domnnce on optml portfolo wth one rsk less nd two rsky ssets Jen Fernnd Nguem LAMETA UFR Scences Economques Montpeller Abstrct The pper provdes restrctons on the nvestor's utlty functon whch re
More informationVariable time amplitude amplification and quantum algorithms for linear algebra. Andris Ambainis University of Latvia
Vrble tme mpltude mplfcton nd quntum lgorthms for lner lgebr Andrs Ambns Unversty of Ltv Tlk outlne. ew verson of mpltude mplfcton;. Quntum lgorthm for testng f A s sngulr; 3. Quntum lgorthm for solvng
More informationMEASURING THE EFFECT OF PRODUCTION FACTORS ON YIELD OF GREENHOUSE TOMATO PRODUCTION USING MULTIVARIATE MODEL
MEASURING THE EFFECT OF PRODUCTION FACTORS ON YIELD OF GREENHOUSE TOMATO PRODUCTION USING MULTIVARIATE MODEL Mrn Nkoll, MSc Ilr Kpj, PhD An Kpj (Mne), Prof. As. Jon Mullr Agrculture Unversty of Trn Alfons
More informationName: SID: Discussion Session:
Nme: SID: Dscusson Sesson: hemcl Engneerng hermodynmcs -- Fll 008 uesdy, Octoer, 008 Merm I - 70 mnutes 00 onts otl losed Book nd Notes (5 ponts). onsder n del gs wth constnt het cpctes. Indcte whether
More informationMATHEMATICAL MODEL AND STATISTICAL ANALYSIS OF THE TENSILE STRENGTH (Rm) OF THE STEEL QUALITY J55 API 5CT BEFORE AND AFTER THE FORMING OF THE PIPES
6 th Reserch/Exert Conference wth Interntonl Prtcton QUALITY 009, Neum, B&H, June 04 07, 009 MATHEMATICAL MODEL AND STATISTICAL ANALYSIS OF THE TENSILE STRENGTH (Rm) OF THE STEEL QUALITY J55 API 5CT BEFORE
More informationIntroduction to Numerical Integration Part II
Introducton to umercl Integrton Prt II CS 75/Mth 75 Brn T. Smth, UM, CS Dept. Sprng, 998 4/9/998 qud_ Intro to Gussn Qudrture s eore, the generl tretment chnges the ntegrton prolem to ndng the ntegrl w
More informationStatistics and Probability Letters
Sttstcs nd Probblty Letters 79 (2009) 105 111 Contents lsts vlble t ScenceDrect Sttstcs nd Probblty Letters journl homepge: www.elsever.com/locte/stpro Lmtng behvour of movng verge processes under ϕ-mxng
More informationDynamic Power Management in a Mobile Multimedia System with Guaranteed Quality-of-Service
Dynmc Power Mngement n Moble Multmed System wth Gurnteed Qulty-of-Servce Qnru Qu, Qng Wu, nd Mssoud Pedrm Dept. of Electrcl Engneerng-Systems Unversty of Southern Clforn Los Angeles CA 90089 Outlne! Introducton
More informationDuality # Second iteration for HW problem. Recall our LP example problem we have been working on, in equality form, is given below.
Dulity #. Second itertion for HW problem Recll our LP emple problem we hve been working on, in equlity form, is given below.,,,, 8 m F which, when written in slightly different form, is 8 F Recll tht we
More informationPartially Observable Systems. 1 Partially Observable Markov Decision Process (POMDP) Formalism
CS294-40 Lernng for Rootcs nd Control Lecture 10-9/30/2008 Lecturer: Peter Aeel Prtlly Oservle Systems Scre: Dvd Nchum Lecture outlne POMDP formlsm Pont-sed vlue terton Glol methods: polytree, enumerton,
More information2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification
E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton
More informationDefinition of Tracking
Trckng Defnton of Trckng Trckng: Generte some conclusons bout the moton of the scene, objects, or the cmer, gven sequence of mges. Knowng ths moton, predct where thngs re gong to project n the net mge,
More informationTwo Coefficients of the Dyson Product
Two Coeffcents of the Dyson Product rxv:07.460v mth.co 7 Nov 007 Lun Lv, Guoce Xn, nd Yue Zhou 3,,3 Center for Combntorcs, LPMC TJKLC Nnk Unversty, Tnjn 30007, P.R. Chn lvlun@cfc.nnk.edu.cn gn@nnk.edu.cn
More informationAn Introduction to Support Vector Machines
An Introducton to Support Vector Mchnes Wht s good Decson Boundry? Consder two-clss, lnerly seprble clssfcton problem Clss How to fnd the lne (or hyperplne n n-dmensons, n>)? Any de? Clss Per Lug Mrtell
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationTHE COMBINED SHEPARD ABEL GONCHAROV UNIVARIATE OPERATOR
REVUE D ANALYSE NUMÉRIQUE ET DE THÉORIE DE L APPROXIMATION Tome 32, N o 1, 2003, pp 11 20 THE COMBINED SHEPARD ABEL GONCHAROV UNIVARIATE OPERATOR TEODORA CĂTINAŞ Abstrct We extend the Sheprd opertor by
More information= z 20 z n. (k 20) + 4 z k = 4
Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5
More informationOn the Multicriteria Integer Network Flow Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 5, No 2 Sofa 2005 On the Multcrtera Integer Network Flow Problem Vassl Vasslev, Marana Nkolova, Maryana Vassleva Insttute of
More informationIn this Chapter. Chap. 3 Markov chains and hidden Markov models. Probabilistic Models. Example: CpG Islands
In ths Chpter Chp. 3 Mrov chns nd hdden Mrov models Bontellgence bortory School of Computer Sc. & Eng. Seoul Ntonl Unversty Seoul 5-74, Kore The probblstc model for sequence nlyss HMM (hdden Mrov model)
More informationMachine Learning Support Vector Machines SVM
Mchne Lernng Support Vector Mchnes SVM Lesson 6 Dt Clssfcton problem rnng set:, D,,, : nput dt smple {,, K}: clss or lbel of nput rget: Construct functon f : X Y f, D Predcton of clss for n unknon nput
More informationTHE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens
THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of
More informationA Tri-Valued Belief Network Model for Information Retrieval
December 200 A Tr-Vlued Belef Networ Model for Informton Retrevl Fernndo Ds-Neves Computer Scence Dept. Vrgn Polytechnc Insttute nd Stte Unversty Blcsburg, VA 24060. IR models t Combnng Evdence Grphcl
More informationSmart Motorways HADECS 3 and what it means for your drivers
Vehcle Rentl Smrt Motorwys HADECS 3 nd wht t mens for your drvers Vehcle Rentl Smrt Motorwys HADECS 3 nd wht t mens for your drvers You my hve seen some news rtcles bout the ntroducton of Hghwys Englnd
More informationProblem Set 9. Figure 1: Diagram. This picture is a rough sketch of the 4 parabolas that give us the area that we need to find. The equations are:
(x + y ) = y + (x + y ) = x + Problem Set 9 Discussion: Nov., Nov. 8, Nov. (on probbility nd binomil coefficients) The nme fter the problem is the designted writer of the solution of tht problem. (No one
More informationCalculation of time complexity (3%)
Problem 1. (30%) Calculaton of tme complexty (3%) Gven n ctes, usng exhaust search to see every result takes O(n!). Calculaton of tme needed to solve the problem (2%) 40 ctes:40! dfferent tours 40 add
More informationESCI 342 Atmospheric Dynamics I Lesson 1 Vectors and Vector Calculus
ESI 34 tmospherc Dnmcs I Lesson 1 Vectors nd Vector lculus Reference: Schum s Outlne Seres: Mthemtcl Hndbook of Formuls nd Tbles Suggested Redng: Mrtn Secton 1 OORDINTE SYSTEMS n orthonorml coordnte sstem
More information( ) ( )()4 x 10-6 C) ( ) = 3.6 N ( ) = "0.9 N. ( )ˆ i ' ( ) 2 ( ) 2. q 1 = 4 µc q 2 = -4 µc q 3 = 4 µc. q 1 q 2 q 3
3 Emple : Three chrges re fed long strght lne s shown n the fgure boe wth 4 µc, -4 µc, nd 3 4 µc. The dstnce between nd s. m nd the dstnce between nd 3 s lso. m. Fnd the net force on ech chrge due to the
More informationProperties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives
Block #6: Properties of Integrls, Indefinite Integrls Gols: Definition of the Definite Integrl Integrl Clcultions using Antiderivtives Properties of Integrls The Indefinite Integrl 1 Riemnn Sums - 1 Riemnn
More informationLimited Dependent Variables
Lmted Dependent Varables. What f the left-hand sde varable s not a contnuous thng spread from mnus nfnty to plus nfnty? That s, gven a model = f (, β, ε, where a. s bounded below at zero, such as wages
More informationThe Number of Rows which Equal Certain Row
Interntonl Journl of Algebr, Vol 5, 011, no 30, 1481-1488 he Number of Rows whch Equl Certn Row Ahmd Hbl Deprtment of mthemtcs Fcult of Scences Dmscus unverst Dmscus, Sr hblhmd1@gmlcom Abstrct Let be X
More informationChapter 9 Definite Integrals
Chpter 9 Definite Integrls In the previous chpter we found how to tke n ntiderivtive nd investigted the indefinite integrl. In this chpter the connection etween ntiderivtives nd definite integrls is estlished
More informationAcceptance Sampling by Attributes
Introduction Acceptnce Smpling by Attributes Acceptnce smpling is concerned with inspection nd decision mking regrding products. Three spects of smpling re importnt: o Involves rndom smpling of n entire
More informationLOCAL FRACTIONAL LAPLACE SERIES EXPANSION METHOD FOR DIFFUSION EQUATION ARISING IN FRACTAL HEAT TRANSFER
Yn, S.-P.: Locl Frctonl Lplce Seres Expnson Method for Dffuson THERMAL SCIENCE, Yer 25, Vol. 9, Suppl., pp. S3-S35 S3 LOCAL FRACTIONAL LAPLACE SERIES EXPANSION METHOD FOR DIFFUSION EQUATION ARISING IN
More informationEcon107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)
I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes
More informationfractions Let s Learn to
5 simple lgebric frctions corne lens pupil retin Norml vision light focused on the retin concve lens Shortsightedness (myopi) light focused in front of the retin Corrected myopi light focused on the retin
More informationAmiri s Supply Chain Model. System Engineering b Department of Mathematics and Statistics c Odette School of Business
Amr s Supply Chan Model by S. Ashtab a,, R.J. Caron b E. Selvarajah c a Department of Industral Manufacturng System Engneerng b Department of Mathematcs Statstcs c Odette School of Busness Unversty of
More information6.6 The Marquardt Algorithm
6.6 The Mqudt Algothm lmttons of the gdent nd Tylo expnson methods ecstng the Tylo expnson n tems of ch-sque devtves ecstng the gdent sech nto n tetve mtx fomlsm Mqudt's lgothm utomtclly combnes the gdent
More informationThe oligopolistic markets
ernando Branco 006-007 all Quarter Sesson 5 Part II The olgopolstc markets There are a few supplers. Outputs are homogenous or dfferentated. Strategc nteractons are very mportant: Supplers react to each
More informationA Hybrid Variational Iteration Method for Blasius Equation
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 1 (June 2015), pp. 223-229 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) A Hybrd Varatonal Iteraton Method
More informationBi-level models for OD matrix estimation
TNK084 Trffc Theory seres Vol.4, number. My 2008 B-level models for OD mtrx estmton Hn Zhng, Quyng Meng Abstrct- Ths pper ntroduces two types of O/D mtrx estmton model: ME2 nd Grdent. ME2 s mxmum-entropy
More informationCS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 9
CS434/541: Pttern Recognton Prof. Olg Veksler Lecture 9 Announcements Fnl project proposl due Nov. 1 1-2 prgrph descrpton Lte Penlt: s 1 pont off for ech d lte Assgnment 3 due November 10 Dt for fnl project
More informationLecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
More informationSection 3.6 Complex Zeros
04 Chapter Secton 6 Comple Zeros When fndng the zeros of polynomals, at some pont you're faced wth the problem Whle there are clearly no real numbers that are solutons to ths equaton, leavng thngs there
More information7.2 Volume. A cross section is the shape we get when cutting straight through an object.
7. Volume Let s revew the volume of smple sold, cylnder frst. Cylnder s volume=se re heght. As llustrted n Fgure (). Fgure ( nd (c) re specl cylnders. Fgure () s rght crculr cylnder. Fgure (c) s ox. A
More informationWinter 2008 CS567 Stochastic Linear/Integer Programming Guest Lecturer: Xu, Huan
Wnter 2008 CS567 Stochastc Lnear/Integer Programmng Guest Lecturer: Xu, Huan Class 2: More Modelng Examples 1 Capacty Expanson Capacty expanson models optmal choces of the tmng and levels of nvestments
More informationCS-433: Simulation and Modeling Modeling and Probability Review
CS-433: Smulaton and Modelng Modelng and Probablty Revew Exercse 1. (Probablty of Smple Events) Exercse 1.1 The owner of a camera shop receves a shpment of fve cameras from a camera manufacturer. Unknown
More informationTorsion, Thermal Effects and Indeterminacy
ENDS Note Set 7 F007bn orson, herml Effects nd Indetermncy Deformton n orsonlly Loded Members Ax-symmetrc cross sectons subjected to xl moment or torque wll remn plne nd undstorted. At secton, nternl torque
More informationProblem Set 3 Solutions
Chemistry 36 Dr Jen M Stndrd Problem Set 3 Solutions 1 Verify for the prticle in one-dimensionl box by explicit integrtion tht the wvefunction ψ ( x) π x is normlized To verify tht ψ ( x) is normlized,
More informationComputing a complete histogram of an image in Log(n) steps and minimum expected memory requirements using hypercubes
Computng complete hstogrm of n mge n Log(n) steps nd mnmum expected memory requrements usng hypercubes TAREK M. SOBH School of Engneerng, Unversty of Brdgeport, Connectcut, USA. Abstrct Ths work frst revews
More informationA Family of Multivariate Abel Series Distributions. of Order k
Appled Mthemtcl Scences, Vol. 2, 2008, no. 45, 2239-2246 A Fmly of Multvrte Abel Seres Dstrbutons of Order k Rupk Gupt & Kshore K. Ds 2 Fculty of Scence & Technology, The Icf Unversty, Agrtl, Trpur, Ind
More information6 Roots of Equations: Open Methods
HK Km Slghtly modfed 3//9, /8/6 Frstly wrtten t Mrch 5 6 Roots of Equtons: Open Methods Smple Fed-Pont Iterton Newton-Rphson Secnt Methods MATLAB Functon: fzero Polynomls Cse Study: Ppe Frcton Brcketng
More informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationLecture 16 Statistical Analysis in Biomaterials Research (Part II)
3.051J/0.340J 1 Lecture 16 Statstcal Analyss n Bomaterals Research (Part II) C. F Dstrbuton Allows comparson of varablty of behavor between populatons usng test of hypothess: σ x = σ x amed for Brtsh statstcan
More informationW. We shall do so one by one, starting with I 1, and we shall do it greedily, trying
Vitli covers 1 Definition. A Vitli cover of set E R is set V of closed intervls with positive length so tht, for every δ > 0 nd every x E, there is some I V with λ(i ) < δ nd x I. 2 Lemm (Vitli covering)
More informationIs there an easy way to find examples of such triples? Why yes! Just look at an ordinary multiplication table to find them!
PUSHING PYTHAGORAS 009 Jmes Tnton A triple of integers ( bc,, ) is clled Pythgoren triple if exmple, some clssic triples re ( 3,4,5 ), ( 5,1,13 ), ( ) fond of ( 0,1,9 ) nd ( 119,10,169 ). + b = c. For
More informationInfinite Geometric Series
Infinite Geometric Series Finite Geometric Series ( finite SUM) Let 0 < r < 1, nd let n be positive integer. Consider the finite sum It turns out there is simple lgebric expression tht is equivlent to
More informationCISE 301: Numerical Methods Lecture 5, Topic 4 Least Squares, Curve Fitting
CISE 3: umercl Methods Lecture 5 Topc 4 Lest Squres Curve Fttng Dr. Amr Khouh Term Red Chpter 7 of the tetoo c Khouh CISE3_Topc4_Lest Squre Motvton Gven set of epermentl dt 3 5. 5.9 6.3 The reltonshp etween
More informationPrinciple Component Analysis
Prncple Component Anlyss Jng Go SUNY Bufflo Why Dmensonlty Reducton? We hve too mny dmensons o reson bout or obtn nsghts from o vsulze oo much nose n the dt Need to reduce them to smller set of fctors
More informationChapter 12 Analysis of Covariance
Chapter Analyss of Covarance Any scentfc experment s performed to know somethng that s unknown about a group of treatments and to test certan hypothess about the correspondng treatment effect When varablty
More informationCompilers. Spring term. Alfonso Ortega: Enrique Alfonseca: Chapter 4: Syntactic analysis
Complers Sprng term Alfonso Ortega: alfonso.ortega@uam.es nrque Alfonseca: enrque.alfonseca@uam.es Chapter : Syntactc analyss. Introducton. Bottom-up Analyss Syntax Analyser Concepts It analyses the context-ndependent
More informationMATH FIELD DAY Contestants Insructions Team Essay. 1. Your team has forty minutes to answer this set of questions.
MATH FIELD DAY 2012 Contestnts Insructions Tem Essy 1. Your tem hs forty minutes to nswer this set of questions. 2. All nswers must be justified with complete explntions. Your nswers should be cler, grmmticlly
More informationp-adic Egyptian Fractions
p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction
More informationMath 1B, lecture 4: Error bounds for numerical methods
Mth B, lecture 4: Error bounds for numericl methods Nthn Pflueger 4 September 0 Introduction The five numericl methods descried in the previous lecture ll operte by the sme principle: they pproximte the
More information8 Transportation Problem Alpha-Beta
8 rnsportton Proble Alph-Bet Now, we ntroduce n ddtonl lgorth for the Htchcock rnsportton proble, whch ws lredy ntroduced before hs s the Alph-Bet Algorth It copletes the lst of soluton pproches for solvng
More informationChemical Reaction Engineering
Lecture 20 hemcl Recton Engneerng (RE) s the feld tht studes the rtes nd mechnsms of chemcl rectons nd the desgn of the rectors n whch they tke plce. Lst Lecture Energy Blnce Fundmentls F 0 E 0 F E Q W
More informationChapter 1: Fundamentals
Chpter 1: Fundmentls 1.1 Rel Numbers Types of Rel Numbers: Nturl Numbers: {1, 2, 3,...}; These re the counting numbers. Integers: {... 3, 2, 1, 0, 1, 2, 3,...}; These re ll the nturl numbers, their negtives,
More informationConvexity preserving interpolation by splines of arbitrary degree
Computer Scence Journal of Moldova, vol.18, no.1(52), 2010 Convexty preservng nterpolaton by splnes of arbtrary degree Igor Verlan Abstract In the present paper an algorthm of C 2 nterpolaton of dscrete
More informationUnit #9 : Definite Integral Properties; Fundamental Theorem of Calculus
Unit #9 : Definite Integrl Properties; Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl
More informationCENTROID (AĞIRLIK MERKEZİ )
CENTOD (ĞLK MEKEZİ ) centrod s geometrcl concept rsng from prllel forces. Tus, onl prllel forces possess centrod. Centrod s tougt of s te pont were te wole wegt of pscl od or sstem of prtcles s lumped.
More information3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X
Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number
More informationName Solutions to Test 3 November 8, 2017
Nme Solutions to Test 3 November 8, 07 This test consists of three prts. Plese note tht in prts II nd III, you cn skip one question of those offered. Some possibly useful formuls cn be found below. Brrier
More informationAPPROXIMATE INTEGRATION
APPROXIMATE INTEGRATION. Introduction We hve seen tht there re functions whose nti-derivtives cnnot be expressed in closed form. For these resons ny definite integrl involving these integrnds cnnot be
More informationA-Level Mathematics Transition Task (compulsory for all maths students and all further maths student)
A-Level Mthemtics Trnsition Tsk (compulsory for ll mths students nd ll further mths student) Due: st Lesson of the yer. Length: - hours work (depending on prior knowledge) This trnsition tsk provides revision
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationNew data structures to reduce data size and search time
New dt structures to reduce dt size nd serch time Tsuneo Kuwbr Deprtment of Informtion Sciences, Fculty of Science, Kngw University, Hirtsuk-shi, Jpn FIT2018 1D-1, No2, pp1-4 Copyright (c)2018 by The Institute
More informationDiscussion 11 Summary 11/20/2018
Dscusson 11 Summary 11/20/2018 1 Quz 8 1. Prove for any sets A, B that A = A B ff B A. Soluton: There are two drectons we need to prove: (a) A = A B B A, (b) B A A = A B. (a) Frst, we prove A = A B B A.
More information