An Efficient Ranking Technique for Intuitionistic Fuzzy Numbers with Its Application in Chance Constrained Bilevel Programming

Abstract

The aim of this paper is to develop a new ranking technique for intuitionistic fuzzy numbers using the method of defuzzification based on probability density function of the corresponding membership function, as well as the complement of nonmembership function. Using the proposed ranking technique a methodology for solving linear bilevel fuzzy stochastic programming problem involving normal intuitionistic fuzzy numbers is developed. In the solution process each objective is solved independently to set the individual goal value of the objectives of the decision makers and thereby constructing fuzzy membership goal of the objectives of each decision maker. Finally, a fuzzy goal programming approach is considered to achieve the highest membership degree to the extent possible of each of the membership goals of the decision makers in the decision making context. Illustrative numerical examples are provided to demonstrate the applicability of the proposed methodology and the achieved results are compared with existing techniques.

Animesh Biswas 1 and Arnab Kumar De 2

Academic Editor:Kemal Kilic

1, Department of Mathematics, University of Kalyani, Kalyani 741235, India
2, Department of Mathematics, Government College of Engineering and Textile Technology, Serampore 712201, India

Received 22 November 2015; Revised 24 March 2016; Accepted 3 April 2016; 28 April 2016

This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

1. Introduction

The concept of bilevel programming problem (BLPP) was first introduced by Candler and Townsley [1]. The BLPP is considered as a class of optimization problems where two decision makers (DMs) locating at two different hierarchical levels independently control a set of decision variables paying serious attention to the benefit of the others in a highly conflicting decision making situation. The upper level DM is termed as leader and the lower level DM as follower. There are several applications of BLPP in many real life problems such as agriculture, biofuel production, economic systems, finance, engineering, banking, management sciences, and transportation problem. Several methods were proposed to solve BLPPs by different researchers [2, 3] in the past. But these traditional approaches are unable to provide a satisfactory solution if the parameter values involved with a BLPP inevitably contain some uncertain data or linguistic information. Stochastic programming (SP) and fuzzy programming (FP) are two powerful techniques to handle such type of problems. Using probability theory, Dantzig [4] introduced SP. The SP was developed in various directions like chance constrained programming (CCP), recourse programming, multiobjective SP, and so forth. Charnes and Cooper [5] developed the concept of CCP.

Again, from the viewpoint of uncertainty or fuzziness involved in human's judgments, Zimmermann [6] first applied fuzzy set theory [7] in decision making problems with several conflicting objectives. The concept of membership functions in BLPPs was introduced by Lai and Hwang [8]. Lai's solution concept was then extended by Shih et al. [9] and a supervised search procedure with the use of max-min operator of Bellman and Zadeh [10] was proposed. The basic concept of this procedure is that the follower optimizes his/her objective function, taking into consideration leader's goal. Recently, Lodwick and Kacprizyk [11] developed a methodology for solving decision making problems under fuzziness. The main difficulty of FP approach is that the objectives of the DMs are conflicting. So there is possibility of rejecting the solution again and again by the DMs and the solution process is continued by redefining the membership functions repeatedly until a satisfactory solution is obtained. This makes the solution process a very lengthy and tedious one. To remove these difficulties fuzzy goal programming (FGP) [12-14] is used as an efficient tool for making decision in an imprecisely defined multiobjective decision making (MODM) arena. Baky [15] developed a FGP technique for solving multiobjective multilevel programming problem.

Also it is observed that the fuzzy sets (FSs) are not always capable of dealing with lack of knowledge with respect to degrees of membership. Realizing the fact Atanassov [16-18] introduced the concept of intuitionistic FSs (IFSs) by implementing a nonmembership degree which can handle the drawback of FSs and express more abundant and flexible information than the FSs. In recent years, there is a growing interest in the study of decision making problems with intuitionistic fuzzy numbers (IFNs) [19-21] and with interval-valued intuitionistic fuzzy information [22-25].

