Proper efficiency, scalarization and transformation in multi-objective optimization: Unified approaches
Pith reviewed 2026-05-25 10:01 UTC · model grok-4.3
The pith
A general scalarization corresponds to properly efficient solutions in multi-objective optimization under given conditions, and a transformation preserves this efficiency.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
Under some conditions, the solutions of the general scalar program are properly efficient and vice versa. If the scalar problem is unbounded, the original multi-objective problem has no properly efficient solution. A general transformation of the objective functions preserves proper efficiency, and several important results in the literature follow as direct consequences.
What carries the argument
The general scalarization problem that reduces multi-objective to scalar, along with the transformation of objective functions preserving proper efficiency.
If this is right
- If the considered general scalar problem is unbounded, then the original multi-objective problem does not have any properly efficient solution.
- The solutions of the scalar program are properly efficient under the provided conditions, and vice versa.
- A general transformation of the objective functions preserves proper efficiency.
- Several important results existing in the literature are direct consequences of these results.
Where Pith is reading between the lines
- Practitioners could use the scalarization to find properly efficient solutions more easily in applications like engineering design with multiple criteria.
- This unification might help in developing new scalarization methods that automatically satisfy the conditions for proper efficiency.
- Further research could test these conditions in non-convex or discrete multi-objective problems to see the boundaries of applicability.
Load-bearing premise
The equivalences and preservation results hold only under some conditions on the problem, such as properties of the objective functions or the feasible set.
What would settle it
Finding a multi-objective problem and a scalarization where the conditions are not satisfied but a scalar solution is not properly efficient would falsify the claimed relationships.
Figures
read the original abstract
In this paper, we investigate the relationships between proper efficiency and the solutions of a general scalarization problem in multi-objective optimization. We provide some conditions under which the solutions of the dealt with scalar program are properly efficient and vice versa. We also show that, under some conditions, if the considered general scalar problem is unbounded, then the original multi-objective problem does not have any properly efficient solution. In another part of the work, we investigate a general transformation of the objective functions which preserves proper efficiency. We show that several important results existing in the literature are direct consequences of the results of the present paper.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript investigates relationships between proper efficiency in multi-objective optimization and optimality in a general scalarization problem. It claims to supply conditions under which solutions of the scalar program are properly efficient (and vice versa), to prove that unboundedness of the scalar problem implies non-existence of properly efficient solutions for the vector problem (under some conditions), and to study a general transformation of the objective functions that preserves proper efficiency. It further asserts that several existing results in the literature follow directly as consequences of the new theorems.
Significance. If the stated conditions turn out to be both explicit and minimal, and if the derivations are correct, the paper would offer a useful unifying lens on proper efficiency and scalarization, with the derivation of prior results as corollaries constituting a genuine organizational contribution. No machine-checked proofs or reproducible code are present, but the attempt at unification itself would be the primary source of value.
major comments (3)
- [Abstract, §1] Abstract and §1: All central claims (equivalence between proper efficiency and scalar optimality, the unbounded-scalar implication, and preservation under transformation) are qualified by the phrase “under some conditions,” yet the precise hypotheses (convexity or convexity of the image set, continuity, compactness of the feasible set, etc.) are never enumerated in a single upfront list. This is load-bearing for the if-and-only-if statements and for the claim that the results apply to the non-convex or unbounded problems that originally motivated the study of proper efficiency.
- [§3] §3 (or wherever the main equivalence theorem appears): The necessity direction (“properly efficient solutions yield scalar optima”) is asserted only under the same unspecified conditions; without an explicit statement of the minimal assumptions and without a counter-example showing that at least one hypothesis cannot be dropped, it is impossible to judge whether the claimed equivalence is sharp or merely recovers known convex-case results.
- [§4] §4 (transformation result): The claim that the transformation preserves proper efficiency is again stated only “under some conditions.” If those conditions include convexity of the original objectives, the result cannot be used to justify the literature claims that are invoked for non-convex problems, undermining the “direct consequences” assertion made in the abstract.
minor comments (2)
- [§2] Notation for the general scalar program (e.g., the weighting vector or the ordering cone) is introduced without a forward reference to the precise definition used in the equivalence theorems.
- [§5] Several literature citations in the final section are listed but not accompanied by the explicit derivation showing how they follow from the new theorems; a short table or numbered list would improve readability.
Simulated Author's Rebuttal
We thank the referee for the careful and constructive report. The comments highlight opportunities to improve clarity on assumptions and sharpness of results. We agree that explicit enumeration of hypotheses will strengthen the paper and will revise accordingly. Below we respond point by point.
read point-by-point responses
-
Referee: [Abstract, §1] Abstract and §1: All central claims (equivalence between proper efficiency and scalar optimality, the unbounded-scalar implication, and preservation under transformation) are qualified by the phrase “under some conditions,” yet the precise hypotheses (convexity or convexity of the image set, continuity, compactness of the feasible set, etc.) are never enumerated in a single upfront list. This is load-bearing for the if-and-only-if statements and for the claim that the results apply to the non-convex or unbounded problems that originally motivated the study of proper efficiency.
Authors: We agree that an explicit, consolidated list of standing assumptions would improve readability and allow readers to immediately assess applicability. In the revised version we will insert, immediately after the abstract and again at the opening of §1, a bulleted list enumerating the minimal hypotheses used throughout (properties of the ordering cone, continuity/closedness requirements on the objective map, and any convexity or boundedness assumptions on the image set). This list will be referenced in each subsequent theorem statement. revision: yes
-
Referee: [§3] §3 (or wherever the main equivalence theorem appears): The necessity direction (“properly efficient solutions yield scalar optima”) is asserted only under the same unspecified conditions; without an explicit statement of the minimal assumptions and without a counter-example showing that at least one hypothesis cannot be dropped, it is impossible to judge whether the claimed equivalence is sharp or merely recovers known convex-case results.
Authors: The necessity direction is proved under the hypotheses stated in the theorem (which include the cone properties and continuity of the scalarizing functional). To demonstrate sharpness we will add a short remark containing a simple counter-example (drawn from standard non-convex constructions in the literature) showing that the equivalence can fail when the image set is not closed or when the ordering cone is not pointed. This addition will be placed immediately after the main equivalence theorem. revision: yes
-
Referee: [§4] §4 (transformation result): The claim that the transformation preserves proper efficiency is again stated only “under some conditions.” If those conditions include convexity of the original objectives, the result cannot be used to justify the literature claims that are invoked for non-convex problems, undermining the “direct consequences” assertion made in the abstract.
Authors: The transformation result is formulated for general (not necessarily convex) objective maps; convexity is not required. The corollaries recover known statements for both convex and non-convex settings precisely because the hypotheses remain at the level of cone properties and continuity. In the revision we will add an explicit sentence in §4 and in the abstract clarifying that the transformation theorem does not impose convexity, thereby preserving the applicability to the non-convex literature results cited. revision: yes
Circularity Check
No significant circularity; derivations remain independent of inputs.
full rationale
The paper states relationships between proper efficiency and solutions of a general scalarization problem, plus a transformation preserving proper efficiency, all qualified by 'under some conditions' and shown to imply prior literature results. No equations, self-definitional reductions, fitted parameters renamed as predictions, or load-bearing self-citations appear in the provided abstract or context. The central claims rest on external mathematical conditions rather than reducing to the paper's own inputs or prior self-work by construction. This is the expected non-finding for a theoretical unification paper without explicit self-referential loops.
Axiom & Free-Parameter Ledger
Reference graph
Works this paper leans on
-
[1]
H.P. Benson, Existence of efficient solutions for vector maximization pro blems, Journal of Optimization Theory and Applications 26 (1978), pp. 569–580
work page 1978
-
[2]
H.P. Benson, An improved definition of proper efficiency for vector maximiz ation with respect to cones, Journal of Mathematical Analysis and Applications 71 (1979), pp. 232– 241
work page 1979
-
[3]
Clarke, Optimization and Nonsmooth Analysis , Vol
F.H. Clarke, Optimization and Nonsmooth Analysis , Vol. 5, SIAM, 1990
work page 1990
-
[4]
Ehrgott, Multicriteria Optimization , Vol
M. Ehrgott, Multicriteria Optimization , Vol. 491, Springer Science & Business Media, 2005
work page 2005
-
[5]
Eichfelder, Adaptive Scalarization Methods in Multiobjective Optimiz ation, Vol
G. Eichfelder, Adaptive Scalarization Methods in Multiobjective Optimiz ation, Vol. 436, Springer, 2008
work page 2008
-
[6]
W. Gearhart, Compromise solutions and estimation of the noninferior set , Journal of Optimization Theory and Applications 28 (1979), pp. 29–47
work page 1979
-
[7]
A.M. Geoffrion, Proper efficiency and the theory of vector maximization , Journal of math- ematical analysis and applications 22 (1968), pp. 618–630
work page 1968
-
[8]
A. Guerraggio, E. Molho, and A. Zaffaroni, On the notion of proper efficiency in vector optimization, Journal of Optimization Theory and Applications 82 (1994), pp. 1– 21
work page 1994
-
[9]
M. Henig, Proper efficiency with respect to cones , Journal of Optimization Theory and Applications 36 (1982), pp. 387–407
work page 1982
-
[10]
J. Hiriart-Urruty, Mean value theorems in nonsmooth analysis , Numerical Functional Analysis and Optimization 2 (1980), pp. 1–30
work page 1980
-
[11]
M. Hirschberger, Connectedness of efficient points in convex and convex transf ormable vector optimization, Optimization 54 (2005), pp. 283–304
work page 2005
-
[12]
Kaliszewski, Soft computing for complex multiple criteria decision maki ng, Vol
I. Kaliszewski, Soft computing for complex multiple criteria decision maki ng, Vol. 85, Springer Science & Business Media, 2006
work page 2006
-
[13]
R. Kasimbeyli, A conic scalarization method in multi-objective optimizat ion, Journal of Global Optimization 56 (2013), pp. 279–297
work page 2013
-
[14]
R. Kasimbeyli, Z.K. Ozturk, N. Kasimbeyli, G.D. Yalcin, and B.I. Erde m, Comparison of some scalarization methods in multiobjective optimizat ion, Bulletin of the Malaysian Mathematical Sciences Society (2017), pp. 1–31
work page 2017
-
[15]
D. Li, Convexification of a noninferior frontier , Journal of Optimization Theory and Applications 88 (1996), pp. 177–196. 15
work page 1996
-
[16]
D.T. Luc, M. Soleimani-damaneh, and M. Zamani, Semi-differentiability of the marginal mapping in vector optimization , SIAM Journal on Optimization 28 (2018), pp. 1255–1281
work page 2018
-
[17]
R.T. Marler and J.S. Arora, Survey of multi-objective optimization methods for engine er- ing, Structural and multidisciplinary optimization 26 (2004), pp. 369–3 95
work page 2004
-
[18]
R.T. Marler and J.S. Arora, Function-transformation methods for multi-objective opt i- mization, Engineering Optimization 37 (2005), pp. 551–570
work page 2005
-
[19]
Miettinen, Nonlinear Multiobjective Optimization, Vol
K. Miettinen, Nonlinear Multiobjective Optimization, Vol. 12, Springer Science & Business Media, 2012
work page 2012
-
[20]
Mordukhovich, Variational Analysis and Applications , Springer, 2018
B.S. Mordukhovich, Variational Analysis and Applications , Springer, 2018
work page 2018
-
[21]
H.E. Romeijn, J.F. Dempsey, and J.G. Li, A unifying framework for multi-criteria fluence map optimization models , Physics in Medicine & Biology 49 (2004), p. 1991
work page 2004
-
[22]
M. Soleimani-damaneh and M. Zamani, On Benson’s scalarization in multiobjective opti- mization, Optimization Letters 10 (2016), pp. 1757–1762
work page 2016
-
[23]
L. Zadeh, Optimality and non-scalar-valued performance criteria , IEEE transactions on Automatic Control 8 (1963), pp. 59–60
work page 1963
-
[24]
M. Zamani, Scalarization and stability in multi-objective optimizat ion, PhD thesis, Avi- gnon University and University of Tehran, 2016
work page 2016
-
[25]
M. Zarepisheh, E. Khorram, and P.M. Pardalos, Generating properly efficient points in multi-objective programs by the nonlinear weighted sum sca larization method , Optimiza- tion 63 (2014), pp. 473–486
work page 2014
-
[26]
M. Zarepisheh and P.M. Pardalos, An equivalent transformation of multi-objective opti- mization problems , Annals of Operations Research 249 (2017), pp. 5–15. 16
work page 2017
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.