A General Class of Convexification Transformation for the Noninferior Frontier of a Multiobjective Program

A General Class of Convexification Transformation for the Noninferior Frontier of a Multiobjective Program

A general class of convexification transformations is proposed to convexify the noninferior frontier of a multiobjective program. We prove that under certain assumptions the noninferior frontier could be convexified completely or partly after transformation and then weighting method can be applied t...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:American journal of operations research 2013-05, Vol.3 (3), p.387-392
Hauptverfasser: Li, Tao, Wang, Yanjun, Liang, Zhian
Format: Artikel
Sprache:eng
Schlagworte:
Mathematical models
Operations research
Transformations
Weighting methods
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 392
container_issue 3
container_start_page 387
container_title American journal of operations research
container_volume 3
creator Li, Tao
Wang, Yanjun
Liang, Zhian
description A general class of convexification transformations is proposed to convexify the noninferior frontier of a multiobjective program. We prove that under certain assumptions the noninferior frontier could be convexified completely or partly after transformation and then weighting method can be applied to identify the noninferior solutions. Numerical experiments are given to vindicate our results.
doi_str_mv 10.4236/ajor.2013.33036
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1671465328</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1671465328</sourcerecordid><originalsourceid>FETCH-LOGICAL-c1146-4bf52108a03aae5956599cac7cb8e9523df90060beb8a7b5df99a5387ffe219e3</originalsourceid><addsrcrecordid>eNo9kL1PwzAQxS0EElXpzOqRJcWO4yQeq4gWpPIxlDm6mDM4SuxipxX89yQUccu9J727J_0IueZsmaUiv4XWh2XKuFgKwUR-RmYpz1lSlpk6_9eCXZJFjC0bRzKmCjYj7Ypu0GGAjlYdxEi9oZV3R_yyxmoYrHd0F8BF40N_sqOiwwfSJ--sMxjs6NfBu8FimM6BPh66Mdm0qAd7RPoS_HuA_opcGOgiLv72nLyu73bVfbJ93jxUq22iOc_yJGuMTDkrgQkAlErmUikNutBNiUqm4s0oxnLWYFNC0cjRKpCiLIzBlCsUc3Jz-rsP_vOAcah7GzV2HTj0h1jzvBh7pEjLMXp7iurgYwxo6n2wPYTvmrN6AltPYOsJbP0LVvwA05Ztcg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1671465328</pqid></control><display><type>article</type><title>A General Class of Convexification Transformation for the Noninferior Frontier of a Multiobjective Program</title><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><creator>Li, Tao ; Wang, Yanjun ; Liang, Zhian</creator><creatorcontrib>Li, Tao ; Wang, Yanjun ; Liang, Zhian</creatorcontrib><description>A general class of convexification transformations is proposed to convexify the noninferior frontier of a multiobjective program. We prove that under certain assumptions the noninferior frontier could be convexified completely or partly after transformation and then weighting method can be applied to identify the noninferior solutions. Numerical experiments are given to vindicate our results.</description><identifier>ISSN: 2160-8830</identifier><identifier>EISSN: 2160-8849</identifier><identifier>DOI: 10.4236/ajor.2013.33036</identifier><language>eng</language><subject>Mathematical models ; Operations research ; Transformations ; Weighting methods</subject><ispartof>American journal of operations research, 2013-05, Vol.3 (3), p.387-392</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c1146-4bf52108a03aae5956599cac7cb8e9523df90060beb8a7b5df99a5387ffe219e3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,778,782,27907,27908</link.rule.ids></links><search><creatorcontrib>Li, Tao</creatorcontrib><creatorcontrib>Wang, Yanjun</creatorcontrib><creatorcontrib>Liang, Zhian</creatorcontrib><title>A General Class of Convexification Transformation for the Noninferior Frontier of a Multiobjective Program</title><title>American journal of operations research</title><description>A general class of convexification transformations is proposed to convexify the noninferior frontier of a multiobjective program. We prove that under certain assumptions the noninferior frontier could be convexified completely or partly after transformation and then weighting method can be applied to identify the noninferior solutions. Numerical experiments are given to vindicate our results.</description><subject>Mathematical models</subject><subject>Operations research</subject><subject>Transformations</subject><subject>Weighting methods</subject><issn>2160-8830</issn><issn>2160-8849</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><recordid>eNo9kL1PwzAQxS0EElXpzOqRJcWO4yQeq4gWpPIxlDm6mDM4SuxipxX89yQUccu9J727J_0IueZsmaUiv4XWh2XKuFgKwUR-RmYpz1lSlpk6_9eCXZJFjC0bRzKmCjYj7Ypu0GGAjlYdxEi9oZV3R_yyxmoYrHd0F8BF40N_sqOiwwfSJ--sMxjs6NfBu8FimM6BPh66Mdm0qAd7RPoS_HuA_opcGOgiLv72nLyu73bVfbJ93jxUq22iOc_yJGuMTDkrgQkAlErmUikNutBNiUqm4s0oxnLWYFNC0cjRKpCiLIzBlCsUc3Jz-rsP_vOAcah7GzV2HTj0h1jzvBh7pEjLMXp7iurgYwxo6n2wPYTvmrN6AltPYOsJbP0LVvwA05Ztcg</recordid><startdate>20130501</startdate><enddate>20130501</enddate><creator>Li, Tao</creator><creator>Wang, Yanjun</creator><creator>Liang, Zhian</creator><scope>AAYXX</scope><scope>CITATION</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope></search><sort><creationdate>20130501</creationdate><title>A General Class of Convexification Transformation for the Noninferior Frontier of a Multiobjective Program</title><author>Li, Tao ; Wang, Yanjun ; Liang, Zhian</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c1146-4bf52108a03aae5956599cac7cb8e9523df90060beb8a7b5df99a5387ffe219e3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Mathematical models</topic><topic>Operations research</topic><topic>Transformations</topic><topic>Weighting methods</topic><toplevel>online_resources</toplevel><creatorcontrib>Li, Tao</creatorcontrib><creatorcontrib>Wang, Yanjun</creatorcontrib><creatorcontrib>Liang, Zhian</creatorcontrib><collection>CrossRef</collection><collection>Mechanical &amp; Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><jtitle>American journal of operations research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Li, Tao</au><au>Wang, Yanjun</au><au>Liang, Zhian</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A General Class of Convexification Transformation for the Noninferior Frontier of a Multiobjective Program</atitle><jtitle>American journal of operations research</jtitle><date>2013-05-01</date><risdate>2013</risdate><volume>3</volume><issue>3</issue><spage>387</spage><epage>392</epage><pages>387-392</pages><issn>2160-8830</issn><eissn>2160-8849</eissn><abstract>A general class of convexification transformations is proposed to convexify the noninferior frontier of a multiobjective program. We prove that under certain assumptions the noninferior frontier could be convexified completely or partly after transformation and then weighting method can be applied to identify the noninferior solutions. Numerical experiments are given to vindicate our results.</abstract><doi>10.4236/ajor.2013.33036</doi><tpages>6</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 2160-8830
ispartof American journal of operations research, 2013-05, Vol.3 (3), p.387-392
issn 2160-8830
2160-8849
language eng
recordid cdi_proquest_miscellaneous_1671465328
source Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals
subjects Mathematical models
Operations research
Transformations
Weighting methods
title A General Class of Convexification Transformation for the Noninferior Frontier of a Multiobjective Program
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-16T18%3A33%3A18IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20General%20Class%20of%20Convexification%20Transformation%20for%20the%20Noninferior%20Frontier%20of%20a%20Multiobjective%20Program&rft.jtitle=American%20journal%20of%20operations%20research&rft.au=Li,%20Tao&rft.date=2013-05-01&rft.volume=3&rft.issue=3&rft.spage=387&rft.epage=392&rft.pages=387-392&rft.issn=2160-8830&rft.eissn=2160-8849&rft_id=info:doi/10.4236/ajor.2013.33036&rft_dat=%3Cproquest_cross%3E1671465328%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1671465328&rft_id=info:pmid/&rfr_iscdi=true