# Question

At a small but growing airport, the local airline company is purchasing a new tractor for a tractor-trailer train to bring luggage to and from the airplanes. A new mechanized luggage system will be installed in 3 years, so the tractor will not be needed after that. However, because it will receive heavy use, so that the running and maintenance costs will increase rapidly as the tractor ages, it may still be more economical to replace the tractor after 1 or 2 years. The following table gives the total net discounted cost associated with purchasing a tractor (purchase price minus trade-in allowance, plus running and maintenance costs) at the end of year i and trading it in at the end of year j (where year 0 is now).

The problem is to determine at what times (if any) the tractor should be replaced to minimize the total cost for the tractors over 3 years.

(a) Formulate this problem as a shortest-path problem.

(b) Use the algorithm described in Sec. 10.3 to solve this shortestpath problem.

(c) Formulate and solve a spreadsheet model for this problem.

The problem is to determine at what times (if any) the tractor should be replaced to minimize the total cost for the tractors over 3 years.

(a) Formulate this problem as a shortest-path problem.

(b) Use the algorithm described in Sec. 10.3 to solve this shortestpath problem.

(c) Formulate and solve a spreadsheet model for this problem.

## Answer to relevant Questions

Consider the minimum cost flow problem shown below, where the bi values are given by the nodes, the cij values are given by the arcs, and the finite uij values are given in parentheses by the arcs. Obtain an initial BF ...The Lockhead Aircraft Co. is ready to begin a project to develop a new fighter airplane for the U.S. Air Force. The company’s contract with the Department of Defense calls for project completion within 92 weeks, with ...The Quick Company has learned that a competitor is planning to come out with a new kind of product with a great sales potential. Quick has been working on a similar product that had been scheduled to come to market in 20 ...Consider the following nonlinear programming problem. Minimize Z = x41 + 2x22 Subject to x21 + x22 ≥ 2. (There are no nonnegativity constraints.) Use dynamic programming to solve this problem. Imagine that you have $5,000 to invest and that you will have an opportunity to invest that amount in either of two investments (A or B) at the beginning of each of the next 3 years. Both investments have uncertain returns. ...Post your question

0