Fuzzy Logic

by
Dr. Jitender Kumar
Assistant Professor
Department of Computer Science & Engineering
DEENBANDHU CHHOTU RAM UNIVERSITY OF SCIENCE
& TECHNOLOGY
MURTHAL, SONEPAT
SOFT COMPUTING
 Soft
computing differs from conventional (hard)
computing as it is tolerant to imprecision,
uncertainty, partial truth, and approximation.

 In
effect, the role model for soft computing is the
human mind.
SOFT COMPUTING IS A TOLERANCE
FOR
 Imprecision

 Uncertainty

 Partial
truth
 Approximation

 To achieve tractability, robustness and low

cost solution.
SOFT COMPUTING
 Soft
computing is used as an umbrella term for
sub-disciplines of computing including:
 Fuzzy logic and fuzzy control
 Neuralnetworks based computing and machine
learning
 Genetic algorithms and evolutionary algorithms
TRADITIONAL REPRESENTATION OF
LOGIC

Slow Speed = Fast Speed =

0 bool speed; 1
get the speed
if ( speed == 0) {
// speed is slow
}
else {
// speed is fast
}
FUZZY
 “Fuzzy – “not clear, or imprecise; blurred”.
 If ‘Tall Person” is a set defined as heights equal to or

greater than 6 feet.

 A computer would not recognize an individual of height

5’11 . 999 as being a member of the set ‘‘Tall.’’

 But how do we assess the uncertainty in the following

question: Is the person nearly 6 feet tall? The uncertainty

in this case is due to the vagueness or ambiguity of the
adjective nearly .
 A 5’11.999 person could clearly be a member of the set

of ‘‘nearly 6 feet tall’’

FUZZY LOGIC

 Fuzzy Logic (FL) is a method of reasoning that

resembles human reasoning which involves all
intermediate possibilities between digital values YES
and NO.

 Fuzzy Logic System (FLS) produces acceptable but

definite output in response to: incomplete, ambiguous
and distorted or inaccurate (fuzzy) input.
POSSIBILITIES BETWEEN YES AND NO
FUZZY LOGIC

 First introduced by Lotfi Abdelli Zadeh in

1965, at University of California, Berkley,
USA.

 Fuzzy logic is mathematical tool for dealing

with uncertainty.

 The close one looks at a real world problem,

the fuzzier becomes its solution.
SAMPLE FUZZY LOGIC
REPRESENTATION
Slowest float speed;
get the speed
[ 0.0 – 0.25 ] if ((speed >= 0.0)&&(speed < 0.25)) {
// speed is slowest
}
else if ((speed >= 0.25)&&(speed < 0.5))
Slow {
// speed is slow
[ 0.25 – 0.50 }
else if ((speed >= 0.5)&&(speed < 0.75))
] {
// speed is fast
Fast }
[ 0.50 – 0.75 ] else // speed >= 0.75 && speed < 1.0
{
// speed is fastest
}
Fasted
[ 0.75 – 1.00 ]
FUZZY LOGIC IMPLEMENTATION

 It can be implemented in systems with various sizes and

capabilities ranging from small micro-controllers to
large, networked, workstation-based control systems.

 It can be implemented in hardware, software, or a

combination of both.
FUZZY LOGIC SYSTEMS
ARCHITECTURE
FUZZY LOGIC SYSTEMS
ARCHITECTURE
Fuzzification Module − It
transforms the system inputs,
which are crisp numbers, into
fuzzy sets e.g.
FUZZY LOGIC SYSTEMS
ARCHITECTURE
 Knowledge Base − It stores IF-
THEN rules provided by experts.
 Inference Engine − It simulates
the human reasoning process by
making fuzzy inference on the
inputs and IF-THEN rules.
 Defuzzification Module − It
transforms the fuzzy set obtained
by the inference engine into a
crisp value.
CLASSICAL (CRISP) VS FUZZY SETS
 Classical set theory (Fig. a)
 An object is either in or not in the set
 Fuzzy set theory (Fig. b)
 An object is in a set by matter of degree
 1.0 => in the set
 0.0 => not in the set
 0.0 < object < 1.0 => partially in the set
CRISP SETS NOTATIONS
OPERATIONS ON CRISP SETS
PROPERTIES OF CLASSICAL (CRISP)
SETS
PROPERTIES OF CLASSICAL (CRISP)
SETS
SPECIAL OPERATIONS ON CRISP SETS
SPECIAL OPERATIONS ON CRISP SETS
DE MORGAN’S LAW

