“…Within a single objective framework, one suitable method to solve this problem is dynamic programming, which was initially proposed by Eppen and Fama (1969) and Neave (1970), and more recently followed by Penttinen (1991), Chen and Simchi-Levi (2009), and Melo and Bilich (2013). On the other hand, compromise programming (CP) and goal programming (GP) (Zeleny, 1982;Yu, 2013;Ballestero and Romero, 1998;Ballestero and Pla-Santamaria, 2004;Bravo, Ballestero, and Pla-Santamaria, 2012;Pla-Santamaria and Bravo, 2013) are possible approaches to deal with multiple objectives. When the CMP is formulated as a linear/quadratic program, we can benefit from state-of-the-art mathematical programming solvers to obtain optimal solutions.…”