on
Java
jdk
openjdk
Programing

- Get link
- Other Apps

on
Java
jdk
openjdk
Programing

- Get link
- Other Apps

- Get link
- Other Apps

Suppose a company needs to have a machine over the next five year period. Each new machine costs Rs.100,000. The annual cost of operating a machine during its ith year of operation is given as follows: C1 = 6000, C2 = 8000 and C3 = 12,000. A machine may be kept up to three years before being traded in. This means that a machine can be either kept or traded with in the first two years and has to be traded when its age is three. The trade in value after i years is t1= 80,000, t2 = 60,000 and t3 = 50,000. How can the company minimize costs over the five year period (year 0 to year 5) if the company is going to buy a new machine in the year 0?

Devise an optimal solution based on dynamic programming. Illustrate appropriate stages/ states and the optimal-value function.

Devise an optimal solution based on dynamic programming. Illustrate appropriate stages/ states and the optimal-value function.

## Comments

## Post a Comment