M. Luque, F. Ruiz and R. E. Steuer, “Modified Interactive Chebyshev Algorithm (MICA) for Convex Multiobjective Programming,” European Journal of Operational Research, Vol. 204, No. 3, 2010, pp. 557-564. doi:10.1016/j.ejor.2009.11.011

has been cited by the following article:

• TITLE: An Objective Penalty Functions Algorithm for Multiobjective Optimization Problem

  AUTHORS: Zhiqing Meng, Rui Shen, Min Jiang

  KEYWORDS: Multiobjective Optimization Problem, Objective Penalty Function, Pareto Efficient Solution, Interactive Algorithm

  JOURNAL NAME: American Journal of Operations Research, Vol.1 No.4, December 5, 2011

  ABSTRACT: By using the penalty function method with objective parameters, the paper presents an interactive algorithm to solve the inequality constrained multi-objective programming (MP). The MP is transformed into a single objective optimal problem (SOOP) with inequality constrains; and it is proved that, under some conditions, an optimal solution to SOOP is a Pareto efficient solution to MP. Then, an interactive algorithm of MP is designed accordingly. Numerical examples show that the algorithm can find a satisfactory solution to MP with objective weight value adjusted by decision maker.