Trade-off invariance for weighted scalarizations in multi-objective optimization
Abstract
We consider weighted-sum scalarizations for an abstract multi-objective minimization problem defined by the vector-valued map U∋ u↦ ( f1(u),…, fN(u)), where U is an arbitrary nonempty set and no topology, convexity, compactness, or lower semicontinuity assumption is imposed. Using the open simplex as parameter space for positive weights, we show that the Trade-off Invariance Principle for scalarizations yields a generic uniqueness property in the objective space. Namely, for almost every weight vector, all minimizers of the corresponding weighted-sum scalarization have the same objective vector, although the minimizers themselves need not be unique. Moreover, excluding again a null-measure subset, all minimizing sequences determine the same limiting objective vector, independently of the chosen sequence. We also give a geometric interpretation of these results in the attainable objective set: for almost every positive weight vector, the scalarization exposes at most one nondominated point. Furthermore, minimizing sequences determine at most one asymptotically exposed objective vector in the closure of the attainable set.
Related
- Correction to the article "Global well-posedness and scattering in weighted space for nonlinear Schrödinger equations below the Strauss exponent without gauge-invariance"
- Privacy-accuracy trade-off optimization in sensitive surveys through regression estimation
- A connectedness result for convex polynomial multi-objective optimization without boundedness
- Representing the Non-dominated Set of Multi-objective Optimization Problems with Polyhedral Ordering Cones
- MPFA: A Pareto Front Approximation Method for Riemannian Bi-objective Optimization
BibTeX
@misc{klemenc2026tradeoff,
title = {{Trade-off invariance for weighted scalarizations in multi-objective optimization}},
author = {Jona Klemenc and Alessandro Scagliotti},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2606.24493},
eprint = {2606.24493},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2606.24493},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Trade-off invariance for weighted scalarizations in multi-objective optimization
AU - Jona Klemenc
AU - Alessandro Scagliotti
PY - 2026
DA - 2026/09/21
PB - arXiv
DO - 10.48550/arxiv.2606.24493
UR - https://arxiv.org/abs/2606.24493
AB - We consider weighted-sum scalarizations for an abstract multi-objective minimization problem defined by the vector-valued map U∋ u↦ ( f_1(u),…, f_N(u)), where U is an arbitrary nonempty set and no topology, convexity, compactness, or lower semicontinuity assumption is imposed. Using the open simplex as parameter space for positive weights, we show that the Trade-off Invariance Principle for scalarizations yields a generic uniqueness property in the objective space. Namely, for almost every weight vector, all minimizers of the corresponding weighted-sum scalarization have the same objective vector, although the minimizers themselves need not be unique. Moreover, excluding again a null-measure subset, all minimizing sequences determine the same limiting objective vector, independently of the chosen sequence. We also give a geometric interpretation of these results in the attainable objective set: for almost every positive weight vector, the scalarization exposes at most one nondominated point. Furthermore, minimizing sequences determine at most one asymptotically exposed objective vector in the closure of the attainable set.
ER -