Tractability of convex vector optimization problems in the sense of polyhedral approximations

Simple item page
buir.contributor.authorUlus, Firdevs
dc.citation.epage742en_US
dc.citation.issueNumber4en_US
dc.citation.spage731en_US
dc.citation.volumeNumber72en_US
dc.contributor.authorUlus, Firdevsen_US
dc.date.accessioned2019-02-21T16:10:28Z
dc.date.available2019-02-21T16:10:28Z
dc.date.issued2018en_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.description.abstractThere are different solution concepts for convex vector optimization problems (CVOPs) and a recent one, which is motivated from a set optimization point of view, consists of finitely many efficient solutions that generate polyhedral inner and outer approximations to the Pareto frontier. A CVOP with compact feasible region is known to be bounded and there exists a solution of this sense to it. However, it is not known if it is possible to generate polyhedral inner and outer approximations to the Pareto frontier of a CVOP if the feasible region is not compact. This study shows that not all CVOPs are tractable in that sense and gives a characterization of tractable problems in terms of the well known weighted sum scalarization problems.
dc.identifier.doi10.1007/s10898-018-0666-6
dc.identifier.issn0925-5001
dc.identifier.urihttp://hdl.handle.net/11693/50506
dc.language.isoEnglish
dc.publisherSpringer New York LLC
dc.relation.isversionofhttps://doi.org/10.1007/s10898-018-0666-6
dc.source.titleJournal of Global Optimizationen_US
dc.subjectConvex programmingen_US
dc.subjectMultiobjective optimizationen_US
dc.subjectPolyhedral approximationen_US
dc.subjectVector optimizationen_US
dc.titleTractability of convex vector optimization problems in the sense of polyhedral approximationsen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Tractability_of_convex_vector_optimization_problems_in_the_sense_of_polyhedral_approximations.pdf
Size:
474.91 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Department of Industrial Engineering