Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.14365/3947
Title: Computing efficient solutions of nonconvex multi-objective problems via scalarization
Authors: Kasimbeyli R.
Keywords: Cone separation theorem
Conic scalarization method
Multi-objective optimization
Proper efficiency
Sublinear scalarizing functions
Multi objective
Proper efficiency
Scalarization method
Separation theorem
Sublinear
Signal processing
System theory
Theorem proving
Multiobjective optimization
Abstract: This 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.
Description: 11th 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 -- 87580
URI: https://hdl.handle.net/20.500.14365/3947
ISBN: 9.78162E+12
Appears in Collections:Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection

Files in This Item:
File SizeFormat 
2974.pdf
  Restricted Access		288.94 kBAdobe PDFView/Open    Request a copy
Show full item record



CORE Recommender

SCOPUSTM   
Citations

2
checked on Nov 20, 2024

Page view(s)

54
checked on Nov 18, 2024

Google ScholarTM

Check




Altmetric


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.