Method for solving quasi-concave and non-concave fuzzy multi-objective programming problems
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
227 | en_US |
dc.citation.issue |
2 | en_US |
dc.citation.spage |
205 | en_US |
dc.citation.volume |
122 | en_US |
dc.citation.woscount |
3 | |
dc.contributor.author |
Yu, CS | en_US |
dc.contributor.author |
Li, HL | en_US |
dc.contributor.department |
資訊管理與財務金融系 註:原資管所+財金所 | zh_TW |
dc.contributor.department |
Department of Information Management and Finance | en_US |
dc.date.accessioned |
2014-12-08T15:43:28Z | |
dc.date.available |
2014-12-08T15:43:28Z | |
dc.date.issued |
2001-09-01 | en_US |
dc.description.abstract |
This paper proposes a method based on linear programming techniques to treat quasi-concave and non-concave fuzzy multi-objective programming (FMOP) problems. The proposed method initially presents a piecewise linear expression to interpreting a quasi-concave membership function. Then we find the convex-type break points acid transform all quasi-concave membership functions into concave functions. After that, the converted program is solved by linear programming techniques to obtain a global optimum. Tn addition to not containing any of the zero-one variables, the proposed method does not require dividing the quasi-concave FMOP problem into large sub-problems as in conventional methods. The extension of the proposed method can treat general non-concave FMOP problems by merely adding less number of zero-one variables. (C) 2001 Elsevier Science B.V. All rights reserved. | en_US |
dc.identifier.doi |
10.1016/S0165-0114(99)00163-3 | en_US |
dc.identifier.issn |
0165-0114 | en_US |
dc.identifier.journal |
FUZZY SETS AND SYSTEMS | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1016/S0165-0114(99)00163-3 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/29428 | |
dc.identifier.wosnumber |
WOS:000169833200003 | |
dc.language.iso |
en_US | en_US |
dc.subject |
fuzzy multi-objective programming | en_US |
dc.subject |
linear programming | en_US |
dc.subject |
non-concave | en_US |
dc.subject |
piecewise | en_US |
dc.title |
Method for solving quasi-concave and non-concave fuzzy multi-objective programming problems | en_US |
dc.type |
Article | en_US |
檔案
- 000169833200003.pdf (345.2 KB, Adobe PDF)
所屬典藏: 期刊論文