# Partnership Selection Involving Mixed Types of Uncertain Preferences

Authors: Li-Ching Ma
Journal: Advances in Operations Research
 (2013)

---

## Abstract

Partnership selection is an important issue in management science. This study proposes a general model based on mixed integer programming and goal-programming analytic hierarchy process (GP-AHP) to solve partnership selection problems involving mixed types of uncertain or inconsistent preferences. The proposed approach is designed to deal with crisp, interval, step, fuzzy, or mixed comparison preferences, derive crisp priorities, and improve multiple solution problems. The degree of fulfillment of a decision maker’s preferences is also taken into account. The results show that the proposed approach keeps more solution ratios within the given preferred intervals and yields less deviation. In addition, the proposed approach can treat incomplete preference matrices with flexibility in reducing the number of pairwise comparisons required and can also be conveniently developed into a decision support system.


---

## Body

## 1. Introduction

Partnership selection is an important issue in management science. The partnership selection problem can be formulated as a multiple criteria decision making problem [1]. Many researchers have adopted the Analytic Hierarchy Process (AHP; [2]) to solve related problems [3, 4], which uses exact values to express a decision maker’s pairwise comparison judgments in complete preference matrices. However, because the information about future partners is usually incomplete and vague, a decision maker’s judgments are often uncertain, inconsistent, and incomplete.Several methods have been developed to deal with partner selection problems with uncertain preferences. For instance, Mikhailov [1] proposed a new Fuzzy Preference Programming (FPP) method based on interval pairwise comparison judgments and then used the AHP method to derive global priorities for all possible alternatives. His method can be used for deriving crisp priorities from exact or interval comparison matrices regardless of their consistency. However, the FPP method may yield multiple solution problems resulting in various ranking for partner selection. In addition, this method is unable to treat judgments with step preferences in which the degree of fulfillment is constant over the same step.Herrera-Viedma et al. [5] developed the consistent fuzzy preference (CFP) method to construct the decision matrices of pairwise comparisons. Wang and Chen [6] applied the CFP method to partnership selection problems; their method can significantly reduce the number of pairwise comparisons since it can deal with incomplete preference matrices. The basic assumption of the CFP method is that a decision maker’s judgments are consistent. However, in reality, a decision maker’s pairwise judgments still contain some degree of uncertainty [7, 8] and inconsistency [9, 10].Many researchers adopted fuzzy AHP approaches to solve problems involving fuzzy preferences [11–14]. However, most obtained fuzzy priority vector needs extra defuzzification techniques to generate a crisp solution. Yu [17] proposed a goal-programming AHP model (GP-AHP) to solve fuzzy AHP problems involving triangular, convex, and mixed concave-convex fuzzy estimates in a group decision-making environment. The GP-AHP approach can obtain a crisp solution efficiently without requiring extra defuzzification techniques. However, this approach is unable to treat judgments with step preferences. In addition, for judgments with interval preferences, the GP-AHP approach can be improved to keep more ratios within the given preferred intervals.This study aims to develop a general model based on mixed integer programming and GP-AHP to solve partnership selection problems involving uncertain or inconsistent preferences. The proposed approach is designed to deal with crisp, interval, step, fuzzy, or mixed types of uncertain preferences, derive crisp priorities, and improve multiple solution problems. The degree of fulfillment of a decision maker’s preferences is also taken into account. The results show that the proposed approach keeps more solution ratios within the given preferred intervals and yields less deviation. In addition, the proposed approach can also treat incomplete preference matrices, which are quite common in practice, since it is sometimes difficult for decision makers to make comparisons between certain alternatives.This paper is organized as follows. Section2 reviews two critical partnership selection approaches with uncertain preferences. Section 3 develops mixed integer programming models for partnership selection problems with various types of preferences. Section 4 presents three numerical examples, and Section 5 draws conclusions.


## 2. Partnership Selection Approaches with Uncertain Preferences

One common format for expressing preferences is the use of pairwise comparisons, an approach which forces one to directly choose one object over another when comparing two objects, rather than requiring the comparison of all objects simultaneously [15]. All preferences in this study are assumed to be in pairwise comparison form.Consider the pairwise comparisons withn criteria at the same level in a hierarchy C1,C2,…,Cn. From the basis of AHP [2], the pairwise comparison of Ci over Cj, denoted as ri,j, is the preference specified by a decision maker as the ratio of the weights of Ci  to Cj.  Let ri,j=wi/wj measure the relative dominance of Ci over Cj  in terms of priority weights w1>0,…,wn>0.  Following Saaty, ri,j is specified as 1 to 9 numerical rate and  rj,i=1/ri,j is assumed for all i,j. If a decision maker’s preferences are certain, consistent, and complete, the weight of criterion can be obtained by the AHP method. Once the weight of criterion is derived, the priority of alternatives can be listed. However, a decision maker’s judgments are often uncertain, inconsistent, and incomplete.This section briefly reviews two critical partnership selection approaches with uncertain preferences: the Fuzzy Preference Programming (FPP) and the goal programming AHP (GP-AHP) method.


### 2.1. Fuzzy Preference Programming Method (FPP)

