Displaying similar documents to “A tight lower bound for convexly independent subsets of the Minkowski sums of planar point sets.”

On localizing global Pareto solutions in a given convex set

Agnieszka Drwalewska, Lesław Gajek (1999)

Applicationes Mathematicae

Similarity:

Sufficient conditions are given for the global Pareto solution of the multicriterial optimization problem to be in a given convex subset of the domain. In the case of maximizing real valued-functions, the conditions are sufficient and necessary without any convexity type assumptions imposed on the function. In the case of linearly scalarized vector-valued functions the conditions are sufficient and necessary provided that both the function is concave and the scalarization is increasing...