De Morgan’s Law for “n” sets

DE MORGAN’S LAW
DE MORGAN’S LAW
MAPPING OF CRISP SETS TO
FUNCTIONS
 It is used to map elements or subsets on one
universe of discourse to elements or sets in
another universe.

 Suppose X and Y are two different universes

of discourse (information). If an element “x”
is contained in X and corresponds to an
element “y” contained in Y , it is generally
termed a mapping from X to Y, or f :X→Y.
MAPPING OF CRISP SETS TO
FUNCTIONS

As a mapping, the characteristic (indicator) function χ A is

defined by:

Where χA expresses membership in set A for the element x

in the universe.
FUNCTION THEORETIC NOTATIONS
FUZZY SETS
 A fuzzy set is a set containing elements that have
varying degrees of membership in the set.

 Elements of a fuzzy set are also mapped to a

universe of membership values using a function-
theoretic form. If an element in the universe, say x,
is a member of fuzzy set A, then this mapping is
given by:
FUZZY SET EXAMPLE
CRISP SETS VS FUZZY SETS
CRISP SETS VS FUZZY SETS
CRISP SETS VS FUZZY SETS
EXAMPLE: COURSE EVALUATION IN A CRISP SET
EXAMPLE: COURSE EVALUATION IN A FUZZY SET
NOTATION OF FUZZY SETS
When the universe of discourse is discrete and finite
i.e. function theoretic union:

When the universe of discourse is continuous and infinite:

FUZZY SET OPERATIONS
FUZZY SET OPERATIONS

Union of two sets

Intersection of two sets

FUZZY SET OPERATIONS

Complement of set A
PROPERTIES OF FUZZY SETS
PROPERTIES OF FUZZY SETS
EXAMPLE ON FUZZY SET OPERATIONS
EXAMPLE ON FUZZY SET OPERATIONS
EXAMPLE ON FUZZY SET OPERATIONS
EXAMPLE ON FUZZY SET OPERATIONS
EXAMPLE ON FUZZY SET OPERATIONS
EXAMPLE ON FUZZY SET OPERATIONS
EXAMPLE ON FUZZY SET OPERATIONS
FUZZY/CRISP SET RELATIONS
 Relations represent mappings between sets and
connectives in logic.
 A classical binary relation represents the presence or
absence of a connection or interaction or association
between the elements of two sets.
 Fuzzy binary relations are a generalization of crisp
binary relations, and they allow various degrees of
relationship (association) between elements.
CARTESIAN PRODUCT ON CRISP SETS

i.e. Ordered Pairs e.g. if A = {0, 1} and B = {a, b, c}

CRISP SET RELATIONS
 A subset of the Cartesian product A1 × A2
×···×A r is called an r-ary relation over A1,
A2,...,Ar.
 Binary Relation from A1 into A2: The most
common case is for r = 2; in this situation the
relation is a subset of the Cartesian product A1
× A2 (i.e., a set of pairs, the first coordinate of
which is from A1 and the second from A2).
 Ternary Relation: if r = 3
 Quaternary Relation: if r = 4

STRENGTH OF CRISP SET RELATIONS

1 means complete relationship

0 mean no relationship
FUZZY RELATIONS
 Fuzzy relations also map elements of one universe, say
X, to those of another universe, say Y, through the
Cartesian product of the two universes.

 However, the ‘‘strength’’ of the relation between ordered

pairs of the two universes is measured with a
membership function expressing various ‘‘degrees’’ of
strength of the relation on the unit interval [0,1].
FUZZY RELATIONS
 Binary Relation from A1 into A2: The most
common case is for r = 2; in this situation the
relation is a subset of the Cartesian product
A1 × A2 (i.e., a set of pairs, the first
coordinate of which is from A1 and the
second from A2).
 Ternary Relation: if r = 3
 Quaternary Relation: if r = 4
 Quinary Relation: if r = 5
FUZZY BINARY RELATIONSHIP
REPRESENTATION
FUZZY BINARY RELATION EXAMPLE
FUZZY CARTESIAN PRODUCT
 Fuzzy relations in general are essentially
fuzzy sets.
 Let A be a fuzzy set on universe X and B be a

fuzzy set on universe Y; then the Cartesian

product between fuzzy sets A and B will
result in a fuzzy relation R which is contained
within the full Cartesian product space i.e.
 A x B = R⊂X x Y

 Where the fuzzy relation “R” has membership

