Eintrag weiter verarbeiten
Online-Ressource

Solving multiple objective quasi‐convex goal programming problems by linear programming

Gespeichert in:

Bibliographische Detailangaben
Zeitschriftentitel: International Transactions in Operational Research
Personen und Körperschaften: Li, H‐L., Yu, C‐S.
In: International Transactions in Operational Research, 7, 2000, 3, S. 265-284
Format: E-Article
Sprache: Englisch
veröffentlicht:
Wiley
Schlagwörter:
Management of Technology and Innovation
Management Science and Operations Research
Strategy and Management
Computer Science Applications
Business and International Management
author_facet Li, H‐L.
Yu, C‐S.
Li, H‐L.
Yu, C‐S.
author Li, H‐L.
Yu, C‐S.
spellingShingle Li, H‐L.
Yu, C‐S.
International Transactions in Operational Research
Solving multiple objective quasi‐convex goal programming problems by linear programming
Management of Technology and Innovation
Management Science and Operations Research
Strategy and Management
Computer Science Applications
Business and International Management
author_sort li, h‐l.
spelling Li, H‐L. Yu, C‐S. 0969-6016 1475-3995 Wiley Management of Technology and Innovation Management Science and Operations Research Strategy and Management Computer Science Applications Business and International Management http://dx.doi.org/10.1111/j.1475-3995.2000.tb00198.x <jats:title>Abstract</jats:title><jats:p>This study presents a novel means of resolving multiple objective goal programming (GP) problems with quasi‐convex linear penalty functions. The proposed method initially expresses a quasi‐convex function by the maximum operator of two convex functions, then solves it via a linear programming technique. The proposed method does not contain any zero–one variables; nor does it require dividing the multi‐objective quasi‐convex GP problem into large sub‐problems as in conventional methods. Some illustrative examples are provided.</jats:p> Solving multiple objective quasi‐convex goal programming problems by linear programming International Transactions in Operational Research
doi_str_mv 10.1111/j.1475-3995.2000.tb00198.x
facet_avail Online
finc_class_facet Wirtschaftswissenschaften
Informatik
format ElectronicArticle
fullrecord blob:ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTExMS9qLjE0NzUtMzk5NS4yMDAwLnRiMDAxOTgueA
id ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTExMS9qLjE0NzUtMzk5NS4yMDAwLnRiMDAxOTgueA
institution DE-Gla1
DE-Zi4
DE-15
DE-Pl11
DE-Rs1
DE-105
DE-14
DE-Ch1
DE-L229
DE-D275
DE-Bn3
DE-Brt1
DE-D161
imprint Wiley, 2000
imprint_str_mv Wiley, 2000
issn 0969-6016
1475-3995
issn_str_mv 0969-6016
1475-3995
language English
mega_collection Wiley (CrossRef)
match_str li2000solvingmultipleobjectivequasiconvexgoalprogrammingproblemsbylinearprogramming
publishDateSort 2000
publisher Wiley
recordtype ai
record_format ai
series International Transactions in Operational Research
source_id 49
title Solving multiple objective quasi‐convex goal programming problems by linear programming
title_unstemmed Solving multiple objective quasi‐convex goal programming problems by linear programming
title_full Solving multiple objective quasi‐convex goal programming problems by linear programming
title_fullStr Solving multiple objective quasi‐convex goal programming problems by linear programming
title_full_unstemmed Solving multiple objective quasi‐convex goal programming problems by linear programming
title_short Solving multiple objective quasi‐convex goal programming problems by linear programming
title_sort solving multiple objective quasi‐convex goal programming problems by linear programming
topic Management of Technology and Innovation
Management Science and Operations Research
Strategy and Management
Computer Science Applications
Business and International Management
url http://dx.doi.org/10.1111/j.1475-3995.2000.tb00198.x
publishDate 2000
physical 265-284
description <jats:title>Abstract</jats:title><jats:p>This study presents a novel means of resolving multiple objective goal programming (GP) problems with quasi‐convex linear penalty functions. The proposed method initially expresses a quasi‐convex function by the maximum operator of two convex functions, then solves it via a linear programming technique. The proposed method does not contain any zero–one variables; nor does it require dividing the multi‐objective quasi‐convex GP problem into large sub‐problems as in conventional methods. Some illustrative examples are provided.</jats:p>
container_issue 3
container_start_page 265
container_title International Transactions in Operational Research
container_volume 7
format_de105 Article, E-Article
format_de14 Article, E-Article
format_de15 Article, E-Article
format_de520 Article, E-Article
format_de540 Article, E-Article
format_dech1 Article, E-Article
format_ded117 Article, E-Article
format_degla1 E-Article
format_del152 Buch
format_del189 Article, E-Article
format_dezi4 Article
format_dezwi2 Article, E-Article
format_finc Article, E-Article
format_nrw Article, E-Article
_version_ 1792337276420751363
geogr_code not assigned
last_indexed 2024-03-01T15:13:45.959Z
geogr_code_person not assigned
openURL url_ver=Z39.88-2004&ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fvufind.svn.sourceforge.net%3Agenerator&rft.title=Solving+multiple+objective+quasi%E2%80%90convex+goal+programming+problems+by+linear+programming&rft.date=2000-05-01&genre=article&issn=1475-3995&volume=7&issue=3&spage=265&epage=284&pages=265-284&jtitle=International+Transactions+in+Operational+Research&atitle=Solving+multiple+objective+quasi%E2%80%90convex+goal+programming+problems+by+linear+programming&aulast=Yu&aufirst=C%E2%80%90S.&rft_id=info%3Adoi%2F10.1111%2Fj.1475-3995.2000.tb00198.x&rft.language%5B0%5D=eng
SOLR
_version_ 1792337276420751363
author Li, H‐L., Yu, C‐S.
author_facet Li, H‐L., Yu, C‐S., Li, H‐L., Yu, C‐S.
author_sort li, h‐l.
container_issue 3
container_start_page 265
container_title International Transactions in Operational Research
container_volume 7
description <jats:title>Abstract</jats:title><jats:p>This study presents a novel means of resolving multiple objective goal programming (GP) problems with quasi‐convex linear penalty functions. The proposed method initially expresses a quasi‐convex function by the maximum operator of two convex functions, then solves it via a linear programming technique. The proposed method does not contain any zero–one variables; nor does it require dividing the multi‐objective quasi‐convex GP problem into large sub‐problems as in conventional methods. Some illustrative examples are provided.</jats:p>
doi_str_mv 10.1111/j.1475-3995.2000.tb00198.x
facet_avail Online
finc_class_facet Wirtschaftswissenschaften, Informatik
format ElectronicArticle
format_de105 Article, E-Article
format_de14 Article, E-Article
format_de15 Article, E-Article
format_de520 Article, E-Article
format_de540 Article, E-Article
format_dech1 Article, E-Article
format_ded117 Article, E-Article
format_degla1 E-Article
format_del152 Buch
format_del189 Article, E-Article
format_dezi4 Article
format_dezwi2 Article, E-Article
format_finc Article, E-Article
format_nrw Article, E-Article
geogr_code not assigned
geogr_code_person not assigned
id ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTExMS9qLjE0NzUtMzk5NS4yMDAwLnRiMDAxOTgueA
imprint Wiley, 2000
imprint_str_mv Wiley, 2000
institution DE-Gla1, DE-Zi4, DE-15, DE-Pl11, DE-Rs1, DE-105, DE-14, DE-Ch1, DE-L229, DE-D275, DE-Bn3, DE-Brt1, DE-D161
issn 0969-6016, 1475-3995
issn_str_mv 0969-6016, 1475-3995
language English
last_indexed 2024-03-01T15:13:45.959Z
match_str li2000solvingmultipleobjectivequasiconvexgoalprogrammingproblemsbylinearprogramming
mega_collection Wiley (CrossRef)
physical 265-284
publishDate 2000
publishDateSort 2000
publisher Wiley
record_format ai
recordtype ai
series International Transactions in Operational Research
source_id 49
spelling Li, H‐L. Yu, C‐S. 0969-6016 1475-3995 Wiley Management of Technology and Innovation Management Science and Operations Research Strategy and Management Computer Science Applications Business and International Management http://dx.doi.org/10.1111/j.1475-3995.2000.tb00198.x <jats:title>Abstract</jats:title><jats:p>This study presents a novel means of resolving multiple objective goal programming (GP) problems with quasi‐convex linear penalty functions. The proposed method initially expresses a quasi‐convex function by the maximum operator of two convex functions, then solves it via a linear programming technique. The proposed method does not contain any zero–one variables; nor does it require dividing the multi‐objective quasi‐convex GP problem into large sub‐problems as in conventional methods. Some illustrative examples are provided.</jats:p> Solving multiple objective quasi‐convex goal programming problems by linear programming International Transactions in Operational Research
spellingShingle Li, H‐L., Yu, C‐S., International Transactions in Operational Research, Solving multiple objective quasi‐convex goal programming problems by linear programming, Management of Technology and Innovation, Management Science and Operations Research, Strategy and Management, Computer Science Applications, Business and International Management
title Solving multiple objective quasi‐convex goal programming problems by linear programming
title_full Solving multiple objective quasi‐convex goal programming problems by linear programming
title_fullStr Solving multiple objective quasi‐convex goal programming problems by linear programming
title_full_unstemmed Solving multiple objective quasi‐convex goal programming problems by linear programming
title_short Solving multiple objective quasi‐convex goal programming problems by linear programming
title_sort solving multiple objective quasi‐convex goal programming problems by linear programming
title_unstemmed Solving multiple objective quasi‐convex goal programming problems by linear programming
topic Management of Technology and Innovation, Management Science and Operations Research, Strategy and Management, Computer Science Applications, Business and International Management
url http://dx.doi.org/10.1111/j.1475-3995.2000.tb00198.x