Kasimbeyli R.2023-06-162023-06-1620119.78E+12https://hdl.handle.net/20.500.14365/394711th WSEAS International Conference on Signal Processing, Computational Geometry and Artificial Vision, ISCGAV'11, 11th WSEAS International Conference on Systems Theory and Scientific Computation, ISTASC'11 -- 23 August 2011 through 25 August 2011 -- Florence -- 87580This paper presents a new method for scalarization of nonlinear multi-objective optimization problems. We introduce a special class of monotonically increasing sublinear scalarizing functions and show that the scalar optimization problem constructed by using these functions, enables to compute complete set of weakly efficient, efficient, and properly efficient solutions of multi-objective optimization problems without convexity and bound-edness conditions.eninfo:eu-repo/semantics/closedAccessCone separation theoremConic scalarization methodMulti-objective optimizationProper efficiencySublinear scalarizing functionsMulti objectiveProper efficiencyScalarization methodSeparation theoremSublinearSignal processingSystem theoryTheorem provingMultiobjective optimizationConference Object2-s2.0-82655164326