function:
FUZZY CARTESIAN PRODUCT
OPERATIONS ON FUZZY RELATIONS
FUZZY COMPOSITION OF RELATIONS
 Combining two or more sets based on a specific rule or
operation.

 If you have a relation R from set A to set B, and another

relation S from set B to set C, their composition, denoted
as S∘R (or sometimes R∘S), is a relation from A to C.
FUZZY COMPOSITION OF RELATIONS

Max-Min Composition

Use Row of R
Column of S
FUZZY COMPOSITION OF RELATIONS

Max-Product Composition

Use Row of R
Column of S
FUZZY MEMBERSHIP FUNCTIONS
FUZZY MEMBERSHIP FUNCTIONS
(MFS)
 MFs defines the fuzziness in a fuzzy set irrespective of
the elements in the set, which are discrete or continuous.

 MFs allow to quantify linguistic term and represent a

fuzzy set graphically.

defined as: 𝜇A:X⤍[0, 1].

 A MF for a fuzzy set A on the universe of discourse X is
 FUZZY MEMBERSHIP TYPES

i.e. 𝜇A(x)⤍1.
 Core: Complete or full membership

non-Zero membership i.e. 𝜇A(x)>0.

 Support: Region Characterized by

 Boundary: Region Characterized by

membership i.e. 0<𝜇A(x)<1.

non-Zero and not complete
FUZZY MEMBERSHIP FUNCTIONS
(MFS)
TRIANGULAR MEMBERSHIP
FUNCTIONS
TRAPEZOIDAL MEMBERSHIP
FUNCTIONS
GAUSSIAN MEMBERSHIP FUNCTIONS

“c” is mean and defines the peak of the bell curve

“𝜎 ” is standard deviation and determines the spread of the curve
GENERALIZED BELL MEMBERSHIP
FUNCTIONS

x: The input value.

a: Controls the width of the membership function. A larger 'a' results in a
wider function.
b: Controls the steepness of the slopes. A larger 'b' results in a more abrupt
transition.
c: Controls the center of the function
METHODS OF MEMBERSHIP
ASSIGNMENT
 Intuition (based on common human intelligence)
 Inference (based on expert knowledge)
 Rank Ordering
 Neural Networks
 Genetic Algorithms
 Inductive Reasoning (backward inference)
Fuzzy Rules and Reasoning
FUZZY RULES
 For extending the reasoning capability, fuzzy
logic uses:

 Fuzzy predicates

 Fuzzy-predicate modifiers

 Fuzzy quantifiers

 Fuzzy qualifiers
CLASSICAL LOGIC
 A simple proposition “P” is a linguistic, or declarative,
statement contained within a universe of elements, say
X, that can be identified as being a collection of
elements in X that are strictly true or strictly false.

 Hence, a proposition P is a collection of elements, i.e., a

set, where the truth values for all elements in the set are
either all true or all false.
CLASSICAL LOGIC
 For binary (Boolean) classical logic, T(P) is assigned a
value of 1 (truth) or 0 (false).

 If U is the universe of all propositions, then T is a

mapping of the elements, u , in these propositions (sets)
to the binary quantities ( 0, 1), or
LOGICAL CONNECTIVES FOR
PROPOSITIONS
 Disjunction (V) “X” OR “Y”

 Conjunction (Λ) “X” AND “Y”

 Negation (–) Ӯ

 Implication (⤍) IF “X” THEN “Y”

(X ⤍Y) AND (Y ⤍X), THEN X ↔Y

 Equivalence (↔) “X” IF AND ONLY IF “Y”
LOGICAL CONNECTIVES FOR
PROPOSITIONS
LOGICAL CONNECTIVES FOR
PROPOSITIONS
If “x” student is meritorious, then he is hardworking student
IMPLICATION EXAMPLE

First three Propositions are True, and 4th is False ?

In the first two, conclusion 4>0 is true, regardless of the truth
of hypothesis.

In 3rd case, both propositions are false but it does not disprove
the implication.

In 4th case, a true hypothesis can not produce a false

conclusion.
IMPLICATION IN SET THEORETIC
NOTATION

This expression is linguistically equivalent to the statement,

“P →Q is true” when either ‘‘not A’’ or ‘‘B’’ is true (i.e.
logical or).
LOGICAL CONNECTIVES EXAMPLE
TAUTOLOGIES
 Compound propositions that are always true, irrespective
of the truth values of the individual simple propositions.
 Tautologies are useful for deductive reasoning, for