The ranking of IFNs [26, 27] plays an important role in dealing with IFNs as ranking of fuzzy numbers (FNs). Grzegoraewski [28] suggested some methods for measuring distances between IFNs and interval-valued FNs, based on Hausdorff metric. The methodology for solving intuitionistic fuzzy linear programming problems with triangular IFNs (TIFNs) was developed by Dubey and Mehra [29] by converting the model into crisp linear programming problem. Li [30] developed a ratio ranking method for the TIFNs. Nehi [31] put forward a new ordering method of IFNs in which two characteristic values for IFNs are defined by the integral of the inverse fuzzy membership and nonmembership functions multiplied by the grade with powered parameters. Recently, numerous ranking methods for IFNs have been proposed in literature to rank IFNs [32-34]. Although many defuzzification methods have already been proposed so far, no method gives a right effective defuzzification output. Most of the existing defuzzification methods tried to make the estimation of IFNs in an objective way. This paper proposes a method using the concept probability density function of IFNs and Mellin's transform [35, 36] to find the ranking of normal IFNs. This ranking method removes the ambiguous outcomes and distinguishes the alternatives clearly.

In fuzzy BLPP [37] it is sometimes realized that the concept of membership function does not provide satisfactory solutions in a highly conflicting decision making situation. In this context IFNs can be used to capture both the membership and nonmembership degrees of uncertainties of both the DMs. Also there are some real world situations, where randomness and fuzziness occur simultaneously. The decision making problem having such type of ambiguous information is known as fuzzy stochastic programming problem. Many researchers [38-41] derived different methods to solve such type of decision making problems. But FGP approach for solving fuzzy stochastic linear BLPP with IFNs is yet to appear in the literature.

In the present study FGP process is adopted for solving bilevel intuitionistic FP problems where the parameters are expressed in terms of normal IFNs. A ranking technique for normal IFNs is first proposed and then using the proposed technique the model is converted into a deterministic problem. The individual optimal value of each objective is found in isolation to construct the fuzzy membership goals of each of the objectives. Finally, FGP model is developed for the achievement of highest degree of each of the defined membership goals to the extent possible by minimizing group regrets in the decision making context. To explore the potentiality of the proposed approach, two illustrative examples are considered and solved and the achieved solutions are compared with the predefined technique developed by Dubey and Mehra [29].

2. Preliminaries

In this section some basic concepts on FNs, triangular FNs (TFNs), IFNs, and triangular IFNs (TIFNs) are discussed.

2.1. FN [42]

A fuzzy set [figure omitted; refer to PDF] defined on the set of real numbers, [figure omitted; refer to PDF] , is said to be an FN if its membership function [figure omitted; refer to PDF] satisfies the following characteristics:

(i) [figure omitted; refer to PDF] is continuous.

(ii) [figure omitted; refer to PDF] for all [figure omitted; refer to PDF] .

(iii): [figure omitted; refer to PDF] is strictly increasing on [figure omitted; refer to PDF] and strictly decreasing on [figure omitted; refer to PDF] .

(iv) [figure omitted; refer to PDF] for all [figure omitted; refer to PDF] , where [figure omitted; refer to PDF] .

2.2. TFN [43]

An FN [figure omitted; refer to PDF] is said to be TFN if its membership function [figure omitted; refer to PDF] is given by [figure omitted; refer to PDF]

The TFN can be expressed in the form of Figure 1.

Figure 1: TFN.

[figure omitted; refer to PDF]

2.3. IFN [44]

An IFN [figure omitted; refer to PDF] is

(i) an IFS defined on [figure omitted; refer to PDF] ;

(ii) normal; that is, there exists [figure omitted; refer to PDF] such that [figure omitted; refer to PDF] and [figure omitted; refer to PDF] ;

(iii) : convex for the membership function [figure omitted; refer to PDF] ; that is, [figure omitted; refer to PDF] for all [figure omitted; refer to PDF] ;

(iv) concave for the nonmembership function [figure omitted; refer to PDF] ; that is, [figure omitted; refer to PDF] for all [figure omitted; refer to PDF] .

2.4. TIFN [30]

Let [figure omitted; refer to PDF] be a TIFN. Then the membership and the nonmembership function of [figure omitted; refer to PDF] are expressed as [figure omitted; refer to PDF] That TIFN is expressed by Figure 2.

Figure 2: TIFN.

[figure omitted; refer to PDF]

A TIFN is called normal if [figure omitted; refer to PDF] and [figure omitted; refer to PDF] for at least one [figure omitted; refer to PDF] .

3. Proposed Ranking Technique for Normal TIFN

Let [figure omitted; refer to PDF] be a normal TIFN. Then the membership and the nonmembership functions of [figure omitted; refer to PDF] are expressed as [figure omitted; refer to PDF] which is presented in Figure 3.

Figure 3: Triangular normal IFN.

[figure omitted; refer to PDF]

