On minkowski metric and weighted tchebyshev norm in vector optimization *

Abstract

The typical approach in solving vector optimization problems is to scalarize the vector cost function into a single cost function by means of some utility or value function. A very large class of utility function is given by the Minkowski’s metric proposed by Charnes and Cooper in the context of goal programming. This includes the special case of linear scalarization and the weighted Tchebyshev norm. We shall furnish a rigorous justification that there is no equivalent relationship between the general vector optimization problem and scalarized optimization problems using any Minkowski’s metric utility function. Furthermore, we also show that the weighted Tchebyshev norm is, in some sense, the best amongst the class of Minkowski’s metric utility functions since it is the only scalarization method which yields an equivalence relation between the weak vector optimization problem and a set of scalar optimization problems, without any convexity assumption