proving theorems, and for making deductive inferences.
 Inference schemes in expert systems often employ
tautologies because tautologies are formulas that are true
on logical grounds alone.
 For example, if A is the set of all prime numbers (A1 = 1,
A2 = 2, A3 = 3, A4 = 5, ...) on the real line universe, X,
then the proposition ‘ ‘Ai is not divisible b y 6 ’’ is a
tautology.
SOME COMMON TAUTOLOGIES
MODUS PONENS
 It is used in forward-chaining expert systems.
 Modus ponens deduction concludes that, given two
propositions, A and A →B, both of which are true, then
the truth of the simple proposition B is automatically
inferred.
MODUS TOLLENS
 It is used in backward-chaining expert systems.
 In modus tollens an implication between two
propositions is combined with a second proposition and
both are used to imply a third proposition.
MODUS PONENS EXAMPLE
MODUS TOLLENS EXAMPLE
FUZZY RULES
For extending the reasoning capability,
fuzzy logic uses:

 Fuzzy predicates

 Fuzzy-predicate modifiers

 Fuzzy quantifiers

 Fuzzy qualifiers
HOW FUZZY PROPOSITIONS DIFFERS
FROM CLASSICAL LOGIC
 Fuzzy Predicates: In fuzzy logic the predicate’s can be
fuzzy, e.g., tall, short, medium. In natural languages most
of the predicates are fuzzy rather than crisp.

 Fuzzy-predicate modifiers: In fuzzy logic, there exists

a wide range of predicate modifiers that act as hedges,
e.g., very, fairly, moderately, slightly. These predicate
modifiers are necessary for generating the values of a
linguistic variable.
HOW FUZZY PROPOSITIONS
DIFFERS FROM CLASSICAL LOGIC
 Fuzzy quantifiers (З, ⩝): It can be interpreted as a fuzzy
number or a fuzzy proposition, which provides an
imprecise characterization of the cardinality of one or
more fuzzy or non-fuzzy sets e.g. most, several, many,
frequently (example proposition “Many people are
educated”).

 Fuzzy qualifiers: Truth, Probability, Possibility, and

Usuality qualifiers.
HOW FUZZY PROPOSITIONS DIFFERS
FROM CLASSICAL LOGIC
 Truth qualifier: (X is young) is NOT Very True.

 Probability qualifier: (X is young) is Likely.

 Possibility qualifier: (X is young) is Almost Impossible.

 Usuality qualifier: Propositions that are usually true or

the events that have high probability of occurrence are
related by the concept of usuality qualification.
FORMATION OF FUZZY RULES
 General way of representing human knowledge is by
forming natural language expressions:

 IF antecedent THEN consequent

 i.e. IF-THEN rule-based form

FORMATION OF FUZZY RULES
General forms for linguistic variable

 Assignment statements: e.g. Climate = autumn

Outside temperature = normal

 Conditional statements: e.g. IF temperature is high

THEN climate is hot.
If A is high THEN it is low ELSE B is not low.

 Unconditional statements: e.g. Goto Sum, Stop, Divide

by A, Turn the pressure low etc.
IF-THEN RULE
 A fuzzy “if-then x rule” represents a relationship
between input and output variables using linguistic terms
and fuzzy sets.

 It has the form “If X is A, then Y is B”, where ‘X’ and

‘Y’ are linguistic variables (e.g., temperature) ‘A’ and ‘B’
are fuzzy sets representing linguistic values (e.g., hot,
fast).

 ‘X is A’ is the antecedent (or premise), while ‘Y is B’ is

the consequent (or conclusion)
IF-THEN RULE COMPONENTS
 Linguistic Variables: These are words or phrases, like
“temperature” or “speed”, that describe the input or
output of the system.

 Fuzzy Sets: These are sets of fuzzy values that represent

the linguistic terms. For example, “hot” might be a fuzzy
set defined over a range of temperatures.

 Antecedent (Premise): The “if” part of the rule (e.g., “If

temperature is hot”).

 Consequent (Conclusion): The “then” part of the rule

(e.g., “then fan speed is fast”).
IF-THEN RULE WORKING
 Fuzzification: Input values are converted into degrees of
membership within fuzzy sets.
 Implication: The rule’s antecedent (the “if” part) is
evaluated, determining how strongly the rule is true. This
truth value then modifies the output fuzzy set in the
consequent (the “then” part).
 Aggregation: If multiple rules fire, their outputs are
combined into a single fuzzy set.
 Defuzzification: The final aggregated fuzzy output is
