A Note on Fuzzy Relation Programming Problems with Max-Strict-t-Norm Composition

The fuzzy relation programming problem is a minimization problem with a linear objective function subject to fuzzy relation equations using certain algebraic compositions. Previously, Guu and Wu considered a fuzzy relation programming problem with max-product composition and provided a necessary con...

Full description

Saved in:
Bibliographic Details
Published inFuzzy optimization and decision making Vol. 3; no. 3; pp. 271 - 278
Main Authors Wu, Yan-Kuen, Guu, Sy-Ming
Format Journal Article
LanguageEnglish
Published New York Springer Nature B.V 01.09.2004
Subjects
Computer programming
Fuzzy logic
Fuzzy sets
Linear programming
Norms
Optimization
Studies
Online AccessGet full text
ISSN1568-4539
1573-2908
DOI10.1023/B:FODM.0000036862.45420.ea

Cover

More Information
Summary:The fuzzy relation programming problem is a minimization problem with a linear objective function subject to fuzzy relation equations using certain algebraic compositions. Previously, Guu and Wu considered a fuzzy relation programming problem with max-product composition and provided a necessary condition for an optimal solution in terms of the maximum solution derived from the fuzzy relation equations. To be more precise, for an optimal solution, each of its components is either 0 or the corresponding component's value of the maximum solution. In this paper, we extend this useful property for fuzzy relation programming problem with max-strict-<t<-norm composition and present it as a supplemental note of our previous work. [PUBLICATION ABSTRACT]
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:1568-4539
1573-2908
DOI:10.1023/B:FODM.0000036862.45420.ea