Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.14365/3947
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kasimbeyli R. | - |
dc.date.accessioned | 2023-06-16T15:06:28Z | - |
dc.date.available | 2023-06-16T15:06:28Z | - |
dc.date.issued | 2011 | - |
dc.identifier.isbn | 9.78162E+12 | - |
dc.identifier.uri | https://hdl.handle.net/20.500.14365/3947 | - |
dc.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 | en_US |
dc.description.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. | en_US |
dc.language.iso | en | en_US |
dc.relation.ispartof | Recent Advances in Signal Processing, Computational Geometry and Systems Theory - ISCGAV'11, ISTASC'11 | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | Cone separation theorem | en_US |
dc.subject | Conic scalarization method | en_US |
dc.subject | Multi-objective optimization | en_US |
dc.subject | Proper efficiency | en_US |
dc.subject | Sublinear scalarizing functions | en_US |
dc.subject | Multi objective | en_US |
dc.subject | Proper efficiency | en_US |
dc.subject | Scalarization method | en_US |
dc.subject | Separation theorem | en_US |
dc.subject | Sublinear | en_US |
dc.subject | Signal processing | en_US |
dc.subject | System theory | en_US |
dc.subject | Theorem proving | en_US |
dc.subject | Multiobjective optimization | en_US |
dc.title | Computing efficient solutions of nonconvex multi-objective problems via scalarization | en_US |
dc.type | Conference Object | en_US |
dc.identifier.scopus | 2-s2.0-82655164326 | en_US |
dc.authorscopusid | 35146065000 | - |
dc.identifier.startpage | 193 | en_US |
dc.identifier.endpage | 198 | en_US |
dc.relation.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
dc.identifier.scopusquality | N/A | - |
dc.identifier.wosquality | N/A | - |
item.grantfulltext | reserved | - |
item.openairetype | Conference Object | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.fulltext | With Fulltext | - |
item.languageiso639-1 | en | - |
item.cerifentitytype | Publications | - |
crisitem.author.dept | 05.09. Industrial Engineering | - |
Appears in Collections: | Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection |
Files in This Item:
File | Size | Format | |
---|---|---|---|
2974.pdf Restricted Access | 288.94 kB | Adobe PDF | View/Open Request a copy |
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.