It is to be noted here that if the nonmembership value decreases, acceptance of the IFN increases. As a consequence, if the value of complement of the nonmembership function increases, the acceptance possibility of the IFN increases. Considering those concepts, membership functions as well as the complement of the nonmembership functions are taken into account to rank the IFNs. The complement of the nonmembership function of a normal TIFN [figure omitted; refer to PDF] is given by [figure omitted; refer to PDF] Let us define two probability density functions [figure omitted; refer to PDF] and [figure omitted; refer to PDF] corresponding to the membership function [figure omitted; refer to PDF] and the complement of the nonmembership function [figure omitted; refer to PDF] , respectively.

Let [figure omitted; refer to PDF] ; then [figure omitted; refer to PDF] implies [figure omitted; refer to PDF] ; that is, [figure omitted; refer to PDF] that is, [figure omitted; refer to PDF] Thus [figure omitted; refer to PDF] Similarly, defining [figure omitted; refer to PDF] , the constant [figure omitted; refer to PDF] and the function [figure omitted; refer to PDF] are obtained as [figure omitted; refer to PDF] Let [figure omitted; refer to PDF] be the probability density function corresponding to the normal TIFN [figure omitted; refer to PDF] which is defined as [figure omitted; refer to PDF] A technique for defuzzification of fuzzy number using Mellin's transform was developed by R. Saneifard and R. Saneifard [36]. There are lots of successful applications [45-49] of this technique. From that viewpoint, Mellin's transformation has been applied to find the defuzzified value of IFNs. Mellin's transform is given by [figure omitted; refer to PDF] Here [figure omitted; refer to PDF] denotes the random variable corresponding to the normal TIFN [figure omitted; refer to PDF] . Thus [figure omitted; refer to PDF] For [figure omitted; refer to PDF] , Mellin's transform converted to the definition of expectation of a random variable. Since the target is to find the expected or defuzzified value of TIFNs, [figure omitted; refer to PDF] has been considered.

Thus the crisp equivalent value of the normal TIFN is found as [figure omitted; refer to PDF] For any two normal TIFNs [figure omitted; refer to PDF] and [figure omitted; refer to PDF] if [figure omitted; refer to PDF] and [figure omitted; refer to PDF] represent their equivalent crisp values, then,

(1) [figure omitted; refer to PDF] if and only if [figure omitted; refer to PDF] ;

(2) [figure omitted; refer to PDF] if and only if [figure omitted; refer to PDF] ;

(3) [figure omitted; refer to PDF] if and only if [figure omitted; refer to PDF] .

It is worthy to mention here that Wang and Kerre [50] proposed seven axioms as the reasonable properties of ordering fuzzy quantities for an ordering approach. The properties of IFNs depend on two FSs, namely, membership function and nonmembership function; and it can easily be shown that all the seven axioms have been satisfied by the proposed ranking technique as described above.

The derived process of ranking of normal TIFNs is to be summarized through the following algorithm.

3.1. Solution Algorithm

Step 1.

Write the membership function [figure omitted; refer to PDF] and nonmembership function [figure omitted; refer to PDF] of the normal TIFN [figure omitted; refer to PDF] (refer to (3)).

Step 2.

Calculate the complement [figure omitted; refer to PDF] of the nonmembership function [figure omitted; refer to PDF] of the normal TIFN [figure omitted; refer to PDF] (refer to (4)).

Step 3.

Construct the probability density function [figure omitted; refer to PDF] for the membership function [figure omitted; refer to PDF] and [figure omitted; refer to PDF] for the complement of the nonmembership function [figure omitted; refer to PDF] of the normal TIFN [figure omitted; refer to PDF] (refer to (7) and (8)).

Step 4.

Take the convex combination of [figure omitted; refer to PDF] and [figure omitted; refer to PDF] to form the probability density function of the normal TIFN [figure omitted; refer to PDF] (refer to (9)).

Step 5.

Use Mellin's transform to calculate the crisp value of the normal TIFN [figure omitted; refer to PDF] (refer to (12)).

Step 6.

Stop.

3.2. Illustrative Example

The following three TIFNs are considered to find their equivalent crisp value by the proposed technique.

Let [figure omitted; refer to PDF] , [figure omitted; refer to PDF] , and [figure omitted; refer to PDF] be three TIFNs.

