“…Therefore, every possible combination of candidate options over a planning horizon must be examined to get the optimal plan, which leads to a computational explosion (Park et al, 1998). A number of methods have been applied to solve this problem, including mathematical programming technique with decomposition method (Bloom, 1982), linear programming (Masse and Gilbrat, 1957), Pontryagin maximum principle (Park et al, 1985), static optimal mix based on nonlinear programming frameworks (Levin and Zahavi, 1984;Ramos et al, 1989), genetic algorithms (Fukuyama and Chiang, 1996;Park et al, 1998), multicriteria decision analysis (Mills et al, 1996;Voropai and Ivanova, 2000), multiple objective linear programming (Martins et al, 1996;Mavrotas et al, 1999) and dynamic programming (Jenkins and Joy, 1974;Dapkus and Bowe, 1984;Zhao, 1989, 1991;Yang and Chen, 1989).…”