Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/93289
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Applied Mathematics | en_US |
dc.creator | Zheng, XY | en_US |
dc.creator | Yang, X | en_US |
dc.date.accessioned | 2022-06-15T03:42:38Z | - |
dc.date.available | 2022-06-15T03:42:38Z | - |
dc.identifier.issn | 0022-3239 | en_US |
dc.identifier.uri | http://hdl.handle.net/10397/93289 | - |
dc.language.iso | en | en_US |
dc.publisher | Springer | en_US |
dc.rights | © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021 | en_US |
dc.rights | This version of the article has been accepted for publication, after peer review (when applicable) and is subject to Springer Nature’s AM terms of use(https://www.springernature.com/gp/open-research/policies/accepted-manuscript-terms), but is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: http://dx.doi.org/10.1007/s10957-021-01889-w | en_US |
dc.subject | Pareto solution | en_US |
dc.subject | Piecewise linear function | en_US |
dc.subject | Polyhedron | en_US |
dc.subject | Weak Pareto solution | en_US |
dc.title | Fully piecewise linear vector optimization problems | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.spage | 461 | en_US |
dc.identifier.epage | 490 | en_US |
dc.identifier.volume | 190 | en_US |
dc.identifier.issue | 2 | en_US |
dc.identifier.doi | 10.1007/s10957-021-01889-w | en_US |
dcterms.abstract | We distinguish two kinds of piecewise linear functions and provide an interesting representation for a piecewise linear function between two normed spaces. Based on such a representation, we study a fully piecewise linear vector optimization problem with the objective and constraint functions being piecewise linear. To solve this problem, we divide it into some linear subproblems and structure a dimensional reduction method. Under some mild assumptions, we prove that its Pareto (resp., weak Pareto) solution set is the union of finitely many generalized polyhedra (resp., polyhedra), each of which is contained in a Pareto (resp., weak Pareto) face of some linear subproblem. Our main results are even new in the linear case and further generalize Arrow, Barankin and Blackwell’s classical results on linear vector optimization problems in the framework of finite-dimensional spaces. | en_US |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | Journal of optimization theory and applications, Aug. 2021, v. 190, no. 2, p. 461-490 | en_US |
dcterms.isPartOf | Journal of optimization theory and applications | en_US |
dcterms.issued | 2021-08 | - |
dc.identifier.scopus | 2-s2.0-85109318331 | - |
dc.identifier.eissn | 1573-2878 | en_US |
dc.description.validate | 202206 bcfc | en_US |
dc.description.oa | Accepted Manuscript | en_US |
dc.identifier.FolderNumber | AMA-0021 | - |
dc.description.fundingSource | RGC | en_US |
dc.description.pubStatus | Published | en_US |
dc.identifier.OPUS | 54285391 | - |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Yang_Fully_Piecewise_Linear.pdf | Pre-Published version | 242.12 kB | Adobe PDF | View/Open |
Page views
35
Last Week
0
0
Last month
Citations as of May 19, 2024
Downloads
41
Citations as of May 19, 2024
SCOPUSTM
Citations
1
Citations as of May 16, 2024
WEB OF SCIENCETM
Citations
1
Citations as of May 16, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.