converted back into a single, crisp (non-fuzzy) output
value that the system can use.
IF-THEN RULE AGGREGATION
 Conjunctive system rules: If all rules to be jointly
satisfied e.g.

 Y = y1 and y2, and …. and yn

 Y = y1 ∩ y2, ∩ …. ∩ yn

 Aggregated output in terms of membership function:

 𝜇(y) = min[𝜇y1(y), 𝜇(y)y2, ….𝜇(y)yn]

IF-THEN RULE AGGREGATION
 Disjunctive system rules: If the satisfaction of at least
one rule is required e.g.

 Y = y1 or y2, or …. or yn

 Y = y1 ∪ y2, ∪ …. ∪ yn

 Aggregated output in terms of membership function:

 𝜇(y) = max[𝜇y1(y), 𝜇(y)y2, ….𝜇(y)yn]

FUZZY REASONING
 It is the process of deriving conclusions from the rules
using fuzzy logic.

 It handles ambiguity and vagueness by allowing for

partial truths, unlike traditional Boolean logic, which
only permits absolute true or false.

 This involves taking fuzzy inputs, applying them to

fuzzy rules, and then performing fuzzy inference to
generate a fuzzy output, often followed by
defuzzification into a crisp, single-valued decision.
FUZZY REASONING (APPROXIMATE)

 Categorical

 Qualitative

 Syllogistic

 Dispositional
CATEGORICAL REASONING
 No fuzzy quantifiers and fuzzy probabilities in
Antecedents.

 Antecedents are assumed to be in canonical form e.g.

SOP or POS.

 Conclusion relationships are direct and don't involve

hedges like "most" or "usually.
QUALITATIVE REASONING
 Input-output relationship of a system is expressed
through fuzzy IF-THEN rules.

 With fuzzy linguistic variables for antecedents and

consequents.

 It’s widely used in control system analysis, e.g.,

processing rules like “if size is big, then speed is slow”.
SYLLOGISTIC REASONING
 Premise 1 (Major Premise): A general statement assumed
to be true.
 Premise 2 (Minor Premise): A more specific statement
also assumed to be true.
 Conclusion: A third statement that logically follows from
the two premises.
 Example:
 Premise 1: All mammals are warm-blooded.
 Premise 2: Whales are mammals.
 Conclusion: Therefore, whales are warm-blooded.
SYLLOGISTIC REASONING
 It applies fuzzy logic and quantifiers (like “usually” or
“most”) to reason about propositions that are
preponderantly true but not always certain.

 Like “Most A’s are B’s” or “Usually C’s are D’s”.

 This involves antecedents with fuzzy quantifiers, often

in the form of statements.

 The goal is to infer a final fuzzy quantifier and set of

consequences based on given fuzzy quantifiers in the
premises.
DISPOSITIONAL REASONING
 It deals with understanding inherent traits, behaviors,
and situations within a person or entity e.g. talent,
personality.

 Includes understanding trait induction, trait

extrapolation, and trait contextualization.

 e.g. attributing a person's success to their talent (a

disposition) rather than just a fortunate situation (a
situational factor).
DISPOSITIONAL REASONING
 In contrast, syllogistic fuzzy reasoning provides a formal
method for drawing conclusions from probabilistic or
fuzzy statements, often related to dispositions
themselves.

 i.e. Syllogistic fuzzy reasoning can be applied to reason

about dispositions, treating dispositions as statements of
“usuality” or “preponderant truth”

 Dispositional reasoning is a broader concept about

internal characteristics, while syllogistic fuzzy reasoning
is a specific logical method for handling probabilistic or
fuzzy information
FUZZY INFERENCE SYSTEMS
 Fuzzy rule based systems, fuzzy models, and fuzzy
expert systems are known as fuzzy inference systems.
 The primary work of FIS is decision-making.
 FIS uses “IF...THEN” rules along with connectors “OR”
or “AND” for making necessary decision rules.
 The input to FIS may be fuzzy or crisp, but the output
from FIS is always a fuzzy set.
FUZZY INFERENCE SYSTEMS

Rule Base contains all IF-THEN rules

Database defines the membership functions of fuzzy sets used in fuzzy rules
Decision making unit performs operations on rules
FUZZY INFERENCE SYSTEMS

Fuzzification inference unit converts crisp quantities into fuzzy quantities

Defuzzification unit converts fuzzy quantities into crisp quantities.
FUZZY INFERENCE SYSTEMS
 Mamdani FIS (1975): Fuzzy sets are used as rule
