AC : THE DIAGRAMMATIC AND MATHEMATICAL APPROACH OF PROJECT TIME-COST TRADEOFFS
|
|
- Rose Natalie Todd
- 5 years ago
- Views:
Transcription
1 AC : THE DIAGRAMMATIC AND MATHEMATICAL APPROACH OF PROJECT TIME-COST TRADEOFFS Kun-jung Hsu, Leader Unversty Amercan Socety for Engneerng Educaton, 2008 Page
2 Ttle of the Paper: The Dagrammatc and Mathematcal Approach of Project Tme-cost Tradeoffs Abstract A potental project management nvolvng tme used of a project can always be tradeoff by addtonal resources nput. Such a tradeoff may come from dfferent optons of the actvty of the project whch can be choce. The stuaton of Pay more - Save Tme s common for project management related decson problems. The avalable technology of shortenng the duraton of each actvty s often the sources of the tme-cost tradeoffs problem. And the problem solvng processes always rely upon the technques of crtcal path method (CPM) calculaton and mathematc programmng, for example lnear programmng, or nteger programmng etc. The paper ncludes an ntroducton to the concepts of CPM method, tme-cost tradeoff, and the uses of mathematcal programmng n spreadsheet. The dagrammatc expresson of crtcal path method and mathematcal method wll be combned n ths paper, by whch a more clear and effcent exposton of solvng the tme-cost tradeoffs problem wll be exhbted. As a more effcent tool, the paper dscusses such new educaton pedagogy. Introducton Prompted by the present emphass on tme-based competton n ndustry, there are more and more ssues focus on the problem of tme-cost tradeoffs. A potental project management nvolvng tme used of a project can always be tradeoff by addtonal resources nput. Such a tradeoff may come from dfferent optons of the actvty on the crtcal path of the project. The stuaton of Pay more - Save Tme s common for project management related decson problems. The avalable technology of shortenng the duraton of each actvty s often the sources of the tme-cost tradeoffs problem. And the problem solvng processes always rely upon the technques of crtcal path method (CPM) calculaton and mathematc programmng, for example lnear programmng, or nteger programmng etc. Methods of crtcal path method that are frequently used nclude Early-Start, Early-Fnsh, Late-Start, Late-Fnsh calculaton of each actvty. Further, one can use forward method and backward method to fnd the zero float tme actvty, and defne the crtcal path of the project. The project total duraton and ts respectve total project cost needed thus can be obtaned. After advanced evaluaton, f an actvty on the crtcal path can be shortened by more resources nput, one can obtan the other project tme and ts respectve cost. We can use the same way to calculate each possble combnaton of project tme/cost one by one, and fnally obtan a project s tme-cost tradeoffs curve. But now ncludng the mathematcal programmng wll be more effcent for the problem. Usng mathematcal method to solve the tme-cost trade-off problem has been studed extensvely n the project management lterature. Mathematcal approaches convert CPM Page
3 network and tme-cost relatonshps of the project nto constrants and objectve functons. Lnear programmng and nteger programmng are the two major mathematcal approaches used to solve the tme-cost trade-off problems n project schedulnng. By assumng lnear relatonshp between tme and cost for project actvtes, the lnear programmng had been developed three decades ago [3, 4], and well-developed later. The general phlosophy of lnear programmng convert the project tme-cost trade-off problems to mnmzng the objectve cost functon, subject to nequalty tme constrants, and then solve the problem. Computerzed CPM procedure and the applcaton of project management system had been developed by many researchers, for example, [1], [2], [8], and [7]. Computerzed CPM procedure usng spreadsheets to solve the tme-cost tradeoffs problem also already was ntegrated as parts of the standard OR textbook, for example, [5] and [6]. The advantages of lnear programmng algorthms used to obtan the optmal solutons nclude effcency and accuracy. To smplfyng the mathematcal formulaton and ts applcaton n tme-cost tradeoff problem, t wll be helpful f ncludng the vsualzaton spreadsheet expresson. Bascally, crtcal path of a project schedule can be easly calculated n spreadsheet form, the dagrammatc CPM network thus can be extended. But usng mnmum cost prncple to solve tme-cost solutons of all possble combnatons s tme consumng. On the other hand, usng mathematcal programmng to solve the tme-cost trade-off problems, or expressed the problem framework n spreadsheet s relatve easer. How the dagrammatc expresson of crtcal path method and mathematcal method of solvng tme-cost tradeoff wll be a good way for us to combne. Such a new educaton pedagogy, an effcent tool combnes dfferent methods wth nteracton, thus worth us to address n detal. The paper begns wth a typcal ntroducton of the CPM method. The tme-cost tradeoff problem s explored to help facltatng the decson-makng process n tme-based competton framework. Then the paper ntegrates the CPM method and mathematcal programmng n spreadsheet. Fnally, how the solutons of tme-cost tradeoffs can nteract wth the respectve CPM dagrams were presented. The Crtcal Path Method Let ES (Early-Start) represents as the earlest an actvty can start; EF (Early-Fnsh) represents as the earlest an actvty can fnsh; LS (Late-Start) represents as the latest an actvty can start wthout delayng project completon, LF(Late-Fnsh) represents as the latest an actvty can fnsh wthout delayng project completon. One can use uses these nformaton and CPM network calculatons to determne when each actvty must take place n order to fnsh the project n the least amount of tme [9, 10, 11]. Methods of crtcal path method that are frequently used nclude Early-Start, Early-Fnsh, Late-Start, Late-Fnsh calculaton of each actvty. These nformaton and technque allow us to dentfy crtcal actvtes whch must start and fnsh on exact dates and non-crtcal actvtes whose start and fnsh tmes can vary. Because a crtcal path s the longest paths from project start to fnsh, and the total float s the maxmum tme an actvty can be delayed wthout delayng completon of the project. And total float s the maxmum amount of tme n whch an Page
4 actvty can be delayed wthout nterferng wth future events. (TF) equal to zero and fnd the crtcal path. So we need to fnd the total float When we do the CPM network calculaton, one can use forward pass technque and backward technque to fnd the zero float tme actvty, and defne the crtcal path of the project. Forward pass technque s a process of fndng earlest start (ES) tmes and earlest fnsh (EF) tmes for all actvtes; by whch, the forward pass wll gve us an early-start schedule - the earlest the project can fnsh wth the gven logc and actvty duratons. And backward pass technque s a process of fndng latest start (LS) tmes and latest fnsh (LF) tmes for all actvtes. Let represents as begnnng node of actvty, and j represents as the endng node of actvty. One can calculate the total float of an actvty (LS -ES ), we can determne the crtcal path(s). As an llustratve example, Fgure 1 showed the network of an example faclty project wth ten actvtes. Table 1 showed the normal tme vs. crash tme scenaros of all actvtes of the project network, and ther tme and costs to complete the actvtes. Fgure 1: Illustratve example of a buldng constructon project network Followng the crtcal path method descrbes above, one can apply Excel to calculate the total float of each actvty, thus draw the crtcal paths of the normal and crash scenaros. Fnd ES, EF, LS, LF, FF, and TF for the arrow dagram n Fgure 2 and Fgure 3. Fgure 2 showed the crtcal paths dagram of the normal tme; the normal project duraton s 130 weeks. And Fgure 4 showed the crtcal paths dagram of the crash tme; the mnmum project duraton s 90 weeks. The double arrows n Fgure 2 and Fgure 3 ndcate the crtcal paths of the network. Followng the crtcal path method descrbes above, the project total duraton and ts respectve total project cost needed can be obtaned. After advanced evaluaton, f an actvty on the crtcal path can be shortened by more resources nput, one can thus obtan the other project tme and ts respectve cost. Bascally, we can use the same way to calculate each possble combnaton of project tme/cost one by one, and fnally obtan a project s tme-cost tradeoffs curve. But now ncludng the mathematcal programmng wll be more effcent for the problem. To smplfyng the mathematcal formulaton and ts applcaton n tme-cost tradeoff problem, t wll be helpful f ncludng the vsualzaton spreadsheet expresson. Page
5 Table 1: Actvty optons of the project scenaros: normal tme vs. crash tme Actvty # Actvty Descrpton Optons Duraton Cost A Ste Preparaton and Foundaton CREW1+EQUIP1+METHOD ,600 CREW2+EQUIP2+METHOD ,000 B Column and Beam Formwork METHOD ,800 METHOD ,000 C Renforcement Erecton EQUIPMENT ,000 EQUIPMENT ,000 D Exteror Enclosure and Roofng: METHOD1+RAILROAD 45 80,000 shop work and delvery METHOD2+TRUCK 50 60,000 E F Concrete work and Curng METHOD ,000 METHOD ,000 Exteror Enclosure and Roofng CRANE1+CREW ,000 Installaton CRANE2+CREW ,000 Fgure 2: The CPM dagram of the project normal tme Fgure 3: The CPM dagram of the mnmum project tme Page
6 Mathematcal Approach of Tme-cost Tradeoff problem Let s denote the normal and crash tme-cost ponts as the coordnates (D, C D ) and (d, C d ) respectvely. Supposng the optons of the actvty can be effectve combnaton, so that all ntermedate tme-cost trade-offs also are possble and that le on the lne segment between these two ponts. For the present, t wll be assumed that the resources are nfntely dvsble, so that all tme between d and D are contnuous feasble, and the tme-cost relatonshp of the actvty s gven by the lnear lne. The CPM method of tme-cost trade-off approach s to determne just whch tme-cost combnaton should be used for each actvty to meet the scheduled project competton at a mnmum cost. Based on all normal actvty tme-cost opton, the mnmzng total costs prncple of crash tme acton can be expressed as: Mnmzng total project costs = C S d C ; (1) D where d = the reducton tme of actvty ; S represents as the slope of actvty. The aggregaton of all normal actvty costs of the total project, C D s constant, so the basc nformaton we need to address n ths queston s how the mnmum total reducton cost. Whenever we crash each possble actvty, we choose d to mnmze the total addtonal crash cost, where the total tme of the crtcal path s T. To take the project completon tme nto account, we add an auxlary varable y whch expresses the earlest start tme of actvty. For any actvtes wth predecessor () /successor (j) relatonshp, we denote j. So all t presents as nequalty constrant, y j y D d, for all actvty tme-cost trade-off relatonshp. The nequalty constrant showed that an actvty cannot start untl each of ts mmedate predecessors s fnshed. The objectve functon and constrants of all actvtes for lnear programmng to approach the tme-cost trade-off problem then can be wrtten as follows: Mn. C S.t. d ; for all actvty. (2b) * d (2a) y j y D d ; for all actvty, each precedence j. (2c) y FINISH T ; (2d) and 0 ; for all actvty. d * where D = duraton of actvty ; * d = the maxmum reducton tme of actvty. Page
7 Illustratve Example of the Dagrammatc and Mathematcal Approach Followng the llustratve example showed n Fgure 1 and Table 1 n secton of Crtcal Path Method. Usng crtcal path method (CPM), one can attans the maxmum normal project duraton s 130 weeks, and the mnmum project crash duraton s 90 weeks. But f we hope to attan a tme-cost tradeoff curve, we need to calculate all of the possble combnatons for the normal and crash scenaros. Applyng the lnear programmng method descrbes n above secton, we can use Excel to fnd the soluton of a gven project tme. Table 2 showed the basc nput data of actvtes for tme-cost tradeoffs model. Table 3 showed all the solutons of tme-cost and ts respect actvty tme reducton from T= days, where T=1 day. The smulaton results of all tme-cost combnaton were plotted n Fgure 4. Table 2: Basc nput data of actvtes for tme-cost tradeoffs model Tme Cost Actvty # Normal Crash Normal Crash Maxmum Tme Reducton Crash Cost per day Added A ,000 24, ,200 B ,000 39, C ,000 60, ,500 D ,000 80, ,000 E ,000 36, ,600 F ,000 45, Y F E D C B A Fgure 4: Tme-cost tradeoff curve of the llustratve example Page
8 Table 3: Smulaton results of all tme-cost tradeoffs for the llustratve example Project Fnsh Tme Reducton of Actvty # Tme A B C D E F Total Cost , , , , , , , , , , , ,400 If we hope to reveal the story behnd each lnear segment of the tme-cost tradeoff curve n Fgure 4, we need to combne the nformaton of Table 2, Table 3, and CPM dagram of the specfc project duraton now. For example, among actvtes on crtcal path of the normal tme network showed n Fgure 2, actvty-f has the least crash cost per day added ( S =-500, see Table 2). So Table 3 and Fgure 5 showed that n order to crash the project tme from 130 days to 120 days, the project manager need to spend more resources n actvty-f. Ths s the case of lnear segment AB n Fgure 4. Whenever the maxmum tme reducton of actvty-f s exhausted, the strategy of crashng the project tme shfts to the second lower unt crash cost, actvty-b ( S =-700, see Table 2, Table 3, and Fgure 6). Fgure 5: The CPM dagram of the project tme 120 days Page
9 Fgure 6: the CPM dagram of the project tme 119 days But whenever one hopes to crash the project tme from 116 days to 115 days, actvty-b wll be not a good choce. The CPM dagram Fgure 7 showed that f we crash actvty one day more, actvty-b should not an actvty on the crtcal path and more. In ths case, even actvty-b has least unt crash cost, t doesn t work for crashng the project tme. The soluton of crashng project tme as T = 115 now shft to the second lower unt crash cost of the crtcal path actvty-a (Fgure 8, Table 4). Table 3 showed that the solutons of crashng project tme from 116 days to 108 days are crashng the actvty-a, whch n the lnear segment CD n Fgure 4. After the maxmum tme reducton of actvty-a n exhausted, the crashng shfts to actvty-e (the case of DE n Fgure 4). One can uses the same concept descrbed above and extends t to explore the rest segments of Fgure 4, whch need combne the nformaton of LP solutons of tme-cost tradeoffs and CPM dagram of specfc project duraton. Table 4: Comparson dfferent cases of specfc actvty tme reducton: T= T=116 T=115 T=116 Actvty Tme Cost Tme Cost Tme Cost A 28 15, , B 40 32, , C 40 40, , D 50 60, , E 34 20, , F 14 45, , Total cost 212, , Page
10 Fgure 7: T= ; the case of crashng actvty-b Fgure 8: T= ; the case of crashng actvty-a Concludng Remarks Prompted by the present emphass on tme-based competton n ndustry, there are more and more ssues focus on the problem of tme-cost tradeoffs. A potental project management nvolvng tme used of a project can always be tradeoff by addtonal resources nput. Such a tradeoff may come from dfferent optons of the actvty on the crtcal path of the project. The avalable technology of shortenng the duraton of each actvty s often the sources of the tme-cost tradeoffs problem. And the problem solvng processes always rely upon the technques of CPM calculaton. After advanced evaluaton, one can use the CPM to calculate each possble combnaton of project tme/cost one by one, and fnally obtan a project s tme-cost tradeoffs curve. But t wll be more effcent for the problem solvng f one ncludes mathematcal programmng now. Readng the sgnfcant meanng of lnear segments of tme-cost tradeoff curve, t wll be helpful f ncludng the dagrammatc CPM and the solutons of LP together. Ths paper presents a dagrammatc approach n spreadsheet form, whch can provde an easy-to-use tool and calculate the crtcal path n a more easy way. How a tme-cost Page
11 trade-off problem can be represented as a spreadsheet form, then use mathematcal programmng to obtan the tme-cost tradeoff curve. The dagrammatc expresson of crtcal path method and mathematcal method wll be combned wth nteracton way, by whch a more clear and effcent exposton of solvng the tme-cost tradeoffs problem. Bblography 1. Burns, S-A, Lu, L., and Feng, C-W., 1996, LP/IP hybrd Method for Constructon Tme-Cost Trade-off Analyss, Constructon Management and Economcs, 14: Elmaghraby, S.E., Pulat, P.S., 1979, Optmal Project Compresson. wth Due Dated Events, Nay. Research Logstcs Q., 26 (2), Fulkerson, D. R., A Network Flow Computaton for Project Cost Curves, Management Scence, Vol. 7, No. 2. (Jan., 1961), pp Kelley Jr., James E., 1961 Crtcal-Path Plannng and Schedulng: Mathematcal Bass, Operatons Research, Vol. 9, No. 3. (May - Jun., 1961), pp Hller, F. S. and Leberman, G. J., 2007, Introducton to Operaton Research, (8th ed.), McGraw-Hll Company. 6. Hller, F. S. and Hller, M., 2008, Introducton to Management Scence: a modelng and case studes approach wth spreadsheets, (2 th ed.), McGraw-Hll Company. 7. Lu, L., Burns, S-A and Feng, C-W., 1995, Constructon Tme-Cost Trade-off Analyss Usng LP/IP hybrd Method. J. Constr. Engrg. and Mgmt., 121(4) Moder, J. J., Phlps, C. R., and Davs, Edward W., 1983, Project Management wth CPM, PERT and Precedence Dagrammng, 3d ed., Van Nostrand Renhold, New York. 9. Oberlender, G. D., 2002, Project Management for Engneerng and Constructon, 2e, The Mc.Graw-Hll Conyanes, Inc., 10. Pnedo, C., 2002, Schedulng Theory, Algorthms, and Systems, Prentce-Hall, Inc. 11. Stevens, J. D., 1990, Technques for Constructon Network Schedulng, Stanford Unversty. Page
Quiz on Deterministic part of course October 22, 2002
Engneerng ystems Analyss for Desgn Quz on Determnstc part of course October 22, 2002 Ths s a closed book exercse. You may use calculators Grade Tables There are 90 ponts possble for the regular test, or
More informationEVOLUTIONARY OPTIMIZATION OF RESOURCE ALLOCATION IN REPETITIVE CONSTRUCTION SCHEDULES
EVOLUTIONARY OPTIMIZATION OF RESOURCE ALLOCATION IN REPETITIVE CONSTRUCTION SCHEDULES SUBMITTED: October 2003 REVISED: September 2004 ACCEPTED: September 2005 at http://www.tcon.org/2005/18/ EDITOR: C.
More informationOPERATIONS RESEARCH. Game Theory
OPERATIONS RESEARCH Chapter 2 Game Theory Prof. Bbhas C. Gr Department of Mathematcs Jadavpur Unversty Kolkata, Inda Emal: bcgr.umath@gmal.com 1.0 Introducton Game theory was developed for decson makng
More informationTime Planning and Control. Precedence Diagram
Tme Plannng and ontrol Precedence agram Precedence agrammng S ctvty I LS T L n mportant extenson to the orgnal actvty-on-node concept appeared around 14. The sole relatonshp used n PRT/PM network s fnsh
More informationA New Uniform-based Resource Constrained Total Project Float Measure (U-RCTPF) Roni Levi. Research & Engineering, Haifa, Israel
Management Studes, August 2014, Vol. 2, No. 8, 533-540 do: 10.17265/2328-2185/2014.08.005 D DAVID PUBLISHING A New Unform-based Resource Constraned Total Project Float Measure (U-RCTPF) Ron Lev Research
More informationCreating a zero coupon curve by bootstrapping with cubic splines.
MMA 708 Analytcal Fnance II Creatng a zero coupon curve by bootstrappng wth cubc splnes. erg Gryshkevych Professor: Jan R. M. Röman 0.2.200 Dvson of Appled Mathematcs chool of Educaton, Culture and Communcaton
More informationSolution of periodic review inventory model with general constrains
Soluton of perodc revew nventory model wth general constrans Soluton of perodc revew nventory model wth general constrans Prof Dr J Benkő SZIU Gödöllő Summary Reasons for presence of nventory (stock of
More informationCyclic Scheduling in a Job shop with Multiple Assembly Firms
Proceedngs of the 0 Internatonal Conference on Industral Engneerng and Operatons Management Kuala Lumpur, Malaysa, January 4, 0 Cyclc Schedulng n a Job shop wth Multple Assembly Frms Tetsuya Kana and Koch
More informationEconomic Design of Short-Run CSP-1 Plan Under Linear Inspection Cost
Tamkang Journal of Scence and Engneerng, Vol. 9, No 1, pp. 19 23 (2006) 19 Economc Desgn of Short-Run CSP-1 Plan Under Lnear Inspecton Cost Chung-Ho Chen 1 * and Chao-Yu Chou 2 1 Department of Industral
More information-~~?.~~.!.i.':':'.~.~-~-~~~~':':'.~~~.::.~~~~~~~--~-~-~~.::."!}.~!.~.. ~.~~-~...
-~~?.~~.!..':':'.~.~-~-~~~~':':'.~~~.::.~~~~~~~--~-~-~~.::."!}.~!.~.. ~.~~-~.... Part 1: Defnng schedules (10 Descrbe the followng terms as used n schedulng projects. 1.1 Crtcal path 1.2 Slack tme or float
More informationElements of Economic Analysis II Lecture VI: Industry Supply
Elements of Economc Analyss II Lecture VI: Industry Supply Ka Hao Yang 10/12/2017 In the prevous lecture, we analyzed the frm s supply decson usng a set of smple graphcal analyses. In fact, the dscusson
More informationA DUAL EXTERIOR POINT SIMPLEX TYPE ALGORITHM FOR THE MINIMUM COST NETWORK FLOW PROBLEM
Yugoslav Journal of Operatons Research Vol 19 (2009), Number 1, 157-170 DOI:10.2298/YUJOR0901157G A DUAL EXTERIOR POINT SIMPLEX TYPE ALGORITHM FOR THE MINIMUM COST NETWORK FLOW PROBLEM George GERANIS Konstantnos
More informationProject Management Project Phases the S curve
Project lfe cycle and resource usage Phases Project Management Project Phases the S curve Eng. Gorgo Locatell RATE OF RESOURCE ES Conceptual Defnton Realzaton Release TIME Cumulated resource usage and
More informationEvaluating Performance
5 Chapter Evaluatng Performance In Ths Chapter Dollar-Weghted Rate of Return Tme-Weghted Rate of Return Income Rate of Return Prncpal Rate of Return Daly Returns MPT Statstcs 5- Measurng Rates of Return
More informationISyE 2030 Summer Semester 2004 June 30, 2004
ISyE 030 Summer Semester 004 June 30, 004 1. Every day I must feed my 130 pound dog some combnaton of dry dog food and canned dog food. The cost for the dry dog food s $0.50 per cup, and the cost of a
More informationTests for Two Correlations
PASS Sample Sze Software Chapter 805 Tests for Two Correlatons Introducton The correlaton coeffcent (or correlaton), ρ, s a popular parameter for descrbng the strength of the assocaton between two varables.
More informationASIAN JOURNAL OF CIVIL ENGINEERING (BUILDING AND HOUSING) VOL. 12, NO. 4 (2011) PAGES
ASIAN JOURNAL OF CIVIL ENGINEERING (BUILDING AND HOUSING) VOL. 12, NO. 4 (2011) PAGES 511-522 DISCOUNTED CASH FLOW TIME-COST TRADE-OFF PROBLEM OPTIMIZATION; ACO APPROACH K. Aladn, A. Afshar and E. Kalhor
More informationFacility Location Problem. Learning objectives. Antti Salonen Farzaneh Ahmadzadeh
Antt Salonen Farzaneh Ahmadzadeh 1 Faclty Locaton Problem The study of faclty locaton problems, also known as locaton analyss, s a branch of operatons research concerned wth the optmal placement of facltes
More informationA Network Modeling Approach for the Optimization of Internet-Based Advertising Strategies and Pricing with a Quantitative Explanation of Two Paradoxes
A Network Modelng Approach or the Optmzaton o Internet-Based Advertsng Strateges and Prcng wth a Quanttatve Explanaton o Two Paradoxes Lan Zhao Department o Mathematcs and Computer Scences SUNY/College
More informationLecture Note 2 Time Value of Money
Seg250 Management Prncples for Engneerng Managers Lecture ote 2 Tme Value of Money Department of Systems Engneerng and Engneerng Management The Chnese Unversty of Hong Kong Interest: The Cost of Money
More informationOptimization model for resource assignment problems of linear construction projects
Automaton n Constructon 16 (2007) 460 473 www.elsever.com/locate/autcon Optmzaton model for resource assgnment problems of lnear constructon projects Shu-Shun Lu a,, Chang-Jung Wang b,1 a Department of
More informationAvailable online at ScienceDirect. Procedia Computer Science 24 (2013 ) 9 14
Avalable onlne at www.scencedrect.com ScenceDrect Proceda Computer Scence 24 (2013 ) 9 14 17th Asa Pacfc Symposum on Intellgent and Evolutonary Systems, IES2013 A Proposal of Real-Tme Schedulng Algorthm
More informationElton, Gruber, Brown, and Goetzmann. Modern Portfolio Theory and Investment Analysis, 7th Edition. Solutions to Text Problems: Chapter 9
Elton, Gruber, Brown, and Goetzmann Modern Portfolo Theory and Investment Analyss, 7th Edton Solutons to Text Problems: Chapter 9 Chapter 9: Problem In the table below, gven that the rskless rate equals
More information- contrast so-called first-best outcome of Lindahl equilibrium with case of private provision through voluntary contributions of households
Prvate Provson - contrast so-called frst-best outcome of Lndahl equlbrum wth case of prvate provson through voluntary contrbutons of households - need to make an assumpton about how each household expects
More informationA MODEL OF COMPETITION AMONG TELECOMMUNICATION SERVICE PROVIDERS BASED ON REPEATED GAME
A MODEL OF COMPETITION AMONG TELECOMMUNICATION SERVICE PROVIDERS BASED ON REPEATED GAME Vesna Radonć Đogatovć, Valentna Radočć Unversty of Belgrade Faculty of Transport and Traffc Engneerng Belgrade, Serba
More informationMultiobjective De Novo Linear Programming *
Acta Unv. Palack. Olomuc., Fac. rer. nat., Mathematca 50, 2 (2011) 29 36 Multobjectve De Novo Lnear Programmng * Petr FIALA Unversty of Economcs, W. Churchll Sq. 4, Prague 3, Czech Republc e-mal: pfala@vse.cz
More informationSIMPLE FIXED-POINT ITERATION
SIMPLE FIXED-POINT ITERATION The fed-pont teraton method s an open root fndng method. The method starts wth the equaton f ( The equaton s then rearranged so that one s one the left hand sde of the equaton
More informationParallel Prefix addition
Marcelo Kryger Sudent ID 015629850 Parallel Prefx addton The parallel prefx adder presented next, performs the addton of two bnary numbers n tme of complexty O(log n) and lnear cost O(n). Lets notce the
More information15-451/651: Design & Analysis of Algorithms January 22, 2019 Lecture #3: Amortized Analysis last changed: January 18, 2019
5-45/65: Desgn & Analyss of Algorthms January, 09 Lecture #3: Amortzed Analyss last changed: January 8, 09 Introducton In ths lecture we dscuss a useful form of analyss, called amortzed analyss, for problems
More informationTopics on the Border of Economics and Computation November 6, Lecture 2
Topcs on the Border of Economcs and Computaton November 6, 2005 Lecturer: Noam Nsan Lecture 2 Scrbe: Arel Procacca 1 Introducton Last week we dscussed the bascs of zero-sum games n strategc form. We characterzed
More informationLeast Cost Strategies for Complying with New NOx Emissions Limits
Least Cost Strateges for Complyng wth New NOx Emssons Lmts Internatonal Assocaton for Energy Economcs New England Chapter Presented by Assef A. Zoban Tabors Caramans & Assocates Cambrdge, MA 02138 January
More informationFinancial mathematics
Fnancal mathematcs Jean-Luc Bouchot jean-luc.bouchot@drexel.edu February 19, 2013 Warnng Ths s a work n progress. I can not ensure t to be mstake free at the moment. It s also lackng some nformaton. But
More informationThe evaluation method of HVAC system s operation performance based on exergy flow analysis and DEA method
The evaluaton method of HVAC system s operaton performance based on exergy flow analyss and DEA method Xng Fang, Xnqao Jn, Yonghua Zhu, Bo Fan Shangha Jao Tong Unversty, Chna Overvew 1. Introducton 2.
More informationUSING A MULTICRITERIA INTERACTIVE APPROACH IN SCHEDULING NON-CRITICAL ACTIVITIES
OPERATIONS RESEARCH AND DECISIONS No. 1 2018 DOI: 10.5277/ord180103 Mace NOWAK 1 Krzysztof S. TARGIEL 1 USING A MULTICRITERIA INTERACTIVE APPROACH IN SCHEDULING NON-CRITICAL ACTIVITIES A typcal proect
More informationInstituto de Engenharia de Sistemas e Computadores de Coimbra Institute of Systems Engineering and Computers INESC - Coimbra
Insttuto de Engenhara de Sstemas e Computadores de Combra Insttute of Systems Engneerng and Computers INESC - Combra Joana Das Can we really gnore tme n Smple Plant Locaton Problems? No. 7 2015 ISSN: 1645-2631
More informationStochastic job-shop scheduling: A hybrid approach combining pseudo particle swarm optimization and the Monte Carlo method
123456789 Bulletn of the JSME Journal of Advanced Mechancal Desgn, Systems, and Manufacturng Vol.10, No.3, 2016 Stochastc job-shop schedulng: A hybrd approach combnng pseudo partcle swarm optmzaton and
More informationDeveloping a quadratic programming model for time-cost trading off in construction projects under probabilistic constraint
Proceedngs of the Internatonal Conference on Industral Engneerng and Operatons Management Rabat, Morocco, Aprl 11-13, 2017 Developng a quadratc programmng model for tme-cost tradng off n constructon projects
More informationFinancial Risk Management in Portfolio Optimization with Lower Partial Moment
Amercan Journal of Busness and Socety Vol., o., 26, pp. 2-2 http://www.ascence.org/journal/ajbs Fnancal Rsk Management n Portfolo Optmzaton wth Lower Partal Moment Lam Weng Sew, 2, *, Lam Weng Hoe, 2 Department
More informationFinance 402: Problem Set 1 Solutions
Fnance 402: Problem Set 1 Solutons Note: Where approprate, the fnal answer for each problem s gven n bold talcs for those not nterested n the dscusson of the soluton. 1. The annual coupon rate s 6%. A
More informationProblem Set 6 Finance 1,
Carnege Mellon Unversty Graduate School of Industral Admnstraton Chrs Telmer Wnter 2006 Problem Set 6 Fnance, 47-720. (representatve agent constructon) Consder the followng two-perod, two-agent economy.
More informationPrivatization and government preference in an international Cournot triopoly
Fernanda A Ferrera Flávo Ferrera Prvatzaton and government preference n an nternatonal Cournot tropoly FERNANDA A FERREIRA and FLÁVIO FERREIRA Appled Management Research Unt (UNIAG School of Hosptalty
More informationInternational ejournals
Avalable onlne at www.nternatonalejournals.com ISSN 0976 1411 Internatonal ejournals Internatonal ejournal of Mathematcs and Engneerng 7 (010) 86-95 MODELING AND PREDICTING URBAN MALE POPULATION OF BANGLADESH:
More informationHYBRIDISING LOCAL SEARCH WITH BRANCH-AND-BOUND FOR CONSTRAINED PORTFOLIO SELECTION PROBLEMS
HYBRIDISING LOCAL SEARCH WITH BRANCH-AND-BOUND FOR CONSTRAINED PORTFOLIO SELECTION PROBLEMS Fang He 1, 2 and Rong Qu 1 1 The Automated Schedulng, Optmsaton and Plannng (ASAP) Group, School of Computer
More informationUniversity of Toronto November 9, 2006 ECO 209Y MACROECONOMIC THEORY. Term Test #1 L0101 L0201 L0401 L5101 MW MW 1-2 MW 2-3 W 6-8
Department of Economcs Prof. Gustavo Indart Unversty of Toronto November 9, 2006 SOLUTION ECO 209Y MACROECONOMIC THEORY Term Test #1 A LAST NAME FIRST NAME STUDENT NUMBER Crcle your secton of the course:
More informationUniversity of Toronto November 9, 2006 ECO 209Y MACROECONOMIC THEORY. Term Test #1 L0101 L0201 L0401 L5101 MW MW 1-2 MW 2-3 W 6-8
Department of Economcs Prof. Gustavo Indart Unversty of Toronto November 9, 2006 SOLUTION ECO 209Y MACROECONOMIC THEORY Term Test #1 C LAST NAME FIRST NAME STUDENT NUMBER Crcle your secton of the course:
More informationOptimization in portfolio using maximum downside deviation stochastic programming model
Avalable onlne at www.pelagaresearchlbrary.com Advances n Appled Scence Research, 2010, 1 (1): 1-8 Optmzaton n portfolo usng maxmum downsde devaton stochastc programmng model Khlpah Ibrahm, Anton Abdulbasah
More information7.4. Annuities. Investigate
7.4 Annutes How would you lke to be a mllonare wthout workng all your lfe to earn t? Perhaps f you were lucky enough to wn a lottery or have an amazng run on a televson game show, t would happen. For most
More information2) In the medium-run/long-run, a decrease in the budget deficit will produce:
4.02 Quz 2 Solutons Fall 2004 Multple-Choce Questons ) Consder the wage-settng and prce-settng equatons we studed n class. Suppose the markup, µ, equals 0.25, and F(u,z) = -u. What s the natural rate of
More informationA Comparison of Statistical Methods in Interrupted Time Series Analysis to Estimate an Intervention Effect
Transport and Road Safety (TARS) Research Joanna Wang A Comparson of Statstcal Methods n Interrupted Tme Seres Analyss to Estmate an Interventon Effect Research Fellow at Transport & Road Safety (TARS)
More informationPivot Points for CQG - Overview
Pvot Ponts for CQG - Overvew By Bran Bell Introducton Pvot ponts are a well-known technque used by floor traders to calculate ntraday support and resstance levels. Ths technque has been around for decades,
More informationRESOURCE ALLOCATION IN REPETITIVE CONSTRUCTION SCHEDULES USING ANT COLONY OPTIMIZATION
RESOURCE ALLOCATION IN REPETITIVE CONSTRUCTION SCHEDULES USING ANT COLONY OPTIMIZATION Mohamed A. El-Gafy, Ph.D., M.A.I. 1, Amne Ghanem 2 mgafy@lstu.edu 1, ghaneam@eng.fsu.edu 2 Constructon management
More informationCapacitated Location-Allocation Problem in a Competitive Environment
Capactated Locaton-Allocaton Problem n a Compettve Envronment At Bassou Azz, 2 Blal Mohamed, 3 Solh Azz, 4 El Alam Jamla,2 Unversty Mohammed V-Agdal, Laboratory of Systems Analyss, Informaton Processng
More informationOptimising a general repair kit problem with a service constraint
Optmsng a general repar kt problem wth a servce constrant Marco Bjvank 1, Ger Koole Department of Mathematcs, VU Unversty Amsterdam, De Boelelaan 1081a, 1081 HV Amsterdam, The Netherlands Irs F.A. Vs Department
More informationCh Rival Pure private goods (most retail goods) Non-Rival Impure public goods (internet service)
h 7 1 Publc Goods o Rval goods: a good s rval f ts consumpton by one person precludes ts consumpton by another o Excludable goods: a good s excludable f you can reasonably prevent a person from consumng
More informationRostering from Staffing Levels
Rosterng from Staffng Levels a Branch-and-Prce Approach Egbert van der Veen, Bart Veltman 2 ORTEC, Gouda (The Netherlands), Egbert.vanderVeen@ortec.com 2 ORTEC, Gouda (The Netherlands), Bart.Veltman@ortec.com
More informationCHAPTER 9 FUNCTIONAL FORMS OF REGRESSION MODELS
CHAPTER 9 FUNCTIONAL FORMS OF REGRESSION MODELS QUESTIONS 9.1. (a) In a log-log model the dependent and all explanatory varables are n the logarthmc form. (b) In the log-ln model the dependent varable
More informationApplications of Myerson s Lemma
Applcatons of Myerson s Lemma Professor Greenwald 28-2-7 We apply Myerson s lemma to solve the sngle-good aucton, and the generalzaton n whch there are k dentcal copes of the good. Our objectve s welfare
More informationCOS 511: Theoretical Machine Learning. Lecturer: Rob Schapire Lecture #21 Scribe: Lawrence Diao April 23, 2013
COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture #21 Scrbe: Lawrence Dao Aprl 23, 2013 1 On-Lne Log Loss To recap the end of the last lecture, we have the followng on-lne problem wth N
More informationExtreme Nash Equilibrium of Polymatrix Games in Electricity Market
Extreme Nash Equlbrum of Polymatrx Games n Electrcty Market Kalash Chand Sharma, Roht Bhakar and Harpal Twar Department of Electrcal Engneerng, Malavya Natonal Insttute of Technology, Japur, Inda Faculty
More informationTests for Two Ordered Categorical Variables
Chapter 253 Tests for Two Ordered Categorcal Varables Introducton Ths module computes power and sample sze for tests of ordered categorcal data such as Lkert scale data. Assumng proportonal odds, such
More informationOCR Statistics 1 Working with data. Section 2: Measures of location
OCR Statstcs 1 Workng wth data Secton 2: Measures of locaton Notes and Examples These notes have sub-sectons on: The medan Estmatng the medan from grouped data The mean Estmatng the mean from grouped data
More informationHedging Greeks for a portfolio of options using linear and quadratic programming
MPRA Munch Personal RePEc Archve Hedgng reeks for a of otons usng lnear and quadratc rogrammng Panka Snha and Archt Johar Faculty of Management Studes, Unversty of elh, elh 5. February 200 Onlne at htt://mra.ub.un-muenchen.de/20834/
More informationA study on the effective disaster resources assessment and allocation for emergency response
Internatonal Journal of Engneerng and Techncal Research (IJETR) ISSN: 2321-0869, Volume-2, Issue-12, December 2014 A study on the effectve dsaster resources assessment and allocaton for emergency response
More informationTCOM501 Networking: Theory & Fundamentals Final Examination Professor Yannis A. Korilis April 26, 2002
TO5 Networng: Theory & undamentals nal xamnaton Professor Yanns. orls prl, Problem [ ponts]: onsder a rng networ wth nodes,,,. In ths networ, a customer that completes servce at node exts the networ wth
More informationProduction and Supply Chain Management Logistics. Paolo Detti Department of Information Engeneering and Mathematical Sciences University of Siena
Producton and Supply Chan Management Logstcs Paolo Dett Department of Informaton Engeneerng and Mathematcal Scences Unversty of Sena Convergence and complexty of the algorthm Convergence of the algorthm
More informationLOCATION TAXI RANKS IN THE URBAN AGGLOMERATION
LOCATION TAXI RANKS IN THE URBAN AGGLOMERATION ABSTRACT Lokace stanovšť taxslužby v městské aglomerac Ing. Mchal Turek, Ph.D. College of Logstcs, Department of Logstcs and Techncal Dscplnes e-mal: mchal.turek@vslg.cz
More informationStochastic optimal day-ahead bid with physical future contracts
Introducton Stochastc optmal day-ahead bd wth physcal future contracts C. Corchero, F.J. Hereda Departament d Estadístca Investgacó Operatva Unverstat Poltècnca de Catalunya Ths work was supported by the
More informationDr. A. Sudhakaraiah* V. Rama Latha E.Gnana Deepika
Internatonal Journal Of Scentfc & Engneerng Research, Volume, Issue 6, June-0 ISSN - Splt Domnatng Set of an Interval Graph Usng an Algorthm. Dr. A. Sudhakaraah* V. Rama Latha E.Gnana Deepka Abstract :
More informationStochastic Investment Decision Making with Dynamic Programming
Proceedngs of the 2010 Internatonal Conference on Industral Engneerng and Operatons Management Dhaka, Bangladesh, January 9 10, 2010 Stochastc Investment Decson Makng wth Dynamc Programmng Md. Noor-E-Alam
More informationECE 586GT: Problem Set 2: Problems and Solutions Uniqueness of Nash equilibria, zero sum games, evolutionary dynamics
Unversty of Illnos Fall 08 ECE 586GT: Problem Set : Problems and Solutons Unqueness of Nash equlbra, zero sum games, evolutonary dynamcs Due: Tuesday, Sept. 5, at begnnng of class Readng: Course notes,
More informationA joint optimisation model for inventory replenishment, product assortment, shelf space and display area allocation decisions
European Journal of Operatonal Research 181 (2007) 239 251 Producton, Manufacturng and Logstcs A jont optmsaton model for nventory replenshment, product assortment, shelf space and dsplay area allocaton
More informationA Case Study for Optimal Dynamic Simulation Allocation in Ordinal Optimization 1
A Case Study for Optmal Dynamc Smulaton Allocaton n Ordnal Optmzaton Chun-Hung Chen, Dongha He, and Mchael Fu 4 Abstract Ordnal Optmzaton has emerged as an effcent technque for smulaton and optmzaton.
More informationIND E 250 Final Exam Solutions June 8, Section A. Multiple choice and simple computation. [5 points each] (Version A)
IND E 20 Fnal Exam Solutons June 8, 2006 Secton A. Multple choce and smple computaton. [ ponts each] (Verson A) (-) Four ndependent projects, each wth rsk free cash flows, have the followng B/C ratos:
More informationData Mining Linear and Logistic Regression
07/02/207 Data Mnng Lnear and Logstc Regresson Mchael L of 26 Regresson In statstcal modellng, regresson analyss s a statstcal process for estmatng the relatonshps among varables. Regresson models are
More informationreferences Chapters on game theory in Mas-Colell, Whinston and Green
Syllabus. Prelmnares. Role of game theory n economcs. Normal and extensve form of a game. Game-tree. Informaton partton. Perfect recall. Perfect and mperfect nformaton. Strategy.. Statc games of complete
More informationUnderstanding Annuities. Some Algebraic Terminology.
Understandng Annutes Ma 162 Sprng 2010 Ma 162 Sprng 2010 March 22, 2010 Some Algebrac Termnology We recall some terms and calculatons from elementary algebra A fnte sequence of numbers s a functon of natural
More informationPrice and Quantity Competition Revisited. Abstract
rce and uantty Competton Revsted X. Henry Wang Unversty of Mssour - Columba Abstract By enlargng the parameter space orgnally consdered by Sngh and Vves (984 to allow for a wder range of cost asymmetry,
More informationA stochastic approach to hotel revenue optimization
Computers & Operatons Research 32 (2005) 1059 1072 www.elsever.com/locate/dsw A stochastc approach to hotel revenue optmzaton Kn-Keung La, Wan-Lung Ng Department of Management Scences, Cty Unversty of
More informationCOMPARISON OF THE ANALYTICAL AND NUMERICAL SOLUTION OF A ONE-DIMENSIONAL NON-STATIONARY COOLING PROBLEM. László Könözsy 1, Mátyás Benke 2
COMPARISON OF THE ANALYTICAL AND NUMERICAL SOLUTION OF A ONE-DIMENSIONAL NON-STATIONARY COOLING PROBLEM László Könözsy 1, Mátyás Benke Ph.D. Student 1, Unversty Student Unversty of Mskolc, Department of
More informationStochastic ALM models - General Methodology
Stochastc ALM models - General Methodology Stochastc ALM models are generally mplemented wthn separate modules: A stochastc scenaros generator (ESG) A cash-flow projecton tool (or ALM projecton) For projectng
More informationAn annuity is a series of payments made at equal intervals. There are many practical examples of financial transactions involving annuities, such as
2 Annutes An annuty s a seres of payments made at equal ntervals. There are many practcal examples of fnancal transactons nvolvng annutes, such as a car loan beng repad wth equal monthly nstallments a
More informationChapter 3 Student Lecture Notes 3-1
Chapter 3 Student Lecture otes 3-1 Busness Statstcs: A Decson-Makng Approach 6 th Edton Chapter 3 Descrbng Data Usng umercal Measures 005 Prentce-Hall, Inc. Chap 3-1 Chapter Goals After completng ths chapter,
More informationAn Efficient Heuristic Algorithm for m- Machine No-Wait Flow Shops
An Effcent Algorthm for m- Machne No-Wat Flow Shops Dpak Laha and Sagar U. Sapkal Abstract We propose a constructve heurstc for the well known NP-hard of no-wat flow shop schedulng. It s based on the assumpton
More informationAppendix for Solving Asset Pricing Models when the Price-Dividend Function is Analytic
Appendx for Solvng Asset Prcng Models when the Prce-Dvdend Functon s Analytc Ovdu L. Caln Yu Chen Thomas F. Cosmano and Alex A. Hmonas January 3, 5 Ths appendx provdes proofs of some results stated n our
More informationEDC Introduction
.0 Introducton EDC3 In the last set of notes (EDC), we saw how to use penalty factors n solvng the EDC problem wth losses. In ths set of notes, we want to address two closely related ssues. What are, exactly,
More informationII. Random Variables. Variable Types. Variables Map Outcomes to Numbers
II. Random Varables Random varables operate n much the same way as the outcomes or events n some arbtrary sample space the dstncton s that random varables are smply outcomes that are represented numercally.
More informationMidterm Exam. Use the end of month price data for the S&P 500 index in the table below to answer the following questions.
Unversty of Washngton Summer 2001 Department of Economcs Erc Zvot Economcs 483 Mdterm Exam Ths s a closed book and closed note exam. However, you are allowed one page of handwrtten notes. Answer all questons
More informationThe Integration of the Israel Labour Force Survey with the National Insurance File
The Integraton of the Israel Labour Force Survey wth the Natonal Insurance Fle Natale SHLOMO Central Bureau of Statstcs Kanfey Nesharm St. 66, corner of Bach Street, Jerusalem Natales@cbs.gov.l Abstact:
More informationDr.Ram Manohar Lohia Avadh University, Faizabad , (Uttar Pradesh) INDIA 1 Department of Computer Science & Engineering,
Vnod Kumar et. al. / Internatonal Journal of Engneerng Scence and Technology Vol. 2(4) 21 473-479 Generalzaton of cost optmzaton n (S-1 S) lost sales nventory model Vnod Kumar Mshra 1 Lal Sahab Sngh 2
More informationarxiv: v2 [math.co] 6 Apr 2016
On the number of equvalence classes of nvertble Boolean functons under acton of permutaton of varables on doman and range arxv:1603.04386v2 [math.co] 6 Apr 2016 Marko Carć and Modrag Žvkovć Abstract. Let
More informationSOCIETY OF ACTUARIES FINANCIAL MATHEMATICS. EXAM FM SAMPLE SOLUTIONS Interest Theory
SOCIETY OF ACTUARIES EXAM FM FINANCIAL MATHEMATICS EXAM FM SAMPLE SOLUTIONS Interest Theory Ths page ndcates changes made to Study Note FM-09-05. January 14, 014: Questons and solutons 58 60 were added.
More informationWe consider the problem of scheduling trains and containers (or trucks and pallets)
Schedulng Trans and ontaners wth Due Dates and Dynamc Arrvals andace A. Yano Alexandra M. Newman Department of Industral Engneerng and Operatons Research, Unversty of alforna, Berkeley, alforna 94720-1777
More informationAdvisory. Category: Capital
Advsory Category: Captal NOTICE* Subject: Alternatve Method for Insurance Companes that Determne the Segregated Fund Guarantee Captal Requrement Usng Prescrbed Factors Date: Ths Advsory descrbes an alternatve
More informationSurvey of Math Test #3 Practice Questions Page 1 of 5
Test #3 Practce Questons Page 1 of 5 You wll be able to use a calculator, and wll have to use one to answer some questons. Informaton Provded on Test: Smple Interest: Compound Interest: Deprecaton: A =
More informationIntroduction. Chapter 7 - An Introduction to Portfolio Management
Introducton In the next three chapters, we wll examne dfferent aspects of captal market theory, ncludng: Brngng rsk and return nto the pcture of nvestment management Markowtz optmzaton Modelng rsk and
More informationEmploying Fuzzy-Based CVP Analysis for Activity-Based Costing for Maintenance Service Providers
Employng Fuzzy-Based CVP Analyss for Actvty-Based Costng for Mantenance Servce Provders Patcharaporn Yanprat and Jttarat Maneewan Abstract The objectve of ths paper s to propose a framework for proft plannng
More informationBid-auction framework for microsimulation of location choice with endogenous real estate prices
Bd-aucton framework for mcrosmulaton of locaton choce wth endogenous real estate prces Rcardo Hurtuba Mchel Berlare Francsco Martínez Urbancs Termas de Chllán, Chle March 28 th 2012 Outlne 1) Motvaton
More informationMgtOp 215 Chapter 13 Dr. Ahn
MgtOp 5 Chapter 3 Dr Ahn Consder two random varables X and Y wth,,, In order to study the relatonshp between the two random varables, we need a numercal measure that descrbes the relatonshp The covarance
More informationEconomics 330 Money and Banking Problem Set No. 3 Due Tuesday April 3, 2018 at the beginning of class
Economcs 0 Money and Bankng Problem Set No. Due Tuesday Aprl, 08 at the begnnng of class Fall 08 Dr. Ner I. A. The followng table shows the prce of $000 face value -year, -year, -year, 9-year and 0- year
More information