Epsilon Approximate Solutions for Multiobjective Programming Problems

In this paper, approximate solutions for multiobjective programming problems up to ϵ(>0) are investigated. The concepts of approximate solutions were introduced by White and Loridan. The connections with these concepts are studied. Also, the sufficient and necessary conditions to obtain the eleme...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of mathematical analysis and applications 1996-10, Vol.203 (1), p.142-149
1. Verfasser: Yokoyama, Kazunori
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 149
container_issue 1
container_start_page 142
container_title Journal of mathematical analysis and applications
container_volume 203
creator Yokoyama, Kazunori
description In this paper, approximate solutions for multiobjective programming problems up to ϵ(>0) are investigated. The concepts of approximate solutions were introduced by White and Loridan. The connections with these concepts are studied. Also, the sufficient and necessary conditions to obtain the elements of the smallest approximate solution set are verified.
doi_str_mv 10.1006/jmaa.1996.0371
format Article
fullrecord <record><control><sourceid>elsevier_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1006_jmaa_1996_0371</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0022247X96903716</els_id><sourcerecordid>S0022247X96903716</sourcerecordid><originalsourceid>FETCH-LOGICAL-c355t-80582f5be7c1060a5333fa2bc051e95616d1ebf7049a72eb20172137e47d67ad3</originalsourceid><addsrcrecordid>eNp1kM1LxDAQxYMouK5ePffgtXUmaZr2uCzrBygKKngLaZosWdqmJN1F_3tbVrx5mhl4b-bNj5BrhAwBittdp1SGVVVkwASekAVCVaRQIjslCwBKU5qLz3NyEeMOAJELXJDNZoiu9X2yGobgv1ynRpO8-XY_Ot_HxPqQPO_baah3Ro_uYJLX4LdBdZ3rt3Nft6aLl-TMqjaaq9-6JB93m_f1Q_r0cv-4Xj2lmnE-piXwklpeG6ERClCcMWYVrTVwNBUvsGjQ1FZAXilBTU0BBUUmTC6aQqiGLUl23KuDjzEYK4cwRQ7fEkHOEOQMQc4Q5AxhMtwcDYOKWrU2qF67-OeieSUE0klWHmVmCn9wJsionem1aVyY3paNd_9d-AHts3Bt</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Epsilon Approximate Solutions for Multiobjective Programming Problems</title><source>Elsevier ScienceDirect Journals</source><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><creator>Yokoyama, Kazunori</creator><creatorcontrib>Yokoyama, Kazunori</creatorcontrib><description>In this paper, approximate solutions for multiobjective programming problems up to ϵ(&gt;0) are investigated. The concepts of approximate solutions were introduced by White and Loridan. The connections with these concepts are studied. Also, the sufficient and necessary conditions to obtain the elements of the smallest approximate solution set are verified.</description><identifier>ISSN: 0022-247X</identifier><identifier>EISSN: 1096-0813</identifier><identifier>DOI: 10.1006/jmaa.1996.0371</identifier><identifier>CODEN: JMANAK</identifier><language>eng</language><publisher>San Diego, CA: Elsevier Inc</publisher><subject>Applied sciences ; Exact sciences and technology ; Mathematical programming ; Operational research and scientific management ; Operational research. Management science</subject><ispartof>Journal of mathematical analysis and applications, 1996-10, Vol.203 (1), p.142-149</ispartof><rights>1996 Academic Press</rights><rights>1997 INIST-CNRS</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c355t-80582f5be7c1060a5333fa2bc051e95616d1ebf7049a72eb20172137e47d67ad3</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S0022247X96903716$$EHTML$$P50$$Gelsevier$$Hfree_for_read</linktohtml><link.rule.ids>314,776,780,3537,27901,27902,65306</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=2497712$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Yokoyama, Kazunori</creatorcontrib><title>Epsilon Approximate Solutions for Multiobjective Programming Problems</title><title>Journal of mathematical analysis and applications</title><description>In this paper, approximate solutions for multiobjective programming problems up to ϵ(&gt;0) are investigated. The concepts of approximate solutions were introduced by White and Loridan. The connections with these concepts are studied. Also, the sufficient and necessary conditions to obtain the elements of the smallest approximate solution set are verified.</description><subject>Applied sciences</subject><subject>Exact sciences and technology</subject><subject>Mathematical programming</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><issn>0022-247X</issn><issn>1096-0813</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1996</creationdate><recordtype>article</recordtype><recordid>eNp1kM1LxDAQxYMouK5ePffgtXUmaZr2uCzrBygKKngLaZosWdqmJN1F_3tbVrx5mhl4b-bNj5BrhAwBittdp1SGVVVkwASekAVCVaRQIjslCwBKU5qLz3NyEeMOAJELXJDNZoiu9X2yGobgv1ynRpO8-XY_Ot_HxPqQPO_baah3Ro_uYJLX4LdBdZ3rt3Nft6aLl-TMqjaaq9-6JB93m_f1Q_r0cv-4Xj2lmnE-piXwklpeG6ERClCcMWYVrTVwNBUvsGjQ1FZAXilBTU0BBUUmTC6aQqiGLUl23KuDjzEYK4cwRQ7fEkHOEOQMQc4Q5AxhMtwcDYOKWrU2qF67-OeieSUE0klWHmVmCn9wJsionem1aVyY3paNd_9d-AHts3Bt</recordid><startdate>19961001</startdate><enddate>19961001</enddate><creator>Yokoyama, Kazunori</creator><general>Elsevier Inc</general><general>Elsevier</general><scope>6I.</scope><scope>AAFTH</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>19961001</creationdate><title>Epsilon Approximate Solutions for Multiobjective Programming Problems</title><author>Yokoyama, Kazunori</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c355t-80582f5be7c1060a5333fa2bc051e95616d1ebf7049a72eb20172137e47d67ad3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1996</creationdate><topic>Applied sciences</topic><topic>Exact sciences and technology</topic><topic>Mathematical programming</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Yokoyama, Kazunori</creatorcontrib><collection>ScienceDirect Open Access Titles</collection><collection>Elsevier:ScienceDirect:Open Access</collection><collection>Pascal-Francis</collection><collection>CrossRef</collection><jtitle>Journal of mathematical analysis and applications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Yokoyama, Kazunori</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Epsilon Approximate Solutions for Multiobjective Programming Problems</atitle><jtitle>Journal of mathematical analysis and applications</jtitle><date>1996-10-01</date><risdate>1996</risdate><volume>203</volume><issue>1</issue><spage>142</spage><epage>149</epage><pages>142-149</pages><issn>0022-247X</issn><eissn>1096-0813</eissn><coden>JMANAK</coden><abstract>In this paper, approximate solutions for multiobjective programming problems up to ϵ(&gt;0) are investigated. The concepts of approximate solutions were introduced by White and Loridan. The connections with these concepts are studied. Also, the sufficient and necessary conditions to obtain the elements of the smallest approximate solution set are verified.</abstract><cop>San Diego, CA</cop><pub>Elsevier Inc</pub><doi>10.1006/jmaa.1996.0371</doi><tpages>8</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0022-247X
ispartof Journal of mathematical analysis and applications, 1996-10, Vol.203 (1), p.142-149
issn 0022-247X
1096-0813
language eng
recordid cdi_crossref_primary_10_1006_jmaa_1996_0371
source Elsevier ScienceDirect Journals; Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals
subjects Applied sciences
Exact sciences and technology
Mathematical programming
Operational research and scientific management
Operational research. Management science
title Epsilon Approximate Solutions for Multiobjective Programming Problems
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-03T04%3A43%3A34IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-elsevier_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Epsilon%20Approximate%20Solutions%20for%20Multiobjective%20Programming%20Problems&rft.jtitle=Journal%20of%20mathematical%20analysis%20and%20applications&rft.au=Yokoyama,%20Kazunori&rft.date=1996-10-01&rft.volume=203&rft.issue=1&rft.spage=142&rft.epage=149&rft.pages=142-149&rft.issn=0022-247X&rft.eissn=1096-0813&rft.coden=JMANAK&rft_id=info:doi/10.1006/jmaa.1996.0371&rft_dat=%3Celsevier_cross%3ES0022247X96903716%3C/elsevier_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_els_id=S0022247X96903716&rfr_iscdi=true