consequents.

 Sugeno (1985): Linear functions of input are used as

rule consequents.
MAMDANI FUZZY INFERENCE
SYSTEMS
 Fuzzify input variables: Determine membership values.

 Evaluate rules: Based on membership values of

(composite) antecedents.

 Aggregate rule outputs: Unify all membership values

for the output from all rules.

 Defuzzify the output: Center of gravity (approx. by

summation).
MAMDANI FUZZY INFERENCE
SYSTEMS
 Determine a set of fuzzy rules.
 Make the inputs fuzzy using input membership functions.
 Combine the fuzzified inputs according to the fuzzy rules
for establishing a rule strength.
 Determine the consequent of the rule by combining the
rule strength and the output membership function.
 Combine all the consequents to get an output distribution.
 Finally, a defuzzified output distribution is obtained.
SUGENO FUZZY INFERENCE SYSTEMS
SUGENO FUZZY INFERENCE SYSTEMS
 If x is A and y is B THEN z = f(x, y)

 A, B are fuzzy sets in the antecedents

 z = f(x, y) is a crisp function in consequent

 z = f(x, y) is a polynomial of either first order or constant

MAMDANI V/S SUGENO SYSTEMS
 Advantages of Mamdani method:
 It has widespread acceptance
 It is well-suitable for human input
 It is intuitive.

 Advantages of Sugeno method:

 It is computationally efficient.
 It is compact and works well with linear techniques,
optimization techniques and adaptive techniques.
 It is best suited for mathematical analysis.
 It has a guaranteed continuity of the output surface.
FUZZY EXPERT SYSTEMS
 Knowledge base contains the
knowledge specific to the domain of
application.

 Inference engine that uses the

knowledge in the knowledge base for
performing suitable reasoning for
user’s queries.

 User interface that provides a smooth

communication between the user and
the system.
FUZZY DECISION MAKING

 It is an activity which includes the steps to be taken for

choosing a suitable alternative from those that are
needed for realizing a certain goal.
FUZZY DECISION MAKING STEPS
 Determining the Set of Alternatives:- In this step, the
alternatives from which the decision has to be taken
must be determined.

 Evaluating Alternative:- Here, the alternatives must be

evaluated so that the decision can be taken about one of
the alternatives.

 Comparison between Alternatives :- In this step, a

comparison between the evaluated alternatives is done.
FUZZY DECISION MAKING TYPES
 Individual decision making

 Multi-person decision making

 Multi-objective decision making

 Multi-attribute decision making

INDIVIDUAL DECISION MAKING

 Set of possible actions

 Set of goals Gi(i∊Xn) expressed in terms of fuzzy sets

 Set of constraints Cj(j ∊ Xm) expressed in terms of fuzzy

sets e.g.
MULTI-PERSON DECISION MAKING
 The goals of individual decision makers differ, i.e., each
places a different ordering arrangement.
 On the other hand, in multi-person decision making, the
decision makers have access to different information with
different preference ordering.
 Social Choice (SC): SC : X x X⤍[0, 1]
MULTI-OBJECTIVE DECISION MAKING

 Cost minimization

 Time consumption

 Profit maximization

 i.e. tradeoffs between conflicting objectives

MULTI-OBJECTIVE DECISION MAKING
ISSUES
 To acquire proper information related to satisfaction of
the objectives

 To weigh the relative importance of each objective

MULTI-OBJECTIVE DECISION MAKING
 Let universe of alternatives: A = {a1, a2, ….. an}

 Set of objectives: O = {o1, o2, …. om}

 Decision function satisfies all objectives simultaneously:

 DF = o1∩ o2 ∩ … ∩ oi, .. ∩ om

 If 𝜇oi(a) is the degree of membership of alternative “a”

is oi is, then grade of membership will be:

 𝜇DF(a) = min[𝜇o1(a), 𝜇o2(a) …. 𝜇om(a)]

MULTI-ATTRIBUTE DECISION MAKING
 Evaluation of alternatives on the basis of attributes of the
objects
 Attributes may be classifies into numerical data,
linguistic data and qualitative data.
 Multi-attribute decision (Y)

 Y = A1X1, A2X2, ….ArXr.

 Xi is the set of attributes

 Ai is the set of corresponding weights

REFERENCES
 “Fuzzy Logic With Engineering Applications”, Timothy
J. Ross.

 “Soft Computing” Dr. S.N. Sivanandam and Dr. S.N.

Deepa.
Thank you