Order-preserving transformations and applications
The paper considers properties of efficient sets of vector optimization (or multi-objective optimization) problems. Linear transformations of ordering cones (for ordering efficient solutions) are considered with special emphasis on studying their effects on the order relations. Sufficient conditions for preserving a given order are derived as well as some calculus rules for subdifferentials of convex vector-valued functions. The paper is concluded by some optimality conditions for weak efficiency.
scientific article; zbMATH DE number 2041229