Mikhailov [1] proposed the FPP method for partnership selection problems based on interval pairwise comparison judgments. The interval pairwise comparisons can be expressed as  ri,j∈[ri,j_,ri,j¯], where ri,j_ and ri,j¯ are the lower and upper bounds of ri,j, respectively. When the decision maker’s judgments are consistent, there are several priority vectors whose component ratios satisfy the inequalities
(1)ri,j_≤wiwj≤ri,j¯,i=1,2,…,n-1,j>i.However, no priority vector satisfies all interval judgments simultaneously in the inconsistent cases. Mikhailov [1] proposed a solution which approximately satisfies all judgments. It is expressed as
(2)ri,j_≤~wiwj≤~ri,j¯,i=1,2,…,n-1,j>i,
where ≤~ denotes the statement “fuzzy less or equal to.” Fuzzy indicates approximation rather than precision. According to the concept of fuzzy set, if the ratio wi/wj is within the interval [ri,j_,ri,j¯], the degree of fulfillment is equal to one; otherwise, the degree of fulfillment should decrease up to some tolerance limits, ri,j¯+di,j+ and ri,j_-di,j-, as shown in Figure 1.Figure 1
Membership function of the degree of fulfillment by Mikhailov [1].Inequality (2) can be transformed into two fuzzy constraints:
(3)wi-wjri,j¯≤~0,-wi+wjri,j_≤~0,i=1,2,…,n-1,j>i.The previous set of fuzzy constraints is expressed as a matrix formRw≤~0. The  kth row of Rw≤~0, denoted as Rkw≤~0, represents a fuzzy constraint and is defined by a fuzzy membership function:
(4)μk(Rkw)={1Rkw≤0,1-Rkwdk0≤Rkw≤dk,0Rkw>dk,
where if Rkw≤~0 corresponds to the lower bound ri,j_, then dk=di,j-; otherwise, dk=di,j+. Using the fuzzy min-max operator method proposed by Zimmermann [16], the partnership selection problem is transformed to the following linear program:FPP model
(5)
Max
λ
subject
to
d
k
λ
+
R
k
w
≤
d
k
,
∀
k
,
subject
to
∑
i
=
1
n
w
i
=
1
,
w
i
>
0
,
∀
i
,
subject
to
0
≤
λ
≤
1
.This method can be used for deriving crisp priorities from exact, interval, or mixed comparison matrices. The major limitation of the FPP method is that the tolerance parametersdkmust be chosen in advance. When the decision maker’s preferences are inconsistent, different chosen dk may result in various solutions. On the other hand, when a decision maker’s preferences are consistent, several priority vectors, whose component ratios satisfy the inequalities in the FPP model, may yield multiple solutions with various priorities. In addition, this method is unable to deal with judgments with step preferences.


### 2.2. GP-AHP Method

The most commonly used membership function, a triangular membership function, is illustrated as shown in Figure2, where ri,j,1 and ri,j,3 are, respectively, the lower and upper bounds of a fuzzy preference r~i,j, and ri,j,2 is the  r~i,j value which is the most likely to occur.  If there are m decision makers in the group, the GP- AHP model is formulated as follows:Figure 2
Fuzzy preference with a triangular membership function.GP-AHP model
(6)
Min
α
×
Obj
1
-
Obj
2
Obj
1
=
∑
i
=
1
n
∑
j
>
i
n
∑
e
=
1
m
|
(
ln
w
i
-
ln
w
j
)
-
ln
r
~
i
,
j
e
|
Obj
2
=
∑
i
=
1
n
∑
j
>
i
n
∑
e
=
1
m
μ
(
ln
r
~
i
,
j
e
)
(7)
subject
to
ln
r
~
i
,
j
e
=
(
{
μ
(
ln
r
~
i
,
j
e
)
+
(
s
i
,
j
,
2
e
-
s
i
,
j
,
1
e
)
ln
r
i
,
j
,
2
e
-
(
s
i
,
j
,
2
e
-
s
i
,
j
,
1
e
)
z
i
,
j
e
+
s
i
,
j
,
1
e
ln
r
i
,
j
,
1
e
}
)
×
(
s
i
,
j
,
2
e
)
-
1
,
∀
r
~
i
,
j
e
,
(8)
ln
r
~
i
,
j
e
-
ln
r
i
,
j
,
2
e
+
z
i
,
j
e
≥
0
,
∀
r
~
i
,
j
e
,
(9)
z
i
,
j
e
,
r
~
i
,
j
e
≥
0
,
∀
r
~
i
,
j
e
,
(10)
w
i
≥
0
,
∀
i
,
where r~i,je indicates the eth decision-maker’s fuzzy preference of Ai over Aj. The deviation variable, zi,je, is used to treat the absolute term. The triangular membership, μ(ln(r~i,je)), is a function of ln(r~i,je), where ln(ri,j,1e), ln(ri,j,2e),  and ln(ri,j,3e)  are lower, middle, and upper values of ln(r~i,je). The slopes of the two line segments in the triangular membership function, si,j,1e and si,j,2e, are given by
(11)si,j,1e=μ(ln(ri,j,2e))-μ(ln(ri,j,1e))ln(ri,j,2e)-ln(ri,j,1e),si,j,2e=μ(ln(ri,j,3e))-μ(ln(ri,j,2e))ln(ri,j,3e)-ln(ri,j,2e).
The trade-off weighting value α is calculated by α=(n×m)/|M1-M0|, where M1 and M0 are obtained solutions by assuming that each μ(ln(r~i,je)) equals one and zero, respectively.Yu [17] applied a linearization technique to solve fuzzy AHP problems effectively. However, Yu’s approach to interval preferences can be improved. For instance, given an interval preference 2≤r1,4≤5, only one constraint ln(2)≤lnr1,4≤ln(5) is added into Yu’s model. This model can be improved to increase the possibility that final ratios are actually located in the given preferred intervals. In addition, Yu’s approach is unable to treat judgments with step preferences.This study aims to develop a general model to solve partnership selection problems involving various types of uncertain preferences and improve the limitations of the previous two methods.


## 2.1. Fuzzy Preference Programming Method (FPP)

Mikhailov [1] proposed the FPP method for partnership selection problems based on interval pairwise comparison judgments. The interval pairwise comparisons can be expressed as  ri,j∈[ri,j_,ri,j¯], where ri,j_ and ri,j¯ are the lower and upper bounds of ri,j, respectively. When the decision maker’s judgments are consistent, there are several priority vectors whose component ratios satisfy the inequalities
(1)ri,j_≤wiwj≤ri,j¯,i=1,2,…,n-1,j>i.However, no priority vector satisfies all interval judgments simultaneously in the inconsistent cases. Mikhailov [1] proposed a solution which approximately satisfies all judgments. It is expressed as
(2)ri,j_≤~wiwj≤~ri,j¯,i=1,2,…,n-1,j>i,
where ≤~ denotes the statement “fuzzy less or equal to.” Fuzzy indicates approximation rather than precision. According to the concept of fuzzy set, if the ratio wi/wj is within the interval [ri,j_,ri,j¯], the degree of fulfillment is equal to one; otherwise, the degree of fulfillment should decrease up to some tolerance limits, ri,j¯+di,j+ and ri,j_-di,j-, as shown in Figure 1.Figure 1
Membership function of the degree of fulfillment by Mikhailov [1].Inequality (2) can be transformed into two fuzzy constraints:
(3)wi-wjri,j¯≤~0,-wi+wjri,j_≤~0,i=1,2,…,n-1,j>i.The previous set of fuzzy constraints is expressed as a matrix formRw≤~0. The  kth row of Rw≤~0, denoted as Rkw≤~0, represents a fuzzy constraint and is defined by a fuzzy membership function:
(4)μk(Rkw)={1Rkw≤0,1-Rkwdk0≤Rkw≤dk,0Rkw>dk,
where if Rkw≤~0 corresponds to the lower bound ri,j_, then dk=di,j-; otherwise, dk=di,j+. Using the fuzzy min-max operator method proposed by Zimmermann [16], the partnership selection problem is transformed to the following linear program:FPP model
(5)
Max
λ
subject
to
d
k
λ
+
R
k
w
≤
d
k
,
∀
k
,
subject
to
∑
i
=
1
n
w
i
=
1
,
w
i
>
0
,
∀
i
,
subject
to
0
≤
λ
≤
1
.This method can be used for deriving crisp priorities from exact, interval, or mixed comparison matrices. The major limitation of the FPP method is that the tolerance parametersdkmust be chosen in advance. When the decision maker’s preferences are inconsistent, different chosen dk may result in various solutions. On the other hand, when a decision maker’s preferences are consistent, several priority vectors, whose component ratios satisfy the inequalities in the FPP model, may yield multiple solutions with various priorities. In addition, this method is unable to deal with judgments with step preferences.


## 2.2. GP-AHP Method

The most commonly used membership function, a triangular membership function, is illustrated as shown in Figure2, where ri,j,1 and ri,j,3 are, respectively, the lower and upper bounds of a fuzzy preference r~i,j, and ri,j,2 is the  r~i,j value which is the most likely to occur.  If there are m decision makers in the group, the GP- AHP model is formulated as follows:Figure 2
Fuzzy preference with a triangular membership function.GP-AHP model
(6)
Min
α
×
Obj
1
-
Obj
2
Obj
1
=
∑
i
=
1
n
∑
j
>
i
n
∑
e
=
1
m
|
(
ln
w
i
-
ln
w
j
)
-
ln
r
~
i
,
j
e
|
Obj
2
=
∑
i
=
1
n
∑
j
>
i
n
∑
e
=
1
m
μ
(
ln
r
~
i
,
j
e
)
(7)
subject
to
ln
r
~
i
,
j
e
=
(
{
μ
(
ln
r
~
i
,
j
e
)
+
(
s
i
,
j
,
2
e
-
s
i
,
j
,
1
e
)
ln
r
i
,
j
,
2
e
-
(
s
i
,
j
,
2
e
-
s
i
,
j
,
1
e
)
z
i
,
j
e
+
s
i
,
j
,
1
e
ln
r
i
,
j
,
1
e
}
)
×
(
s
i
,
j
,
2
e
)
-
1
,
∀
r
~
i
,
j
e
,
(8)
ln
r
~
i
,
j
e
-
ln
r
i
,
j
,
2
e
+
z
i
,
j
e
≥
0
,
∀
r
~
i
,
j
e
,
(9)
z
i
,
j
e
,
r
~
i
,
j
e
≥
0
,
∀
r
~
i
,
j
e
,
(10)
w
i
≥
0
,
∀
i
,
where r~i,je indicates the eth decision-maker’s fuzzy preference of Ai over Aj. The deviation variable, zi,je, is used to treat the absolute term. The triangular membership, μ(ln(r~i,je)), is a function of ln(r~i,je), where ln(ri,j,1e), ln(ri,j,2e),  and ln(ri,j,3e)  are lower, middle, and upper values of ln(r~i,je). The slopes of the two line segments in the triangular membership function, si,j,1e and si,j,2e, are given by
(11)si,j,1e=μ(ln(ri,j,2e))-μ(ln(ri,j,1e))ln(ri,j,2e)-ln(ri,j,1e),si,j,2e=μ(ln(ri,j,3e))-μ(ln(ri,j,2e))ln(ri,j,3e)-ln(ri,j,2e).
The trade-off weighting value α is calculated by α=(n×m)/|M1-M0|, where M1 and M0 are obtained solutions by assuming that each μ(ln(r~i,je)) equals one and zero, respectively.Yu [17] applied a linearization technique to solve fuzzy AHP problems effectively. However, Yu’s approach to interval preferences can be improved. For instance, given an interval preference 2≤r1,4≤5, only one constraint ln(2)≤lnr1,4≤ln(5) is added into Yu’s model. This model can be improved to increase the possibility that final ratios are actually located in the given preferred intervals. In addition, Yu’s approach is unable to treat judgments with step preferences.This study aims to develop a general model to solve partnership selection problems involving various types of uncertain preferences and improve the limitations of the previous two methods.


## 3. Multiobjective Programming Models for Various Types of Preferences

A general model is proposed to deal with exact, interval, step, fuzzy, or mixed comparison matrices for partnership selection problems regardless of inconsistencies. First denoter^i,j as the uncertain preference of Ai over Aj, and let F,V,C,S be the set of fuzzy, interval, crisp, and step preferences, respectively. This study assumes that r^i,j∈{F,V,C,S}. Models for fuzzy, interval, crisp, and step preferences are developed first. A general model with mixed preferences is constructed last.


### 3.1. Fuzzy Preferences

A decision maker may prefer to specify fuzzy preferences (i.e.,r^i,j∈F, also denoted as r~i,j commonly). Fuzzy preferences represent that a decision maker’s judgments are approximate rather than precise. The proposed model for fuzzy preferences is based on the work of Yu [17]. Denote μ(r^i,j) as the membership function of a fuzzy preference r^i,j∈F.  A fuzzy AHP problem can be expressed in the following multiobjective programming form:
(12)MinObj1=∑r^i,j∈F|wiwj-r^i,j|MaxObj2=∑r^i,j∈Fμ(r^i,j)subjectto∑i=1nwi=1,subjecttor^i,j≥0,∀r^i,j∈F,subjecttowi≥0,∀i.The first objective is to minimize the sum of deviations resulting from approximation, and the second objective is to maximize the sum of membership functions ofr^i,j, which indicates the fulfillment of the decision maker’s preferences. This model is in the form of goalprogramming [18], which can be solved by the weights method [19] to optimize both objectives jointly.A triangular membership function is illustrated and denoted asr^i,j=(ri,j,1,ri,j,2,ri,j,3), r^i,j∈F. According to the studies of Yu [17] and Ma and Li [20], a piecewise linear function of ln(r^i,j)  can be expressed as
(13)μ(ln(r^i,j))=si,j,1×(ln(r^i,j)-ln(ri,j,1))+(si,j,2-si,j,1)2×(|ln(r^i,j)-ln(ri,j,2)|+ln(r^i,j)-ln(ri,j,2)),
where si,j,1=(μ(ln(ri,j,2))-μ(ln(ri,j,1))/(ln(ri,j,2)-ln(ri,j,1)) and si,j,2=(μ(ln(ri,j,3))-μ(ln(ri,j,2)))/((ln(ri,j,3)-ln(ri,j,2)). |o| is the absolute value of o.After using the logarithms, the multi-objective programming model can be transferred into a linear program as follows.Model 1: Multiobjective Programming Fuzzy Preference Model (MPFP). Consider
(14)
Min
Obj
1
=
∑
r
^
i
,
j
∈
F
(
ln
(
w
i
)
-
ln
(
w
j
)
Min
Obj
1
=
-
ln
(
r
^
i
,
j
)
+
2
z
i
,
j
)
Max
Obj
2
=
∑
r
^
i
,
j
∈
F
μ
(
ln
(
r
^
i
,
j
)
)
(15)
subject
to
ln
(
w
i
)
-
ln
(
w
j
)
-
ln
(
r
^
i
,
j
)
+
z
i
,
j
≥
0
,
Subject
to
∀
r
^
i
,
j
∈
F
,
(16)
Subject
to
z
i
,
j
≥
0
,
∀
r
^
i
,
j
∈
F
,
(17)
Subject
to
ln
(
0.01
)
≤
ln
(
w
i
)
≤
ln
(
1
)
,
∀
i
,
(18)
μ
(
ln
(
r
^
i
,
j
)
)
=
s
i
,
j
,
1
×
(
ln
(
r
^
i
,
j
)
-
ln
(
r
i
,
j
,
1
)
)
+
(
s
i
,
j
,
2
-
s
i
,
j
,
1
)
Subject
to
×
(
ln
(
r
^
i
,
j
)
-
ln
(
r
i
,
j
,
2
)
+
x
i
,
j
)
,
∀
r
^
i
,
j
∈
F
,
(19)
Subject
to
ln
(
r
^
i
,
j
)
-
ln
(
r
i
,
j
,
2
)
+
x
i
,
j
≥
0
,
∀
r
^
i
,
j
∈
F
,
(20)
Subject
to
x
i
,
j
≥
0
,
∀
r
^
i
,
j
∈
F
.In order to linearize the absolute term in Obj1, constraints (15) and (16) are added into the model. Expression (17) is used to set the range of weight wi between 0.01 and 1. Expression (20) is derived from Expression (13). Expressions (19) and (20) are based on Yu [17].


### 3.2. Constant Interval Preferences

A decision maker may provide constant interval judgmentsr^i,j∈V and r^i,j = [ri,j,1,ri,j,2],  where ri,j,1=ri,j_ and ri,j,2=ri,j¯ indicate the lower and upper bounds, respectively, as shown in Figure 3. In order to integrate different types of preferences, the objective functions of all proposed models are constructed similar to those of MPFP model. This study tries to use the function μ(r^i,j) to represent the fulfillment of the decision maker’s interval preferences. If the optimal preference ratio wi*/wj* is located in the given preferred interval (i.e., ri,j,1≤wi*/wj*≤ri,j,2), then μ(r^i,j)=1; otherwise, μ(r^i,j)=0. A binary variable bi,j,0 is used to indicate whether the optimal preference ratio wi*/wj* is in the interval [ri,j,1,ri,j,2] or not. A mixed integer programming interval preference model (MPVP) can be expressed as follows.The concept diagram of interval (a) and crisp (b) preferences.
(a)
(b)Model 2: Multiobjective Programming Interval Preference Model (MPVP). Consider
(21)
Min
Obj
1
=
∑
r
^
i
,
j
∈
V
(
ln
(
w
i
)
-
ln
(
w
j
)
Min
Obj
1
=
-
ln
(
r
^
i
,
j
)
+
2
z
i
,
j
)
Max
Obj
2
=
∑
r
^
i
,
j
∈
V
μ
(
ln
(
r
^
i
,
j
)
)
subject
to
(
15
)


~


(
17
)
,
∀
r
^
i
,
j
∈
V
,
(22)
subject
to
ln
(
r
i
,
j
,
1
)
-
M
(
1
-
b
i
,
j
,
0
)
subject
=
=
to
≤
ln
(
w
i
)
-
ln
(
w
j
)
subject
=
=
to
≤
ln
(
r
i
,
j
,
2
)
+
M
(
1
-
b
i
,
j
,
0
)
,
∀
r
^
i
,
j
∈
V
,
(23)
subject
to
1
+
(
b
i
,
j
,
0
-
1
)
≤
μ
(
ln
(
r
^
i
,
j
)
)
≤
1
+
(
b
i
,
j
,
0
-
1
)
,
∀
r
^
i
,
j
∈
V
,
(24)
subject
to
ln
(
r
i
,
j
,
1
)
-
M
b
i
,
j
,
0
≤
ln
(
r
^
i
,
j
)
subject
to
ln
(
r
i
,
j
,
1
)
-
M
b
i
,
j
,
0
≤
ln
(
r
i
,
j
,
2
)
+
M
b
i
,
j
,
0
,
∀
r
^
i
,
j
∈
V
,
(25)
subject
to
b
i
,
j
,
0
∈
{
0,1
}
,
∀
r
^
i
,
j
∈
V
,
M
is
a
large
value
.The objective functions of the MPVP model are similar to those of the MPFP model. From Expressions (22)–(24), if bi,j,0=1, ln(ri,j,1)≤ln(wi)-ln(wj)≤ln(ri,j,2) and μ(ln(r^i,j))=1; otherwise, if bi,j,0=0, μ(ln(r^i,j))=0 and ln(ri,j,1)≤ln(r^i,j)≤ln(ri,j,2). So, if the final preference ratio wi*/wj* is located in the given interval, the decision maker’s preference is thoroughly fulfilled; otherwise, the model will find the priority weight ratio approaching r^i,j as closely as possible. Because Obj2 is to maximize the sum of μ(ln(r^i,j)), this model can keep as many preference ratios in the given interval as possible.Yu’s approach [17] is a slope-based approach, as shown in Expressions (7) and (11). The slope of every line segment has to be calculated in advance. The proposed approach is a mixed integer programming approach. For constant interval preferences, a binary variable bi,j,0 is employed for each r^i,j to keep as many preference ratios wi*/wj* located in the given interval as possible; that is, the number of solution ratios which are finally located in the decision maker’s preference range is maximized. Therefore, the proposed model can keep more preference ratios in the given interval than Yu’s [17] approach.


### 3.3. Crisp Preferences

A crisp preference can be considered as a special case of interval preference with equal lower and upper bounds; that is,ri,j,2=ri,j,1, for all r^i,j∈C. If the optimal preference ratio wi*/wj*=ri,j,1, then μ(r^i,j)=1; otherwise, μ(r^i,j)=0, as shown in Figure 3. The mixed-integer programming crisp preference model (MPCP) can be constructed as follows.Model 3: Multiobjective Programming Crisp Preference Model (MPCP). Consider
(26)
Min
Obj
1
=
∑
r
^
i
,
j
∈
C
(
ln
(
w
i
)
-
ln
(
w
j
)
-
ln
(
r
^
i
,
j
)
+
2
z
i
,
j
)
Max
Obj
2
=
∑
r
^
i
,
j
∈
C
μ
(
ln
(
r
^
i
,
j
)
)
subject
to
(
15
)


~


(
17
)
,
(
22
)


~


(
25
)
,
∀
r
~
i
,
j
∈
C
.


### 3.4. Step Preferences

A decision maker may specify multistep preferences in which the degree of fulfillment is constant over the same step. Aq-step preference function is denoted as r^i,j=[ri,j,1,ri,j,2,…,ri,j,q+1:fi,j,1,fi,j,2,…,fi,j,q], for all r^i,j∈S, and formulated as follows:
(27)μ(r^i,j)={fi,j,1forri,j1≤r^i,j≤ri,j,2fi,j,2forri,j2≤r^i,j≤ri,j,3⋮⋮fi,j,qforri,jq≤r^i,j≤ri,j,q+1,∀r^i,j∈S,
where fi,j,q  denotes the degree of fulfillment for the qth step, which is restricted in [0,1].For instance, a three-step preference is shown in Figure4, where if ri,j,1≤r^i,j≤ri,j,2, μ(r^i,j)=fi,j,1; if ri,j,2≤r^i,j≤ri,j,3, μ(r^i,j)=fi,j,2; if ri,j,3≤r^i,j≤ri,j,4, μ(r^i,j)=fi,j,3. This three-step preference is denoted as r^i,j=[ri,j,1,ri,j,2,ri,j,3,ri,j,4:fi,j,1,fi,j,2,fi,j,3]. Two 0/1 variables bi,j,0 and bi,j,1 are used to delineate μ(r^i,j) into the following 4 cases: (i)
bi,j,0=0 and bi,j,1=1: if ri,j,1≤wi*/wj*≤ri,j,2, then μ(r^i,j)=fi,j,1;(ii)
bi,j,0=1 and bi,j,1=0: if ri,j,2≤wi*/wj*≤ri,j,3, then μ(r^i,j)=fi,j,2;(iii)
bi,j,0=1 and bi,j,1=1: if ri,j,3≤wi*/wj*≤ri,j,4, then μ(r^i,j)=fi,j,3;(iv)
bi,j,0=0 and bi,j,1=0: if wi*/wj*<ri,j,1 or wi*/wj*>ri,j,4, then μ(r^i,j)=0.Figure 4
The concept diagram of a three-step preference.A three-step preference model can be expressed as follows.Model 4: Multiobjective Programming Step Preference Model (MPSP). Consider
(28)
Min
Obj
1
=
∑
r
^
i
,
j
∈
S
(
ln
(
w
i
)
-
ln
(
w
j
)
-
ln
(
r
^
i
,
j
)
+
2
z
i
,
j
)
Max
Obj
2
=
∑
r
^
i
,
j
∈
S
μ
(
ln
(
r
^
i
,
j
)
)
subject
to
(
15
)


~


(
17
)
,
∀
r
^
i
,
j
∈
S
(29)
ln
(
r
i
,
j
,
1
)
-
M
(
1
+
b
i
,
j
,
0
-
b
i
,
j
,
1
)
≤
ln
(
w
i
)
-
ln
(
w
j
)
≤
ln
(
r
i
,
j
,
2
)
+
M
(
1
+
b
i
,
j
,
0
-
b
i
,
j
,
1
)
,
∀
r
^
i
,
j
∈
S
,
(30)
subject
to
ln
(
r
i
,
j
,
2
)
-
M
(
1
-
b
i
,
j
,
0
+
b
i
,
j
,
1
)
≤
ln
(
w
i
)
-
ln
(
w
j
)
≤
ln
(
r
i
,
j
,
3
)
+
M
(
1
-
b
i
,
j
,
0
+
b
i
,
j
,
1
)
,
∀
r
^
i
,
j
∈
S
,
(31)
subject
to
ln
(
r
i
,
j
,
3
)
-
M
(
2
-
b
i
,
j
,
0
-
b
i
,
j
,
1
)
≤
ln
(
w
i
)
-
ln
(
w
j
)
≤
ln
(
r
i
,
j
,
4
)
+
M
(
2
-
b
i
,
j
,
0
-
b
i
,
j
,
1
)
,
∀
r
^
i
,
j
∈
S
,
(32)
subject
to
ln
(
r
i
,
j
,
1
)
-
M
(
b
i
,
j
,
0
+
b
i
,
j
,
1
)
≤
ln
(
r
^
i
,
j
)
≤
ln
(
r
i
,
j
,
4
)
+
M
(
b
i
,
j
,
0
+
b
i
,
j
,
1
)
,
∀
r
^
i
,
j
∈
S
,
(33)
subject
to
f
i
,
j
,
1
-
M
(
1
+
b
i
,
j
,
0
-
b
i
,
j
,
1
)
≤
μ
(
ln
(
r
^
i
,
j
)
)
≤
f
i
,
j
,
1
+
M
(
1
+
b
i
,
j
,
0
-
b
i
,
j
,
1
)
,
∀
r
^
i
,
j
∈
S
,
(34)
subject
t
o
f
i
,
j
,
2
-
M
(
1
-
b
i
,
j
,
0
+
b
i
,
j
,
1
)
≤
μ
(
ln
(
r
^
i
,
j
)
)
≤
f
i
,
j
,
2
+
M
(
1
-
b
i
,
j
,
0
+
b
i
,
j
,
1
)
,
∀
r
^
i
,
j
∈
S
,
(35)
subject
to
f
i
,
j
,
3
-
M
(
2
-
b
i
,
j
,
0
-
b
i
,
j
,
1
)
≤
μ
(
ln
(
r
^
i
,
j
)
)
≤
f
i
,
j
,
3
+
M
(
2
-
b
i
,
j
,
0
-
b
i
,
j
,
1
)
,
∀
r
^
i
,
j
∈
S
,
(36)
subject
to
M
(
b
i
,
j
,
0
+
b
i
,
j
,
1
)
≤
μ
(
ln
(
r
^
i
,
j
)
)
,
≤
M
(
b
i
,
j
,
0
+
b
i
,
j
,
1
)
∀
r
^
i
,
j
∈
S
,
(37)
subject
to
b
i
,
j
,
0
,
b
i
,
j
,
1
∈
{
0,1
}
,
∀
r
^
i
,
j
∈
S
,
M
is
a
large
value
.Case (i) is represented in Expressions (29) and (33) with bi,j,0=0 and bi,j,1=1. Case (ii) is shown in Expressions (30) and (34) with bi,j,0=1 and bi,j,1=0. Case (iii) is described in Expressions (31) and (35) with bi,j,0=1 and bi,j,1=1. Case (iv) is exhibited in Expressions (32) and (36) with bi,j,0=0 and bi,j,1=0. In case (iv), following Obj1, wi*/wj* will be as close to r~i,j as possible, given ri,j,1≤r^i,j≤ri,j,4. In order to integrate different types of preferences, the objective functions of this MPSP model are designed similar to those of MPFP model.Yu’s approach [17] cannot treat problems involving step preferences. As mentioned before, Yu’s approach is a slope-based approach. The slope of every line segment has to be calculated in advance as listed in Expression (11). However, for step preferences, the slopes of some line segments cannot be calculated. For instance, the slope of line segment between points Q1 and Q2  in Figure 4 is infeasible. The proposed approach for step preferences is based on mixed integer programming rather than slope-based approach. Two binary variables bi,j,0  and bi,j,1 for each r~i,j are designed to solve problems with step preferences as listed in Expressions (29)–(37).


### 3.5. Mixed Preferences

In order to aggregate different types of preferences, the objective functions of Models 1–4 are developed in the similar way in this study. Models for interval, crisp, and step preferences are constructed as a compatible form with fuzzy preferences. If a decision maker’s pairwise comparison matrix contains fuzzy, interval, crisp, and step preferences, a general mixed preference model can be formulated based on Models1,2,3, and 4 as follows.Model 5: Multiobjective Programming Mixed Preference Model (MPMP). Consider
(38)
Min
Obj
1
=
∑
r
^
i
,
j
∈
F
∪
V
∪
C
∪
S
(
ln
(
w
i
)
-
ln
(
w
j
)
-
ln
(
r
^
i
,
j
)
+
2
z
i
,
j
)
Max
Obj
2
=
∑
r
^
i
,
j
∈
F
∪
V
∪
C
∪
S
μ
(
ln
(
r
^
i
,
j
)
)
subject
to
(
15
)
–
(
17
)
,
∀
r
^
i
,
j
∈
F
∪
V
∪
C
∪
S
,
subject
to
(
18
)
–
(
20
)
,
∀
r
i
,
j
∈
F
,
subject
to
(
22
)
–
(
24
)
,
∀
r
~
i
,
j
∈
V
∪
C
,
subject
to
(
29
)
–
(
36
)
,
∀
r
~
i
,
j
∈
S
,
subject
to
b
i
,
j
,
0
∈
{
0,1
}
,
∀
r
~
i
,
j
∈
S
∪
V
∪
C
,
b
i
,
j
,
1
∈
{
0,1
}
,
∀
r
~
i
,
j
∈
S
,
M
is
a
large
value
.The proposed models try to minimize Obj1, which implies thatwi*/wj* is as close to r^i,j as possible, and to maximize Obj2, which indicates that the extent of decision makers’ preferences is fulfilled as thoroughly as possible. The proposed models are multiobjective linear optimization problems, which can be solved using many techniques to get a global optimum. One of the commonly used methods is formulated as follows:
(39)Minα×Obj1–Obj2subjecttoallotherconstraintsareintheproposedmodels,
where α is a given weight variable reflecting the relative importance between Obj1 and Obj2. Because Obj1 is regarded as the most important objective in this study, α=1000000 is given. By dividing the sum of weights, all the weight wi can be normalized to the range [0,1] and ∑i=1nwi=1. The proposed models can be easily solved by commercial software such as Lingo.In order to compare the performance of different approaches, the absolute difference in the solution ratiori,j from the original given ranges [ri,j_,ri,j¯] can be defined as
(40)vi,j={ri,j-ri,j,¯ifri,j>ri,j¯ri,j_-ri,j,ifri,j<ri,j_0,ifri,j_<ri,j<ri,j¯.The smaller thevi,j, the closer the approach to the decision maker’s preference. All absolute differences vi,j in a matrix can be calculated to obtain the total absolute differences. The performance of different approaches can be measured by (i) the number of solution ratios which are out of the decision maker’s preference range, (ii) the value of the total absolute difference, and (iii) degree of fulfillment of the decision maker’s preferences.


## 3.1. Fuzzy Preferences

A decision maker may prefer to specify fuzzy preferences (i.e.,r^i,j∈F, also denoted as r~i,j commonly). Fuzzy preferences represent that a decision maker’s judgments are approximate rather than precise. The proposed model for fuzzy preferences is based on the work of Yu [17]. Denote μ(r^i,j) as the membership function of a fuzzy preference r^i,j∈F.  A fuzzy AHP problem can be expressed in the following multiobjective programming form:
(12)MinObj1=∑r^i,j∈F|wiwj-r^i,j|MaxObj2=∑r^i,j∈Fμ(r^i,j)subjectto∑i=1nwi=1,subjecttor^i,j≥0,∀r^i,j∈F,subjecttowi≥0,∀i.The first objective is to minimize the sum of deviations resulting from approximation, and the second objective is to maximize the sum of membership functions ofr^i,j, which indicates the fulfillment of the decision maker’s preferences. This model is in the form of goalprogramming [18], which can be solved by the weights method [19] to optimize both objectives jointly.A triangular membership function is illustrated and denoted asr^i,j=(ri,j,1,ri,j,2,ri,j,3), r^i,j∈F. According to the studies of Yu [17] and Ma and Li [20], a piecewise linear function of ln(r^i,j)  can be expressed as
(13)μ(ln(r^i,j))=si,j,1×(ln(r^i,j)-ln(ri,j,1))+(si,j,2-si,j,1)2×(|ln(r^i,j)-ln(ri,j,2)|+ln(r^i,j)-ln(ri,j,2)),
where si,j,1=(μ(ln(ri,j,2))-μ(ln(ri,j,1))/(ln(ri,j,2)-ln(ri,j,1)) and si,j,2=(μ(ln(ri,j,3))-μ(ln(ri,j,2)))/((ln(ri,j,3)-ln(ri,j,2)). |o| is the absolute value of o.After using the logarithms, the multi-objective programming model can be transferred into a linear program as follows.Model 1: Multiobjective Programming Fuzzy Preference Model (MPFP). Consider
(14)
Min
Obj
1
=
∑
r
^
i
,
j
∈
F
(
ln
(
w
i
)
-
ln
(
w
j
)
Min
Obj
1
=
-
ln
(
r
^
i
,
j
)
+
2
z
i
,
j
)
Max
Obj
2
=
∑
r
^
i
,
j
∈
F
μ
(
ln
(
r
^
i
,
j
)
)
(15)
subject
to
ln
(
w
i
)
-
ln
(
w
j
)
-
ln
(
r
^
i
,
j
)
+
z
i
,
j
≥
0
,
Subject
to
∀
r
^
i
,
j
∈
F
,
(16)
Subject
to
z
i
,
j
≥
0
,
∀
r
^
i
,
j
∈
F
,
(17)
Subject
to
ln
(
0.01
)
≤
ln
(
w
i
)
≤
ln
(
1
)
,
∀
i
,
(18)
μ
(
ln
(
r
^
i
,
j
)
)
=
s
i
,
j
,
1
×
(
ln
(
r
^
i
,
j
)
-
ln
(
r
i
,
j
,
1
)
)
+
(
s
i
,
j
,
2
-
s
i
,
j
,
1
)
Subject
to
×
(
ln
(
r
^
i
,
j
)
-
ln
(
r
i
,
j
,
2
)
+
x
i
,
j
)
,
∀
r
^
i
,
j
∈
F
,
(19)
Subject
to
ln
(
r
^
i
,
j
)
-
ln
(
r
i
,
j
,
2
)
+
x
i
,
j
≥
0
,
∀
r
^
i
,
j
∈
F
,
(20)
Subject
to
x
i
,
j
≥
0
,
∀
r
^
i
,
j
∈
F
.In order to linearize the absolute term in Obj1, constraints (15) and (16) are added into the model. Expression (17) is used to set the range of weight wi between 0.01 and 1. Expression (20) is derived from Expression (13). Expressions (19) and (20) are based on Yu [17].


## 3.2. Constant Interval Preferences

A decision maker may provide constant interval judgmentsr^i,j∈V and r^i,j = [ri,j,1,ri,j,2],  where ri,j,1=ri,j_ and ri,j,2=ri,j¯ indicate the lower and upper bounds, respectively, as shown in Figure 3. In order to integrate different types of preferences, the objective functions of all proposed models are constructed similar to those of MPFP model. This study tries to use the function μ(r^i,j) to represent the fulfillment of the decision maker’s interval preferences. If the optimal preference ratio wi*/wj* is located in the given preferred interval (i.e., ri,j,1≤wi*/wj*≤ri,j,2), then μ(r^i,j)=1; otherwise, μ(r^i,j)=0. A binary variable bi,j,0 is used to indicate whether the optimal preference ratio wi*/wj* is in the interval [ri,j,1,ri,j,2] or not. A mixed integer programming interval preference model (MPVP) can be expressed as follows.The concept diagram of interval (a) and crisp (b) preferences.
(a)
(b)Model 2: Multiobjective Programming Interval Preference Model (MPVP). Consider
(21)
Min
Obj
1
=
∑
r
^
i
,
j
∈
V
(
ln
(
w
i
)
-
ln
(
w
j
)
Min
Obj
1
=
-
ln
(
r
^
i
,
j
)
+
2
z
i
,
j
)
Max
Obj
2
=
∑
r
^
i
,
j
∈
V
μ
(
ln
(
r
^
i
,
j
)
)
subject
to
(
15
)


~


(
17
)
,
∀
r
^
i
,
j
∈
V
,
(22)
subject
to
ln
(
r
i
,
j
,
1
)
-
M
(
1
-
b
i
,
j
,
0
)
subject
=
=
to
≤
ln
(
w
i
)
-
ln
(
w
j
)
subject
=
=
to
≤
ln
(
r
i
,
j
,
2
)
+
M
(
1
-
b
i
,
j
,
0
)
,
∀
r
^
i
,
j
∈
V
,
(23)
subject
to
1
+
(
b
i
,
j
,
0
-
1
)
≤
μ
(
ln
(
r
^
i
,
j
)
)
≤
1
+
(
b
i
,
j
,
0
-
1
)
,
∀
r
^
i
,
j
∈
V
,
(24)
subject
to
ln
(
r
i
,
j
,
1
)
-
M
b
i
,
j
,
0
≤
ln
(
r
^
i
,
j
)
subject
to
ln
(
r
i
,
j
,
1
)
-
M
b
i
,
j
,
0
≤
ln
(
r
i
,
j
,
2
)
+
M
b
i
,
j
,
0
,
∀
r
^
i
,
j
∈
V
,
(25)
subject
to
b
i
,
j
,
0
∈
{
0,1
}
,
∀
r
^
i
,
j
∈
V
,
M
is
a
large
value
.The objective functions of the MPVP model are similar to those of the MPFP model. From Expressions (22)–(24), if bi,j,0=1, ln(ri,j,1)≤ln(wi)-ln(wj)≤ln(ri,j,2) and μ(ln(r^i,j))=1; otherwise, if bi,j,0=0, μ(ln(r^i,j))=0 and ln(ri,j,1)≤ln(r^i,j)≤ln(ri,j,2). So, if the final preference ratio wi*/wj* is located in the given interval, the decision maker’s preference is thoroughly fulfilled; otherwise, the model will find the priority weight ratio approaching r^i,j as closely as possible. Because Obj2 is to maximize the sum of μ(ln(r^i,j)), this model can keep as many preference ratios in the given interval as possible.Yu’s approach [17] is a slope-based approach, as shown in Expressions (7) and (11). The slope of every line segment has to be calculated in advance. The proposed approach is a mixed integer programming approach. For constant interval preferences, a binary variable bi,j,0 is employed for each r^i,j to keep as many preference ratios wi*/wj* located in the given interval as possible; that is, the number of solution ratios which are finally located in the decision maker’s preference range is maximized. Therefore, the proposed model can keep more preference ratios in the given interval than Yu’s [17] approach.


## 3.3. Crisp Preferences

A crisp preference can be considered as a special case of interval preference with equal lower and upper bounds; that is,ri,j,2=ri,j,1, for all r^i,j∈C. If the optimal preference ratio wi*/wj*=ri,j,1, then μ(r^i,j)=1; otherwise, μ(r^i,j)=0, as shown in Figure 3. The mixed-integer programming crisp preference model (MPCP) can be constructed as follows.Model 3: Multiobjective Programming Crisp Preference Model (MPCP). Consider
(26)
Min
Obj
1
=
∑
r
^
i
,
j
∈
C
(
ln
(
w
i
)
-
ln
(
w
j
)
-
ln
(
r
^
i
,
j
)
+
2
z
i
,
j
)
Max
Obj
2
=
∑
r
^
i
,
j
∈
C
μ
(
ln
(
r
^
i
,
j
)
)
subject
to
(
15
)


~


(
17
)
,
(
22
)


~


(
25
)
,
∀
r
~
i
,
j
∈
C
.


## 3.4. Step Preferences

A decision maker may specify multistep preferences in which the degree of fulfillment is constant over the same step. Aq-step preference function is denoted as r^i,j=[ri,j,1,ri,j,2,…,ri,j,q+1:fi,j,1,fi,j,2,…,fi,j,q], for all r^i,j∈S, and formulated as follows:
(27)μ(r^i,j)={fi,j,1forri,j1≤r^i,j≤ri,j,2fi,j,2forri,j2≤r^i,j≤ri,j,3⋮⋮fi,j,qforri,jq≤r^i,j≤ri,j,q+1,∀r^i,j∈S,
where fi,j,q  denotes the degree of fulfillment for the qth step, which is restricted in [0,1].For instance, a three-step preference is shown in Figure4, where if ri,j,1≤r^i,j≤ri,j,2, μ(r^i,j)=fi,j,1; if ri,j,2≤r^i,j≤ri,j,3, μ(r^i,j)=fi,j,2; if ri,j,3≤r^i,j≤ri,j,4, μ(r^i,j)=fi,j,3. This three-step preference is denoted as r^i,j=[ri,j,1,ri,j,2,ri,j,3,ri,j,4:fi,j,1,fi,j,2,fi,j,3]. Two 0/1 variables bi,j,0 and bi,j,1 are used to delineate μ(r^i,j) into the following 4 cases: (i)
bi,j,0=0 and bi,j,1=1: if ri,j,1≤wi*/wj*≤ri,j,2, then μ(r^i,j)=fi,j,1;(ii)
bi,j,0=1 and bi,j,1=0: if ri,j,2≤wi*/wj*≤ri,j,3, then μ(r^i,j)=fi,j,2;(iii)
bi,j,0=1 and bi,j,1=1: if ri,j,3≤wi*/wj*≤ri,j,4, then μ(r^i,j)=fi,j,3;(iv)
bi,j,0=0 and bi,j,1=0: if wi*/wj*<ri,j,1 or wi*/wj*>ri,j,4, then μ(r^i,j)=0.Figure 4
The concept diagram of a three-step preference.A three-step preference model can be expressed as follows.Model 4: Multiobjective Programming Step Preference Model (MPSP). Consider
(28)
Min
Obj
1
=
∑
r
^
i
,
j
∈
S
(
ln
(
w
i
)
-
ln
(
w
j
)
-
ln
(
r
^
i
,
j
)
+
2
z
i
,
j
)
Max
Obj
2
=
∑
r
^
i
,
j
∈
S
μ
(
ln
(
r
^
i
,
j
)
)
subject
to
(
15
)


~


(
17
)
,
∀
r
^
i
,
j
∈
S
(29)
ln
(
r
i
,
j
,
1
)
-
M
(
1
+
b
i
,
j
,
0
-
b
i
,
j
,
1
)
≤
ln
(
w
i
)
-
ln
(
w
j
)
≤
ln
(
r
i
,
j
,
2
)
+
M
(
1
+
b
i
,
j
,
0
-
b
i
,
j
,
1
)
,
∀
r
^
i
,
j
∈
S
,
(30)
subject
to
ln
(
r
i
,
j
,
2
)
-
M
(
1
-
b
i
,
j
,
0
+
b
i
,
j
,
1
)
≤
ln
(
w
i
)
-
ln
(
w
j
)
≤
ln
(
r
i
,
j
,
3
)
+
M
(
1
-
b
i
,
j
,
0
+
b
i
,
j
,
1
)
,
∀
r
^
i
,
j
∈
S
,
(31)
subject
to
ln
(
r
i
,
j
,
3
)
-
M
(
2
-
b
i
,
j
,
0
-
b
i
,
j
,
1
)
≤
ln
(
w
i
)
-
ln
(
w
j
)
≤
ln
(
r
i
,
j
,
4
)
+
M
(
2
-
b
i
,
j
,
0
-
b
i
,
j
,
1
)
,
∀
r
^
i
,
j
∈
S
,
(32)
subject
to
ln
(
r
i
,
j
,
1
)
-
M
(
b
i
,
j
,
0
+
b
i
,
j
,
1
)
≤
ln
(
r
^
i
,
j
)
≤
ln
(
r
i
,
j
,
4
)
+
M
(
b
i
,
j
,
0
+
b
i
,
j
,
1
)
,
∀
r
^
i
,
j
∈
S
,
(33)
subject
to
f
i
,
j
,
1
-
M
(
1
+
b
i
,
j
,
0
-
b
i
,
j
,
1
)
≤
μ
(
ln
(
r
^
i
,
j
)
)
≤
f
i
,
j
,
1
+
M
(
1
+
b
i
,
j
,
0
-
b
i
,
j
,
1
)
,
∀
r
^
i
,
j
∈
S
,
(34)
subject
t
o
f
i
,
j
,
2
-
M
(
1
-
b
i
,
j
,
0
+
b
i
,
j
,
1
)
≤
μ
(
ln
(
r
^
i
,
j
)
)
≤
f
i
,
j
,
2
+
M
(
1
-
b
i
,
j
,
0
+
b
i
,
j
,
1
)
,
∀
r
^
i
,
j
∈
S
,
(35)
subject
to
f
i
,
j
,
3
-
M
(
2
-
b
i
,
j
,
0
-
b
i
,
j
,
1
)
≤
μ
(
ln
(
r
^
i
,
j
)
)
≤
f
i
,
j
,
3
+
M
(
2
-
b
i
,
j
,
0
-
b
i
,
j
,
1
)
,
∀
r
^
i
,
j
∈
S
,
(36)
subject
to
M
(
b
i
,
j
,
0
+
b
i
,
j
,
1
)
≤
μ
(
ln
(
r
^
i
,
j
)
)
,
≤
M
(
b
i
,
j
,
0
+
b
i
,
j
,
1
)
∀
r
^
i
,
j
∈
S
,
(37)
subject
to
b
i
,
j
,
0
,
b
i
,
j
,
1
∈
{
0,1
}
,
∀
r
^
i
,
j
∈
S
,
M
is
a
large
value
.Case (i) is represented in Expressions (29) and (33) with bi,j,0=0 and bi,j,1=1. Case (ii) is shown in Expressions (30) and (34) with bi,j,0=1 and bi,j,1=0. Case (iii) is described in Expressions (31) and (35) with bi,j,0=1 and bi,j,1=1. Case (iv) is exhibited in Expressions (32) and (36) with bi,j,0=0 and bi,j,1=0. In case (iv), following Obj1, wi*/wj* will be as close to r~i,j as possible, given ri,j,1≤r^i,j≤ri,j,4. In order to integrate different types of preferences, the objective functions of this MPSP model are designed similar to those of MPFP model.Yu’s approach [17] cannot treat problems involving step preferences. As mentioned before, Yu’s approach is a slope-based approach. The slope of every line segment has to be calculated in advance as listed in Expression (11). However, for step preferences, the slopes of some line segments cannot be calculated. For instance, the slope of line segment between points Q1 and Q2  in Figure 4 is infeasible. The proposed approach for step preferences is based on mixed integer programming rather than slope-based approach. Two binary variables bi,j,0  and bi,j,1 for each r~i,j are designed to solve problems with step preferences as listed in Expressions (29)–(37).


## 3.5. Mixed Preferences

In order to aggregate different types of preferences, the objective functions of Models 1–4 are developed in the similar way in this study. Models for interval, crisp, and step preferences are constructed as a compatible form with fuzzy preferences. If a decision maker’s pairwise comparison matrix contains fuzzy, interval, crisp, and step preferences, a general mixed preference model can be formulated based on Models1,2,3, and 4 as follows.Model 5: Multiobjective Programming Mixed Preference Model (MPMP). Consider
(38)
Min
Obj
1
=
∑
r
^
i
,
j
∈
F
∪
V
∪
C
∪
S
(
ln
(
w
i
)
-
ln
(
w
j
)
-
ln
(
r
^
i
,
j
)
+
2
z
i
,
j
)
Max
Obj
2
=
∑
r
^
i
,
j
∈
F
∪
V
∪
C
∪
S
μ
(
ln
(
r
^
i
,
j
)
)
subject
to
(
15
)
–
(
17
)
,
∀
r
^
i
,
j
∈
F
∪
V
∪
C
∪
S
,
subject
to
(
18
)
–
(
20
)
,
∀
r
i
,
j
∈
F
,
subject
to
(
22
)
–
(
24
)
,
∀
r
~
i
,
j
∈
V
∪
C
,
subject
to
(
29
)
–
(
36
)
,
∀
r
~
i
,
j
∈
S
,
subject
to
b
i
,
j
,
0
∈
{
0,1
}
,
∀
r
~
i
,
j
∈
S
∪
V
∪
C
,
b
i
,
j
,
1
∈
{
0,1
}
,
∀
r
~
i
,
j
∈
S
,
M
is
a
large
value
.The proposed models try to minimize Obj1, which implies thatwi*/wj* is as close to r^i,j as possible, and to maximize Obj2, which indicates that the extent of decision makers’ preferences is fulfilled as thoroughly as possible. The proposed models are multiobjective linear optimization problems, which can be solved using many techniques to get a global optimum. One of the commonly used methods is formulated as follows:
(39)Minα×Obj1–Obj2subjecttoallotherconstraintsareintheproposedmodels,
where α is a given weight variable reflecting the relative importance between Obj1 and Obj2. Because Obj1 is regarded as the most important objective in this study, α=1000000 is given. By dividing the sum of weights, all the weight wi can be normalized to the range [0,1] and ∑i=1nwi=1. The proposed models can be easily solved by commercial software such as Lingo.In order to compare the performance of different approaches, the absolute difference in the solution ratiori,j from the original given ranges [ri,j_,ri,j¯] can be defined as
(40)vi,j={ri,j-ri,j,¯ifri,j>ri,j¯ri,j_-ri,j,ifri,j<ri,j_0,ifri,j_<ri,j<ri,j¯.The smaller thevi,j, the closer the approach to the decision maker’s preference. All absolute differences vi,j in a matrix can be calculated to obtain the total absolute differences. The performance of different approaches can be measured by (i) the number of solution ratios which are out of the decision maker’s preference range, (ii) the value of the total absolute difference, and (iii) degree of fulfillment of the decision maker’s preferences.


## 4. Illustrative Examples

Three examples are illustrated in this section. The first example uses three different fuzzy approaches to solve partnership selection problem. The second example illustrates how to solve a mixed type of pairwise comparison matrix with fuzzy, crisp, and interval preferences. Finally, a step preference is added into the third example.Example 1.
This example is about a partnership selection problem in the formation of new virtual enterprises [1]. The hierarchical structure of the problem is shown in Figure 5. The goal of this problem is to choose a partner to supply a specific product. Four main criteria are taken into account: the price of the product (C1), the quality of the product (C2), the financial stability of the partner (C3), and the customer service of the partner (C4). There are three alternative partners P1, P2,  and P3. The interval pairwise comparisons of all criteria and alternatives are listed in Tables 1 and 2. Since the pairwise comparison matrix is reciprocal, only the elements greater or equal to 1 are presented.
Three fuzzy approaches, including the FPP [1], CFP [6], and the proposed MPFP approaches, are illustrated and compared here. Applying the FPP method to this problem yields the weights of criteria w1=0.504 (price), w2=0.259 (quality),  w3=0.163  (financial stability), and  w4=0.074 (customer service), where the values of all tolerance parameters dk are chosen equal to one. The decision table of the FPP method is listed in Table 3. The global priorities are P1= 0.352, P2=0.393, and  P3=0.255. That is, the priority of partner selection is P2≻P1≻P3. Due to the inconsistency of the interval comparison matrix, some interval ratios are out of the original given ranges. For example, the interval comparison ratio between price (C1) and quality (C2) is [2,3], whereas the solution ratio is w1/w2=0.504/0.259=1.946. The solution ratios of the criteria and the alternatives from the FPP method are listed in Tables 4, 5, 6, 7, and 8, where the values labeled with a star indicate the solutions out of the original given range.
Wang and Chen [6] applied the CFP method to the partnership selection problem, yielding the weights of criteria w1=0.370, w2=0.276, w3=0.234, and w4=0.120. The decision table for the CFP method is listed in Table 3. The global priorities are P1=0.342, P2=0.374, and  P3=0.284. The priority of partner selection is P2≻P1≻P3. The solution ratios of the criteria and the alternatives by the CFP method are also listed in Tables 4–8.
In order to compare the results of the FPP, CFP, and MPFP approaches, a triangle type membership function is assumed in the proposed MPFP approach withri,j,1=ri,j_, ri,j,3=ri,j¯, and ri,j,2=(ri,j,1+ri,j,3)/2. Applying Model 1 to the partnership selection problem yields the weights of criteria w1=0.506, w2=0.253, w3=0.169, and w4=0.072. The global priorities are  P1=0.347, P2=0.396,  and  P3=0.257. The priority of partner selection is P2≻P1≻P3. The decision table and the solution ratios by the MPFP method are listed in Tables 3–8.
As listed in Table3, when three fuzzy preference approaches FPP, CFP, and MPFP are compared, the priority of partner selection for these three approaches is the same; that is, P2≻P1≻P3. The weights of criteria obtained by the proposed MPFP approach are close to those of the FPP approach. The performance of these three methods can be measured by the number of solution ratios out of the given range and the value of the total absolute differences. Take the results of the FPP method in the preference relations matrix of criteria (Table 4) for example. The solution ratio of r1,2 is 1.946, which is out of the decision maker’s preference range [2,3]. The difference in the solution ratio of this element is v1,2=2-1.946=0.054, based on Expression (40). Because the number of solution ratios out of the given range is 1, the total absolute differences in the solution ratio are 0.054.
The comparisons of the FPP, CFP, and MPFP approaches are listed in Table9. As listed in the row of criteria matrix, the number of the solution ratios out of the given ranges is 1, 4, 0 and the total absolute differences are 0.054,  3.045,   and 0 for FPP, CFP, and MPFP, respectively.  In the row of financial stability (C3), the number of solution ratios out of the preferred ranges is 3, 3, 1 and the total absolute differences are 1.731, 4.369, and 1.5. In the row of customer service (C4), the number of violations is 3, 3, 1 and the total absolute differences are 0.823, 9.371, and 0.667. In these three comparison matrices, the performance of the proposed MPFP method is the best since both the number of solution ratios out of the given ranges and total absolute differences are the least. In the rows of price (C1) and quality (C2), because the solution ratios of the FPP and MPFP methods for these two comparison matrices are all located in the preferred ranges, the number of violations and the total absolute differences are 0. In conclusion, the performance of the proposed MPFP method is the best among these three fuzzy approaches since solution ratios of this approach are closer to the decision maker’s preferences than those of the FPP and CFP methods.Table 1
Interval pairwise comparisons of criteria (Example1).
Goal
C
1
C
2
C
3
C
4
C
1
1
2-3
3–5
4–7
C
2
1
1-2
3-4
C
3
1
2–4
C
4
1Table 2
Interval pairwise comparisons of alternatives (Example1).
P
1
P
2
P
3
C
1: Price
P
1
1
1.0–1.1
1.2–1.3
P
2
1
1.1–1.2
P
3
1
C
2:  Quality
P
1
1
P
2
1.4–1.8
1
1.2–1.4
P
3
1.3–1.5
1
C
3:  Financial stability
P
1
1
4.0-5.0
P
2
2.0-3.0
1
3.0–5.0
P
3
1
C
4:  Customer service
P
1
1
3.0–6.0
8.0–13.0
P
2
1
5.0–9.0
P
3
1Table 3
Decision table of FPP, CFP, and proposed MPFP methods (Example1).
Price (w1)
Quality(w2)
Finance (w3)
Service (w4)
Global priority
FPP
CFP
MPFP
FPP
CFP
MPFP
FPP
CFP
MPFP
FPP
CFP
MPFP
FPP
CFP
MPFP
0.504
0.370
0.506
0.259
0.276
0.253
0.163
0.234
0.169
0.074
0.120
0.072
P
1
0.364
0.345
0.368
0.244
0.299
0.238
0.325
0.311
0.294
0.705
0.492
0.709
0.352
0.342
0.347
P
2
0.342
0.338
0.338
0.421
0.370
0.429
0.575
0.450
0.588
0.242
0.347
0.236
0.393
0.374
0.396
P
3
0.294
0.317
0.294
0.335
0.331
0.333
0.100
0.239
0.118
0.053
0.161
0.055
0.255
0.284
0.257Table 4
Solution matrix of criteria for FPP, CFP, and MPFP methods (Example1).
Criteria
C
1
C
2
C
3
C
4
Data
FPP
CFP
MPFP
Data
FPP
CFP
MPFP
Data
FPP
CFP
MPFP
Data
FPP
CFP
MPFP
C
1
1
2-3
1.946*
1.341*
2.000
3–5
3.092
1.581*
3.000
4–7
6.811
3.083*
7.000
C
2
1
1-2
1.589
1.179
1.500
3-4
3.500
2.300
3.500
C
3
1
2–4
2.203
1.950*
2.333
C
4
1
The value marked with “*” indicates that this value is out of the decision maker’s
preference range.Table 5
Solution matrix of alternatives forC1 (Example 1).
C
1: Price
P
1
P
2
P
3
Data
FPP
CFP
MPFP
Data
FPP
CFP
MPFP
Data
FPP
CFP
MPFP
P
1
1
1.0–1.1
1.064
1.021
1.087
1.2–1.3
1.238
1.088*
1.250
P
2
1
1.1–1.2
1.163
1.066*
1.150
P
3
1Table 6
Solution matrix of alternatives forC2 (Example 1).
C
2: Quality
P
1
P
2
P
3
Data
FPP
CFP
MPFP
Data
FPP
CFP
MPFP
Data
FPP
CFP
MPFP
P
1
1
P
2
1.4–1.8
1.725
1.237*
1.800
1
1.2–1.4
1.257
1.118*
1.286
P
3
1.3–1.5
1.373
1.107*
1.400
1Table 7
Solution matrix of alternatives forC3 (Example 1).
C
3: Financial stability
P
1
P
2
P
3
Data
FPP
CFP
MPFP
Data
FPP
CFP
MPFP
Data
FPP
CFP
MPFP
P
1
1
4.0-5.0
3.250*
1.301*
2.500*
P
2
2.0-3.0
1.769*
1.447*
2.000
1
3.0–5.0
5.750*
1.883*
5.000
P
3
1Table 8
Solution matrix of alternatives forC4 (Example 1).
C
4: Customer service
P
1
P
2
P
3
Data
FPP
CFP
MPFP
Data
FPP
CFP
MPFP
Data
FPP
CFP
MPFP
P
1
1
3.0–6.0
2.913*
1.418*
3.000
8.0–13.0
13.302*
3.056*
13.000
P
2
1
5.0–9.0
4.566*
2.155*
4.333*
P
3
1Table 9
Comparisons of FPP, CFP, and MFP methods (Example1).
Matrix
FPP
CFP
MPFP
No.
Total difference
No.
Total difference
No.
Total difference
Criteria matrix (Table4)
1
0.054
4
3.045
0
0
C
1: Price (Table 5)
0
0
2
0.146
0
0
C
2: Quality (Table 6)
0
0
3
0.438
0
0
C
3: Financial stability (Table 7)
3
1.731
3
4.369
1
1.5
C
4: Customer service (Table 8)
3
0.823
3
9.371
1
0.667Figure 5
Hierarchy structure of Example1.Example 2.
The second example is a mixed type of pairwise comparison matrix with fuzzy, crisp, and interval preferences as listed in Table10. Six alternatives P1,…,P6 are compared. The decision maker’s judgment r1,4 is an interval preference with range [6,8];  r5,4 is a crisp preference with value 7; r6,2 is unknown; the rest of the judgments are fuzzy preferences; that is, the pairwise comparison matrix is incomplete, which contains 1 interval preference, 1 crisp preference, and 12 fuzzy preferences.
Applying Yu’s approach to this example yields the weights of alternativesw1=0.4, w2=0.1, w3=0.05, w4=0.05, w5=0.3,  and  w6=0.1, where M1=2.639, M0=0.560, and α=5.772. The objective values Obj1=0.56 and Obj2=6. The solution matrix of alternatives is listed in Table 11. The number of solution ratios out of the given range is 2: r1,5=1.33 out of given fuzzy preference (2,3,4); r1,4=6 out of given crisp value 7. The total absolute difference in solution ratio is 1.67. Since Obj2 indicates the degree of fulfillment of the decision maker’s preferences, the average degree of fulfillment can be measured as 6/12=0.5. It should be pointed out that the denominator is 12 instead of 14 because the degree of fulfillment for crisp and interval preferences is not taken into account in Yu’s approach.
Applying the proposed MPMP approach (Model 5) to this example yieldsb1,4,0=1, b5,4,0=1, Obj1=0.56, and Obj2=7.778, given α=1,000,000. The weights of alternatives w1=0.375,  w2=0.094, w3=0.047, w4=0.047, w5=0.328,  and w6=0.109. The solution matrix of alternatives is listed in Table 12 where r1,5=1.14 is out of given fuzzy preference  (2,3,4). The number of solution ratios out of the given range is 1. The total absolute difference in solution ratio is 0.86. The average degree of fulfillment is 7.778/14 = 0.556.
As shown in Example2, the performance of the proposed approach is better than that of Yu’s approach since the former has less number of solution ratios out of the given range (1 versus 2), fewer total absolute differences (0.86 versus 1.67), and a higher average degree of fulfillment (0.556 versus 0.5).Table 10
Pairwise comparisons of alternatives with mixed preferences (Example2).
P
1
P
2
P
3
P
4
P
5
P
6
P
1
(
3,4
,
5
)
(
5,6
,
8
)
[
6,8
]
(
2,3
,
4
)
(
2,4
,
5
)
P
2
(
2,3
,
6
)
(
1,2
,
4
)
P
3
P
4
(
1,2
,
5
)
P
5
(
3,4
,
6
)
(
5,6
,
8
)
7
(
2,3
,
4
)
P
6
—
(
2,3
,
6
)
(
1,2
,
3
)Table 11
Solution matrix of alternatives by Yu’s approach (Example2).
P
1
P
2
P
3
P
4
P
5
P
6
P
1
1.00
4.00
8.00
8.00
1.33*
4.00
P
2
0.25
1.00
2.00
2.00
0.33
1.00
P
3
0.13
0.50
1.00
1.00
0.17
0.50
P
4
0.13
0.50
1.00
1.00
0.17
0.50
P
5
0.75
3.00
6.00
6*
1.00
3.00
P
6
0.25
1.00
2.00
2.00
0.33
1.00Table 12
Solution matrix of alternatives by the proposed approach (Example2).
P
1
P
2
P
3
P
4
P
5
P
6
P
1
1.00
4.00
8.00
8.00
1.14*
3.43
P
2
0.25
1.00
2.00
2.00
0.29
0.86
P
3
0.13
0.50
1.00
1.00
0.14
0.43
P
4
0.13
0.50
1.00
1.00
0.14
0.43
P
5
0.87
3.50
7.00
7.00
1.00
3.00
P
6
0.29
1.17
2.33
2.33
0.33
1.00Example 3.
In order to demonstrate the capability of the proposed approach in treating step preferences, a three-step preferencer6,2=[2,3,4,5:0.8,1,0.5] is added into example 2 as Example 3. Applying Model 5 to this Example yields b1,4,0=1, b5,4,0=1, b6,2,0=0, b6,2,1=0,  Obj1=0.847, and Obj2=6.795. The weights of alternatives w1=0.364, w2=0.091, w3=0.045, w4=0.045, w5=0.318,  and w6=0.136. The solution matrix of alternatives is listed in Table 13. The number of solution ratios out of the given range is 2 with r1,5=1.14 out of given fuzzy preference (2,3,4) and r6,2=1.5 out of given step preference  [2,3,4,5:0.8,1,0.5]. The total absolute difference in solution ratio is 1.36. The average degree of fulfillment is 6.795/15=0.453. Because this example includes a step preference, the FPP, CFP, and Yu’s approaches cannot solve this problem.Table 13
Solution matrix of alternatives by the proposed approach (Example3).
P
1
P
2
P
3
P
4
P
5
P
6
P
1
1.00
4.00
8.00
8.00
1.14*
2.67
P
2
0.25
1.00
2.00
2.00
0.29
0.67
P
3
0.13
0.50
1.00
1.00
0.14
0.33
P
4
0.13
0.50
1.00
1.00
0.14
0.33
P
5
0.88
3.50
7.00
7.00
1.00
2.33
P
6
0.38
1.50*
3.00
3.00
0.43
1.00


## 5. Conclusions

This study proposes a general model based on mixed integer programming and GP-AHP to solve partnership selection problems with various types of preferences. In order to aggregate different types of preferences, the objective functions of all models in this study are designed in a similar way compatible with fuzzy preferences. The degree of fulfillment of a decision maker’s preferences is also taken into account. The proposed approach can deal with crisp, interval, fuzzy, step, or mixed comparison matrices, derive crisp priorities, and improve multiple solution problems.Compared with Yu’s approach [17], the proposed approach can treat problems with step preferences, keep more solution ratios within the given preferred intervals, and yield less deviation. Yu’s slope-based approach cannot treat problems involving step preferences because the slopes of some line segments for step preferences cannot be obtained. The proposed approach based on mixed integer programming employs binary variables rather than slopes to solve problems with interval, step, and crisp preferences without calculating slopes. Compared with FPP approach [1], the proposed approach can improve multiple solutions problems, deal with step preferences, and release the requirement for prespecified tolerance parameters.In addition, the proposed approach can treat incomplete preference matrices with flexibility in reducing the number of pairwise comparisons required and can also be conveniently developed into a decision support system. In future studies, determining how to incorporate more types of uncertain preferences and provide visual aids for decision makers can be addressed.



---

*Source: 323468-2013-06-27.xml*