The membership function of the TIFN [figure omitted; refer to PDF] is given by [figure omitted; refer to PDF] The nonmembership function of [figure omitted; refer to PDF] is presented as [figure omitted; refer to PDF] The complement of the non-membership function [figure omitted; refer to PDF] is calculated as [figure omitted; refer to PDF] Let [figure omitted; refer to PDF] and [figure omitted; refer to PDF] be the respective density functions of the membership function and the complement of nonmembership function which are calculated as defined in the proposed methodology. Then the density function of the TIFN [figure omitted; refer to PDF] is considered as [figure omitted; refer to PDF] , [figure omitted; refer to PDF] .

Using Mellin's transform the crisp value of TIFN [figure omitted; refer to PDF] is calculated as [figure omitted; refer to PDF] . Similarly the crisp value of TIFNs [figure omitted; refer to PDF] and [figure omitted; refer to PDF] is evaluated as [figure omitted; refer to PDF] , [figure omitted; refer to PDF] , [figure omitted; refer to PDF] .

Thus the ordering in the proposed ranking technique is [figure omitted; refer to PDF] .

3.3. Comparison of the Proposed Ranking Method with the Predefined Methods

The proposed ranking technique is compared with other predefined ranking methods [29-34] to explore the consistency of the proposed ranking methodology through Table 1.

Table 1: Comparison between ranking techniques.

Methodology	IFN	Ranking value	Result
Dubey and Mehra [29]	[figure omitted; refer to PDF]	[figure omitted; refer to PDF]	[figure omitted; refer to PDF]
[figure omitted; refer to PDF]	[figure omitted; refer to PDF]
[figure omitted; refer to PDF]	[figure omitted; refer to PDF]
Li [30]	[figure omitted; refer to PDF]	[figure omitted; refer to PDF]	[figure omitted; refer to PDF]
[figure omitted; refer to PDF]	[figure omitted; refer to PDF]
[figure omitted; refer to PDF]	[figure omitted; refer to PDF]
Nehi [31]	[figure omitted; refer to PDF]	[figure omitted; refer to PDF]	[figure omitted; refer to PDF]
[figure omitted; refer to PDF]	[figure omitted; refer to PDF]
[figure omitted; refer to PDF]	[figure omitted; refer to PDF]
Wan [32]	[figure omitted; refer to PDF]	[figure omitted; refer to PDF] , [figure omitted; refer to PDF]	[figure omitted; refer to PDF]
[figure omitted; refer to PDF]	[figure omitted; refer to PDF]
[figure omitted; refer to PDF]	[figure omitted; refer to PDF] , [figure omitted; refer to PDF]
Wan and Yi [34]	[figure omitted; refer to PDF]	[figure omitted; refer to PDF]	[figure omitted; refer to PDF]
[figure omitted; refer to PDF]	[figure omitted; refer to PDF]
[figure omitted; refer to PDF]	[figure omitted; refer to PDF]
Wan et al. [33]	[figure omitted; refer to PDF]	[figure omitted; refer to PDF]	[figure omitted; refer to PDF]
[figure omitted; refer to PDF]	[figure omitted; refer to PDF]
[figure omitted; refer to PDF]	[figure omitted; refer to PDF]
Proposed method	[figure omitted; refer to PDF]	[figure omitted; refer to PDF]	[figure omitted; refer to PDF]
[figure omitted; refer to PDF]	[figure omitted; refer to PDF]
[figure omitted; refer to PDF]	[figure omitted; refer to PDF]

From Table 1 it is evident that the ordering obtained using the proposed methodology is identical in comparison with other techniques. This indicates that the proposed methodology is consistent with the other predefined techniques which can be considered as an alternative technique for ranking IFNs. However, the superiority of the proposed approach would be reflected in the context of solving BLPPs with TIFNs.

Using the proposed ranking method of normal TIFN a fuzzy stochastic linear bilevel programming (FSLBLP) model is developed and solved in the following section.

4. FSLBLP Model Formulation

An LFSBLP problem with normal TIFNs as coefficients is presented as follows: [figure omitted; refer to PDF] where [figure omitted; refer to PDF] and [figure omitted; refer to PDF] ( [figure omitted; refer to PDF] ; [figure omitted; refer to PDF] ; [figure omitted; refer to PDF] ) are normal TIFNs and [figure omitted; refer to PDF] is any real number that lies within [figure omitted; refer to PDF] . Here [figure omitted; refer to PDF] denotes fuzzy random variable following normal distribution whose mean [figure omitted; refer to PDF] and standard deviation [figure omitted; refer to PDF] are normal TIFNs and [figure omitted; refer to PDF] , [figure omitted; refer to PDF] , and [figure omitted; refer to PDF] denote fuzzily equal, less than or equal, and greater than or equal, respectively. The decision vector [figure omitted; refer to PDF] is controlled by the upper level DM and [figure omitted; refer to PDF] is controlled by the lower level DM; [figure omitted; refer to PDF] and [figure omitted; refer to PDF] .

4.1. FP Model Formulation [5]

Applying CCP technique, the probabilistic constraints [figure omitted; refer to PDF] ( [figure omitted; refer to PDF] ) are modified as follows: [figure omitted; refer to PDF] where the function [figure omitted; refer to PDF] represents the cumulative distribution function of the standard normal fuzzy random variate.

Hence the linear fuzzy BLPP is written in the following form as [figure omitted; refer to PDF]

4.2. Construction of Linear Bilevel Programming Model Using Proposed Ranking Method

In this subsection the proposed ranking function is applied to convert the FP model into a deterministic model. Using the linearity of ranking function, the above model is written as [figure omitted; refer to PDF] Using the parameters of TIFNs, model (19) is expressed as [figure omitted; refer to PDF] Now, the DMs are trying to optimize their objective independently under the system constraints defined above. Let [figure omitted; refer to PDF] and [figure omitted; refer to PDF] be the best value of the objective of the upper and lower level DMs, respectively, obtained by solving each objective independently. Since the DMs are trying to maximize their objective and they also want that the maximum value of the objective of the other level DM cannot exceed his minimum value of the objective, therefore, the worst values [figure omitted; refer to PDF] and [figure omitted; refer to PDF] are calculated by considering the best solution point of the other level DM. That is, [figure omitted; refer to PDF] Hence the fuzzy goal for each objective is expressed as [figure omitted; refer to PDF] Thus the membership function of the upper and lower level objective is constructed as [figure omitted; refer to PDF] With the help of the above membership functions, the FGP model is defined in the next section.

4.3. Weighted FGP Model Formulation

In FGP model formulation, the membership functions are first converted into flexible membership goals by introducing under- and overdeviational variables to each of them and thereby assigning the highest membership value (unity) as the aspiration level to each of them. Also it is evident that full achievement of all the membership goals is not possible in MODM context. So the underdeviational variables are minimized to achieve the best goal values of objectives in the decision making environment.

Thus a FGP model is formulated as [figure omitted; refer to PDF] where [figure omitted; refer to PDF] represents the numerical weights of the goals which are determined as [figure omitted; refer to PDF] The developed model (24) is solved to find the most satisfactory solution in the decision making environment.

4.4. Solution Algorithm

The methodology for developing the intuitionistic FSLBLP model is presented in the form of an algorithm as follows.

Step 1.

Apply CCP technique to all the fuzzy probabilistic constraints, to form a fuzzy linear bilevel programming model (refer to (18)).

Step 2.

Using the proposed ranking technique of IFNs, the deterministic linear bilevel model is developed (refer to (19)).

Step 3.

The individual optimal value of the objective of each DM is found in isolation.

Step 4.

The worst value of the objective of the DMs is evaluated at the best solution point of the other level DMs (refer to (21)).

Step 5.

Construct the fuzzy membership goals of the objective of each DM (refer to (22)).

Step 6.

FGP approach is used to achieve maximum degree of each of the membership goals (refer to (24)).

Step 7.

Stop.

5. Numerical Example

To illustrate the proposed methodology the following FSLBLP problem is considered with coefficients of objectives and system constraints are taken as normal TIFNs: [figure omitted; refer to PDF] where [figure omitted; refer to PDF] and [figure omitted; refer to PDF] denote fuzzy random variables following normal distribution. Here [figure omitted; refer to PDF] , [figure omitted; refer to PDF] , [figure omitted; refer to PDF] , [figure omitted; refer to PDF] , [figure omitted; refer to PDF] , [figure omitted; refer to PDF] , [figure omitted; refer to PDF] , and [figure omitted; refer to PDF] are all normal TIFNs. Then the TIFNs can be expressed as [figure omitted; refer to PDF] The mean [figure omitted; refer to PDF] and standard deviation [figure omitted; refer to PDF] of the fuzzy random variables [figure omitted; refer to PDF] following normal distribution are given as [figure omitted; refer to PDF] Applying CCP methodology the above linear fuzzy stochastic BLPP is converted into linear fuzzy BLPP as [figure omitted; refer to PDF] By applying the proposed ranking technique of normal TIFNs, the above IFNs are converted into the equivalent crisp values as [figure omitted; refer to PDF]

Hence the deterministic model of (29) is represented as [figure omitted; refer to PDF] Now, each objective is considered independently and is solved with respect to the system of constraints in (31) to find the individual optimal values of the objectives. The results are obtained as [figure omitted; refer to PDF] The worst values of [figure omitted; refer to PDF] and [figure omitted; refer to PDF] are obtained by putting the best solution point of the 2nd and 1st objective, respectively. Thus [figure omitted; refer to PDF] and [figure omitted; refer to PDF] .

Then the fuzzy goals of the objectives are found as [figure omitted; refer to PDF] .

The membership function of the objectives is written as [figure omitted; refer to PDF] Hence the FGP model can be presented by eliciting the membership goals as [figure omitted; refer to PDF] where [figure omitted; refer to PDF] , [figure omitted; refer to PDF] , [figure omitted; refer to PDF] , and [figure omitted; refer to PDF] with [figure omitted; refer to PDF] .

Now solving the above model using software LINGO (ver. 11 ) the solutions are found as [figure omitted; refer to PDF] , [figure omitted; refer to PDF] with objective values [figure omitted; refer to PDF] and [figure omitted; refer to PDF] .

The solutions achieved through FGP technique are summarized in Table 2.

Table 2: Compromise solution obtained by proposed methodology.

Objective	Solution point	Ranking value of the objective	Membership value
[figure omitted; refer to PDF]	[figure omitted; refer to PDF] , [figure omitted; refer to PDF]	[figure omitted; refer to PDF]	[figure omitted; refer to PDF]
[figure omitted; refer to PDF]	[figure omitted; refer to PDF]	[figure omitted; refer to PDF]

If the numerical example presented in this section is solved by applying the ranking technique of IFN developed by Dubey and Mehra [29], then the objective values are obtained as [figure omitted; refer to PDF] and [figure omitted; refer to PDF] . The solutions achieved by two ranking techniques are summarized in Table 3.

Table 3: Comparison of solutions between existing and proposed techniques.

Ranking technique	Solution point	Objective values	Membership value
Dubey and Mehra [29]	[figure omitted; refer to PDF]	[figure omitted; refer to PDF]	[figure omitted; refer to PDF]
[figure omitted; refer to PDF]	[figure omitted; refer to PDF]	[figure omitted; refer to PDF]
Proposed technique	[figure omitted; refer to PDF]	[figure omitted; refer to PDF] 4.48	[figure omitted; refer to PDF]
[figure omitted; refer to PDF]	[figure omitted; refer to PDF]	[figure omitted; refer to PDF]

This comparison can also be shown graphically as in Figure 4.

Figure 4: Comparison of solutions.

[figure omitted; refer to PDF]

From the comparison table and from Figure 4 it is realized that better objective values are obtained if the example is solved by the proposed ranking technique. So the proposed ranking technique is more acceptable to the DMs in real life decision making context.

6. Conclusions

This paper presents a new ranking technique for normal TIFNs. The proposed methodology can be used to find the defuzzified value of intuitionistic trapezoidal FNs. Based on the proposed ranking technique an intuitionistic LFSBLP model is developed. This methodology covers a wider range of applications with enriched solutions than earlier techniques. The proposed model can also be applied to solve many real life decision making problems in which parameters are expressed in the form of IFNs. Further the proposed methodology can be used efficiently to solve multiobjective fractional programming problems, multilevel optimization problems, and other associated problems in an intuitionistic fuzzy stochastic decision making arena. However, it is hoped that the proposed methodology may open up new vistas into the way of making decision in an imprecisely defined decision making arena.

References

[1] W. Candler, R. Townsley, "A linear two-level programming problem," Computers and Operations Research , vol. 9, no. 1, pp. 59-76, 1982.

[2] W. F. Bialas, M. H. Karwan, "On two-level optimization," IEEE Transactions on Automatic Control , vol. 27, no. 1, pp. 211-214, 1982.

[3] W. F. Bialas, M. H. Karwan, "Two-level linear programming," Management Science , vol. 30, no. 8, pp. 1004-1020, 1984.

[4] G. B. Dantzig, "Linear programming under uncertainty," Management Science , vol. 1, pp. 197-206, 1955.

[5] A. Charnes, W. W. Cooper, "Chance-constrained programming," Management Science. Journal of the Institute of Management Science. Application and Theory Series , vol. 6, pp. 73-79, 1959/1960.

[6] H.-J. Zimmermann, "Fuzzy programming and linear programming with several objective functions," Fuzzy Sets and Systems , vol. 1, no. 1, pp. 45-55, 1978.

[7] L. A. Zadeh, "Fuzzy sets," Information and Control , vol. 8, no. 3, pp. 338-356, 1965.

[8] Y. J. Lai, C. L. Hwang Fuzzy Mathematical Programming Methods and Applications , Springer, Berlin, Germany, 1996.

[9] H.-S. Shih, Y.-J. Lai, E. S. Lee, "Fuzzy approach for multi-level programming problems," Computers and Operations Research , vol. 23, no. 1, pp. 73-91, 1996.

[10] R. E. Bellman, L. A. Zadeh, "Decision-making in a fuzzy environment," Management Science , vol. 17, pp. B141-B164, 1970.

[11] W. A. Lodwick, J. Kacprizyk Fuzzy Optimization , Springer, Berlin, Germany, 2010.

[12] E. L. Hannan, "Linear programming with multiple fuzzy goals," Fuzzy Sets and Systems , vol. 6, no. 3, pp. 235-248, 1981.

[13] R. Narasimhan, "On fuzzy goal programming-some comments," Decision Sciences , vol. 12, no. 3, pp. 532-538, 1981.

[14] B. B. Pal, B. N. Moitra, "A fuzzy goal programming procedure for solving quadratic bilevel programming problems," International Journal of Intelligent Systems , vol. 18, no. 5, pp. 529-540, 2003.

[15] I. A. Baky, "Solving multi-level multi-objective linear programming problems through fuzzy goal programming approach," Applied Mathematical Modelling. Simulation and Computation for Engineering and Environmental Systems , vol. 34, no. 9, pp. 2377-2387, 2010.

[16] K. T. Atanassov, "Intuitionistic fuzzy sets," Fuzzy Sets and Systems , vol. 20, no. 1, pp. 87-96, 1986.

[17] K. T. Atanassov Intuitionistic Fuzzy Sets , Springer, Heidelberg, Germany, 1999.

[18] K. T. Atanassov, "Two theorems for intuitionistic fuzzy sets," Fuzzy Sets and Systems , vol. 110, no. 2, pp. 267-269, 2000.

[19] D.-F. Li, "Multiattribute decision making models and methods using intuitionistic fuzzy sets," Journal of Computer and System Sciences , vol. 70, no. 1, pp. 73-85, 2005.

[20] D.-F. Li, "Extension of the LINMAP for multiattribute decision making under Atanassov's intuitionistic fuzzy environment," Fuzzy Optimization and Decision Making , vol. 7, no. 1, pp. 17-34, 2008.

[21] D.-F. Li, G.-H. Chen, Z.-G. Huang, "Linear programming method for multiattribute group decision making using IF sets," Information Sciences , vol. 180, no. 9, pp. 1591-1609, 2010.

[22] S.-P. Wan, D.-F. Li, "Fuzzy mathematical programming approach to heterogeneous multiattribute decision-making with interval-valued intuitionistic fuzzy truth degrees," Information Sciences , vol. 325, pp. 484-503, 2015.

[23] Y. X. Xue, J. X. You, X. D. Lai, H. C. Liu, "An interval-valued intuitionistic fuzzy MABAC approach for material selection with incomplete weight information," Applied Soft Computing , vol. 38, pp. 703-713, 2016.

[24] S.-P. Wan, J.-Y. Dong, "Interval-valued intuitionistic fuzzy mathematical programming method for hybrid multi-criteria group decision making with interval-valued intuitionistic fuzzy truth degrees," Information Fusion , vol. 26, pp. 49-65, 2015.

[25] S. H. R. Hajiagha, H. A. Mahdiraji, S. S. Hashemi, E. K. Zavadskas, "Evolving a linear programming technique for MAGDM problems with interval valued intuitionistic fuzzy information," Expert Systems with Applications , vol. 42, no. 23, pp. 9318-9325, 2015.

[26] H. B. Mitchell, "Ranking intuitionistic fuzzy numbers," International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems , vol. 12, no. 3, pp. 377-386, 2004.

[27] V. L. G. Nayagam, G. Venkateshwari, G. Sivaraman, "Ranking of intuitionistic fuzzy numbers," in Proceedings of the IEEE International Conference on Fuzzy Systems (FUZZ '08), pp. 1971-1974, Hong Kong, June 2008.

[28] P. Grzegoraewski, "The hamming distance between intuitionistic fuzzy sets," in Proceedings of the IFSA World Congress, pp. 223-227, 2003.

[29] D. Dubey, A. Mehra, "Linear programming with triangular intuitionistic fuzzy number," Advances in Intelligent Systems Research , vol. 1, pp. 563-569, 2011.

[30] D.-F. Li, "A ratio ranking method of triangular intuitionistic fuzzy numbers and its application to MADM problems," Computers & Mathematics with Applications , vol. 60, no. 6, pp. 1557-1570, 2010.

[31] H. M. Nehi, "A new ranking method for intuitionistic fuzzy numbers," International Journal of Fuzzy Systems , vol. 12, no. 1, pp. 80-86, 2010.

[32] S.-P. Wan, "Multi-attribute decision making method based on possibility variance coefficient of triangular intuitionistic fuzzy numbers," International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems , vol. 21, no. 2, pp. 223-243, 2013.

[33] S.-P. Wan, Q.-Y. Wang, J.-Y. Dong, "The extended VIKOR method for multi-attribute group decision making with triangular intuitionistic fuzzy numbers," Knowledge-Based Systems , vol. 52, pp. 65-77, 2013.

[34] S. P. Wan, Z. H. Yi, "Power average of trapezoidal intuitionistic fuzzy numbers using strict t-norms and t-conorms," In press IEEE Transactions on Fuzzy Systems

[35] K. P. Yoon, "A probabilistic approach to rank complex fuzzy numbers," Fuzzy Sets and Systems , vol. 80, no. 2, pp. 167-176, 1996.

[36] R. Saneifard, R. Saneifard, "A modified method for defuzzification by probability density function," Journal of Applied Sciences Research , vol. 7, no. 2, pp. 102-110, 2011.

[37] A. Biswas, K. Bose, "A fuzzy programming approach for solving quadratic bilevel programming problems with fuzzy resource constraints," International Journal of Operational Research , vol. 12, no. 2, pp. 142-156, 2011.

[38] B. Liu, K. Iwamura, "Chance constrained programming with fuzzy parameters," Fuzzy Sets and Systems , vol. 94, no. 2, pp. 227-237, 1998.

[39] M. K. Luhandjula, "Linear programming under randomness and fuzziness," Fuzzy Sets and Systems , vol. 10, no. 1, pp. 45-55, 1983.

[40] M. K. Luhandjula, "Mathematical programming in the presence of fuzzy quantities and random variables," Journal of Fuzzy Mathematics , vol. 11, no. 1, pp. 27-39, 2003.

[41] M. K. Luhandjula, M. M. Gupta, "On fuzzy stochastic optimization," Fuzzy Sets and Systems , vol. 81, no. 1, pp. 47-55, 1996.

[42] A. Kaufmann, M. M. Gupta Fuzzy Mathematical Models in Engineering and Management Science , North-Holland Publishing, 1988.

[43] A. Kaufmann, M. M. Gupta Introduction to Fuzzy Arithmetic: Theory and Applications , Van Nostrand Reinhold, 1985.

[44] G. S. Mahapatra, T. K. Roy, "Intuitionistic fuzzy number and its arithmetic operation with application on system failure," Journal of Uncertain Systems , vol. 7, no. 2, pp. 92-107, 2013.

[45] B. Epstein, "Some applications of the Mellin transform in statistics," Annals of Mathematical Statistics , vol. 19, pp. 370-379, 1948.

[46] P. E. Zwicke, I. Kiss Jr., "A new implementation of the Mellin transform and its application to radar classification of ships," IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 5, no. 2, pp. 191-199, 1983.

[47] F. R. Gerardi, "Application of mellin and hankel transforms to networks with time-varying parameters," IRE Transactions on Circuit Theory , vol. 6, no. 2, pp. 197-208, 1959.

[48] J. Peschon, "A modified form of the Mellin transform and its application to the optimum final value control problem,", no. 2102-1, Stanford Electronics Labs, Stanford University, Stanford, Calif, USA, 1965.

[49] B. A. Dolan, "The Mellin transform for moment-generation and for the probability density of products and quotients of random variables," Proceedings of the IEEE , vol. 52, pp. 1745-1746, 1964.

[50] X. Wang, E. E. Kerre, "Reasonable properties for the ordering of fuzzy quantities (I)," Fuzzy Sets and Systems , vol. 118, no. 3, pp. 375-385, 2001.