RT Journal Article T1 On the use of the Lp distance in reference point-based approaches for multiobjective optimization A1 Luque-Gallego, Mariano A1 Ruiz, Ana B. A1 Saborido Infantes, Rubén A1 Marcenaro-Gutiérrez, Óscar David K1 Programación evolutiva (Informática) AB Reference point-based methods are very useful techniques for solving multiobjective optimization problems. In these methods, the most commonly used achievement scalarizing functions are based on the Tchebychev distance (minmax approach), which generates every Pareto optimal solution in any multiobjective optimization problem, but does not allow compensation among the deviations to the reference values given that it minimizes the value of the highest deviation. At the same time, for any 1<=p<=inf, compromise programming minimizes the Lp distance to the ideal objective vector from the feasible objective region. Although the ideal objective vector can be replaced by a reference point, achievable reference points are not supported by this approach, and special care must be taken in the unachievable case. In this paper, for 1<=p