Loading…
Connectedness properties of the efficient sets and the nondominated sets to vector optimization problems
In this paper we consider vector optimization problems in normed spaces. First, we propose three generalized concepts related to convexity conditions and discuss their relationships with classical ones. Next, based on Hiriart-Urruty oriented distance function, we introduce a new nonlinear scalarizat...
Saved in:
Published in: | Optimization letters 2022-11, Vol.16 (8), p.2457-2468 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | cdi_FETCH-LOGICAL-c291t-a7a41ffc191fb0054e7590a715102ce14f4d348348459d206fa7f20c88eec9e23 |
---|---|
cites | cdi_FETCH-LOGICAL-c291t-a7a41ffc191fb0054e7590a715102ce14f4d348348459d206fa7f20c88eec9e23 |
container_end_page | 2468 |
container_issue | 8 |
container_start_page | 2457 |
container_title | Optimization letters |
container_volume | 16 |
creator | Anh, Lam Quoc Duoc, Pham Thanh Duong, Tran Thi Thuy |
description | In this paper we consider vector optimization problems in normed spaces. First, we propose three generalized concepts related to convexity conditions and discuss their relationships with classical ones. Next, based on Hiriart-Urruty oriented distance function, we introduce a new nonlinear scalarization function for the reference problems and study its properties. Finally, employing this function and the proposed concepts, we address connectedness conditions for efficient and nondominated sets to vector optimization problems. |
doi_str_mv | 10.1007/s11590-021-01841-x |
format | article |
fullrecord | <record><control><sourceid>crossref_sprin</sourceid><recordid>TN_cdi_crossref_primary_10_1007_s11590_021_01841_x</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_1007_s11590_021_01841_x</sourcerecordid><originalsourceid>FETCH-LOGICAL-c291t-a7a41ffc191fb0054e7590a715102ce14f4d348348459d206fa7f20c88eec9e23</originalsourceid><addsrcrecordid>eNp9kM9KAzEQxoMoWKsv4CkvsDqTZru7Ryn-g4IXPYc0O7Ep3aQkUapPb9oVj8LADDPzfcz8GLtGuEGA5jYh1h1UILACbCVW-xM2wXYuKilbOP2rG3HOLlLaAMwRu27C1ovgPZlMvaeU-C6GHcXsKPFgeV4TJ2udceQzT5QT174_tn3wfRic10U5TnLgn8UoRB522Q3uW2cX_MFxtaUhXbIzq7eJrn7zlL093L8unqrly-Pz4m5ZGdFhrnSjJVprsEO7AqglNeUx3WCNIAyhtLKfybaErLtewNzqxgowbUtkOhKzKROjr4khpUhW7aIbdPxSCOrASo2sVGGljqzUvohmoyiVZf9OUW3CR_Tlzv9UP_ZQb58</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Connectedness properties of the efficient sets and the nondominated sets to vector optimization problems</title><source>Springer Nature</source><creator>Anh, Lam Quoc ; Duoc, Pham Thanh ; Duong, Tran Thi Thuy</creator><creatorcontrib>Anh, Lam Quoc ; Duoc, Pham Thanh ; Duong, Tran Thi Thuy</creatorcontrib><description>In this paper we consider vector optimization problems in normed spaces. First, we propose three generalized concepts related to convexity conditions and discuss their relationships with classical ones. Next, based on Hiriart-Urruty oriented distance function, we introduce a new nonlinear scalarization function for the reference problems and study its properties. Finally, employing this function and the proposed concepts, we address connectedness conditions for efficient and nondominated sets to vector optimization problems.</description><identifier>ISSN: 1862-4472</identifier><identifier>EISSN: 1862-4480</identifier><identifier>DOI: 10.1007/s11590-021-01841-x</identifier><language>eng</language><publisher>Berlin/Heidelberg: Springer Berlin Heidelberg</publisher><subject>Computational Intelligence ; Mathematics ; Mathematics and Statistics ; Numerical and Computational Physics ; Operations Research/Decision Theory ; Optimization ; Original Paper ; Simulation</subject><ispartof>Optimization letters, 2022-11, Vol.16 (8), p.2457-2468</ispartof><rights>The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2021</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c291t-a7a41ffc191fb0054e7590a715102ce14f4d348348459d206fa7f20c88eec9e23</citedby><cites>FETCH-LOGICAL-c291t-a7a41ffc191fb0054e7590a715102ce14f4d348348459d206fa7f20c88eec9e23</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Anh, Lam Quoc</creatorcontrib><creatorcontrib>Duoc, Pham Thanh</creatorcontrib><creatorcontrib>Duong, Tran Thi Thuy</creatorcontrib><title>Connectedness properties of the efficient sets and the nondominated sets to vector optimization problems</title><title>Optimization letters</title><addtitle>Optim Lett</addtitle><description>In this paper we consider vector optimization problems in normed spaces. First, we propose three generalized concepts related to convexity conditions and discuss their relationships with classical ones. Next, based on Hiriart-Urruty oriented distance function, we introduce a new nonlinear scalarization function for the reference problems and study its properties. Finally, employing this function and the proposed concepts, we address connectedness conditions for efficient and nondominated sets to vector optimization problems.</description><subject>Computational Intelligence</subject><subject>Mathematics</subject><subject>Mathematics and Statistics</subject><subject>Numerical and Computational Physics</subject><subject>Operations Research/Decision Theory</subject><subject>Optimization</subject><subject>Original Paper</subject><subject>Simulation</subject><issn>1862-4472</issn><issn>1862-4480</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><recordid>eNp9kM9KAzEQxoMoWKsv4CkvsDqTZru7Ryn-g4IXPYc0O7Ep3aQkUapPb9oVj8LADDPzfcz8GLtGuEGA5jYh1h1UILACbCVW-xM2wXYuKilbOP2rG3HOLlLaAMwRu27C1ovgPZlMvaeU-C6GHcXsKPFgeV4TJ2udceQzT5QT174_tn3wfRic10U5TnLgn8UoRB522Q3uW2cX_MFxtaUhXbIzq7eJrn7zlL093L8unqrly-Pz4m5ZGdFhrnSjJVprsEO7AqglNeUx3WCNIAyhtLKfybaErLtewNzqxgowbUtkOhKzKROjr4khpUhW7aIbdPxSCOrASo2sVGGljqzUvohmoyiVZf9OUW3CR_Tlzv9UP_ZQb58</recordid><startdate>20221101</startdate><enddate>20221101</enddate><creator>Anh, Lam Quoc</creator><creator>Duoc, Pham Thanh</creator><creator>Duong, Tran Thi Thuy</creator><general>Springer Berlin Heidelberg</general><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20221101</creationdate><title>Connectedness properties of the efficient sets and the nondominated sets to vector optimization problems</title><author>Anh, Lam Quoc ; Duoc, Pham Thanh ; Duong, Tran Thi Thuy</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c291t-a7a41ffc191fb0054e7590a715102ce14f4d348348459d206fa7f20c88eec9e23</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Computational Intelligence</topic><topic>Mathematics</topic><topic>Mathematics and Statistics</topic><topic>Numerical and Computational Physics</topic><topic>Operations Research/Decision Theory</topic><topic>Optimization</topic><topic>Original Paper</topic><topic>Simulation</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Anh, Lam Quoc</creatorcontrib><creatorcontrib>Duoc, Pham Thanh</creatorcontrib><creatorcontrib>Duong, Tran Thi Thuy</creatorcontrib><collection>CrossRef</collection><jtitle>Optimization letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Anh, Lam Quoc</au><au>Duoc, Pham Thanh</au><au>Duong, Tran Thi Thuy</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Connectedness properties of the efficient sets and the nondominated sets to vector optimization problems</atitle><jtitle>Optimization letters</jtitle><stitle>Optim Lett</stitle><date>2022-11-01</date><risdate>2022</risdate><volume>16</volume><issue>8</issue><spage>2457</spage><epage>2468</epage><pages>2457-2468</pages><issn>1862-4472</issn><eissn>1862-4480</eissn><abstract>In this paper we consider vector optimization problems in normed spaces. First, we propose three generalized concepts related to convexity conditions and discuss their relationships with classical ones. Next, based on Hiriart-Urruty oriented distance function, we introduce a new nonlinear scalarization function for the reference problems and study its properties. Finally, employing this function and the proposed concepts, we address connectedness conditions for efficient and nondominated sets to vector optimization problems.</abstract><cop>Berlin/Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/s11590-021-01841-x</doi><tpages>12</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1862-4472 |
ispartof | Optimization letters, 2022-11, Vol.16 (8), p.2457-2468 |
issn | 1862-4472 1862-4480 |
language | eng |
recordid | cdi_crossref_primary_10_1007_s11590_021_01841_x |
source | Springer Nature |
subjects | Computational Intelligence Mathematics Mathematics and Statistics Numerical and Computational Physics Operations Research/Decision Theory Optimization Original Paper Simulation |
title | Connectedness properties of the efficient sets and the nondominated sets to vector optimization problems |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-25T17%3A19%3A00IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Connectedness%20properties%20of%20the%20efficient%20sets%20and%20the%20nondominated%20sets%20to%20vector%20optimization%20problems&rft.jtitle=Optimization%20letters&rft.au=Anh,%20Lam%20Quoc&rft.date=2022-11-01&rft.volume=16&rft.issue=8&rft.spage=2457&rft.epage=2468&rft.pages=2457-2468&rft.issn=1862-4472&rft.eissn=1862-4480&rft_id=info:doi/10.1007/s11590-021-01841-x&rft_dat=%3Ccrossref_sprin%3E10_1007_s11590_021_01841_x%3C/crossref_sprin%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c291t-a7a41ffc191fb0054e7590a715102ce14f4d348348459d206fa7f20c88eec9e23%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |