DMOR_HW5_fall10_solutions

DMOR_HW5_fall10_solu - ESI 6314 Deterministic Methods in Operations Research Fall 2010 HW 5 Solutions 1 Problem 7 page 419 Let cij = cost incurred

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Fall 2010 HW 5 Solutions 1. Problem 7, page 419 Let c ij = cost incurred if a machine is purchased at beginning of year i and is kept until beginning of year j. The shortest path problem can be formulated for the network similar to the one in example 2, page 415 (which was also presented in the lecture slides). Using the given data, we obtain (in thousands of dollars): c 12 = 208; c 23 = 258; c 34 = 248; c 45 = 288 c 56 = 388; c 14 = 355; c 15 = 537; c 16 = 841; c 24 = 258 c 25 = 375; c 26 = 557; c 35 = 298; c 36 = 395; c 46 = 388 Using Dijkstra’s algorithm (or, alternatively, by reformulating the problem as a transshipment problem) we obtain that the optimal strategy is as follows: we should first keep the machine for two years and then trade it in, and then we should keep the new machine for three more years till the end of the planning horizon. 2. Problem 8, page 430
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 12/14/2010 for the course ESI 6314 taught by Professor Vladimirlboginski during the Spring '09 term at University of Florida.

Page1 / 4

DMOR_HW5_fall10_solu - ESI 6314 Deterministic Methods in Operations Research Fall 2010 HW 5 Solutions 1 Problem 7 page 419 Let cij = cost incurred

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online