A note on fuzzy relation programming problems with max-strict-t-norm composition

Yan Kuen Wu, Sy Ming Guu*

*Corresponding author for this work

Research output: Contribution to journalJournal Article peer-review

46 Scopus citations

Abstract

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.

Original languageEnglish
Pages (from-to)271-278
Number of pages8
JournalFuzzy Optimization and Decision Making
Volume3
Issue number3
DOIs
StatePublished - 09 2004
Externally publishedYes

Keywords

  • Fuzzy optimization
  • Fuzzy relation equations
  • Max-strict-t-norm composition

Fingerprint

Dive into the research topics of 'A note on fuzzy relation programming problems with max-strict-t-norm composition'. Together they form a unique fingerprint.

Cite this