Interactive fuzzy programming for fuzzy random two-level linear programming problems through probability maximization with possibility

This paper considers two-level linear programming problems involving fuzzy random variables under cooperative behavior of the decision makers. Through the introduction of fuzzy goals together with possibility measures, the formulated fuzzy random two-level linear programming problem is transformed into the problem to maximize the satisfaction degree for each fuzzy goal. By adopting probability maximization, the transformed stochastic two-level programming problem can be reduced to a deterministic one. Interactive fuzzy programming to derive a satisfactory solution for the decision maker at the upper level in consideration of the cooperative relation between decision makers is presented. An illustrative numerical example demonstrates the feasibility and efficiency of the proposed method.     

Interactive fuzzy random cooperative two-level linear programming through level sets based probability maximization

In this paper, assuming cooperative behavior of the decision makers, two-level linear programming problems under fuzzy random environments are considered. To deal with the formulated fuzzy random two-level linear programming problems, α-level sets of fuzzy random variables are introduced and an α-stochastic two-level linear programming problem is defined for guaranteeing the degree of realization of the problem. Taking into account vagueness of judgments of decision makers, fuzzy goals are introduced and the α-stochastic two-level linear programming problem is transformed into the problem to maximize the satisfaction degree for each fuzzy goal. Through probability maximization, the transformed stochastic two-level programming problem can be reduced to a deterministic one. Interactive fuzzy programming to derive a satisfactory solution for the decision maker at the upper level in consideration of the cooperative relation between decision makers is presented. An illustrative numerical example is provided to demonstrate the feasibility and efficiency of the proposed method.     

Interactive intuitionistic fuzzy methods for multilevel programming problems

Multilevel programming problems model a decision-making process with a hierarchy structure. Traditional solution methods including vertex enumeration algorithms and penalty function methods are not only inefficient to obtain the solution of the multilevel programming problems, but also lead to a paradox that the follower’s decision power dominates the leader’s. In this paper, both multilevel programming and intuitionistic fuzzy set are used to model problems in hierarchy expert and intelligent systems. We first present a score function to objectively depict the satisfactory degrees of decision makers by virtue of the intuitionistic fuzzy set for solving multilevel programming problems. Then we develop three optimization models and three interactive intuitionistic fuzzy methods to consider different satisfactory solutions for the requirements of expert decision makers. Furthermore, a new distance function is proposed to measure the merits of a satisfactory solution. Finally, a case study for cloud computing pricing problems and several numerical examples are given to verify the applicability and the effectiveness of the proposed models and methods.     

On solutions of fuzzy random multiobjective quadratic programming with applications in portfolio problem

In this paper, a multiobjective quadratic programming problem fuzzy random coefficients matrix in the objectives and constraints and the decision vector are fuzzy variables is considered. First, we show that the efficient solutions fuzzy quadratic multiobjective programming problems series-optimal-solutions of relative scalar fuzzy quadratic programming. Some theorems are to find an optimal solution of the relative scalar quadratic multiobjective programming with fuzzy coefficients, having decision vectors as fuzzy variables. An application fuzzy portfolio optimization problem as a convex quadratic programming approach is discussed and an acceptable solution to such problem is given. At the end, numerical examples are illustrated in the support of the obtained results.     

INTERACTIVE FUZZY PROGRAMMING BASED ON FRACTILE CRITERION OPTIMIZATION MODEL FOR TWO-LEVEL STOCHASTIC LINEAR PROGRAMMING PROBLEMS

In this article, we focus on two-level linear programming problems involving random variable coefficients in objective functions and constraints. Following the concept of chance constrained programming, the two-level stochastic linear programming problems are transformed into deterministic ones based on the fractile criterion optimization model. After introducing fuzzy goals for objective functions, interactive fuzzy programming to derive a satisfactory solution for decision makers is presented as a fusion of a stochastic approach and a fuzzy one. An illustrative numerical example is provided to demonstrate the feasibility of the proposed method.     

An interval programming approach for the bilevel linear programming problem under fuzzy random environments

In this paper, we address a class of bilevel linear programming problems with fuzzy random variable coefficients in objective functions. To deal with such problems, we apply an interval programming approach based on the $\alpha $ -level set to construct a pair of bilevel mathematical programming models called the best and worst optimal models. Through expectation optimization model, the best and worst optimal problems are transformed into the deterministic problems. By means of the Kth best algorithm, we obtain the best and worst optimal solutions as well as the corresponding range of the objective function values. In this way, more information can be provided to the decision makers under fuzzy random circumstances. Finally, experiments on two examples are carried out, and the comparisons with two existing approaches are made. The results indicate the proposed approaches can get not only the best optimal solution (ideal solution) but also the worst optimal solution, and is more reasonable than the existing approaches which can only get a single solution (ideal solution).     

Random fuzzy multi-objective linear programming: Optimization of possibilistic value at risk (pVaR)

This paper considers multiobjective linear programming problems (MOLPP) where random fuzzy variables are contained in objective functions and constraints. A new decision making model optimizing possibilistic value at risk (pVaR) is proposed by incorporating the concept of value at risk (VaR) into possibility theory. It is shown that the original MOLPPs involving random fuzzy variables are transformed into deterministic problems. An interactive algorithm is presented to derive a satisficing solution for a decision maker (DM) from among a set of Pareto optimal solutions. Each Pareto optimal solution that is a candidate of the satisficing solution is exactly obtained by using convex programming techniques. A simple numerical example is provided to show the applicability of the proposed methodology to real-world problems with multiple objectives in uncertain environments.     

Using fuzzy numbers in linear programming

Managers, decision makers, and experts dealing with optimization problems often have a lack of information on the exact values of some parameters used in their problems. To deal with this kind of imprecise data, fuzzy sets provide a powerful tool to model and solve these problems. This paper studies a linear programming (LP) problem in which all its elements are defined as fuzzy sets. Special cases of this general model are found and reproduced, and it is shown that they coincide with the particular problems proposed in the literature by different authors and distinct approaches. Solution methods are also provided. They show how it is possible to address and solve linear programming problems with data given in a qualitative form, instead of the usual quantitative and precise way.     

Interactive multiobjective fuzzy random programming through the level set-based probability model

This paper considers a multiobjective linear programming problem involving fuzzy random variable coefficients. A new fuzzy random programming model is proposed by extending the ideas of level set-based optimality and a stochastic programming model. The original problem involving fuzzy random variables is transformed into a deterministic equivalent problem through the proposed model. An interactive algorithm is provided to obtain a satisficing solution for a decision maker from among a set of newly defined Pareto optimal solutions. It is shown that an optimal solution of the problem to be solved iteratively in the interactive algorithm is analytically obtained by a combination of the bisection method and the simplex method.     

An epsilon-constraint method for fully fuzzy multiobjective linear programming

Linear ranking functions are often used to transform fuzzy multiobjective linear programming (MOLP) problems into crisp ones. The crisp MOLP problems are then solved by using classical methods (eg, weighted sum, epsilon-constraint, etc), or fuzzy ones based on Bellman and Zadeh's decision-making model. In this paper, we show that this transformation does not guarantee Pareto optimal fuzzy solutions for the original fuzzy problems. By using lexicographic ranking criteria, we propose a fuzzy epsilon-constraint method that yields Pareto optimal fuzzy solutions of fuzzy variable and fully fuzzy MOLP problems, in which all parameters and decision variables take on LR fuzzy numbers. The proposed method is illustrated by means of three numerical examples, including a fully fuzzy multiobjective project crashing problem.     

A fuzzy interactive decision making algorithm for bilevel multi-followers programming with partial shared variables among followers

This paper studies a class of bilevel multi-followers programming in which there are partial shared variables among followers. A fuzzy interactive decision making approach is proposed to derive a satisfactory solution for decision makers not only considering the dominated action of the leader but also treating the ratios of satisfaction between the leader and the followers. Finally, a numerical example is illustrated to demonstrate the feasibility of the proposed approach.     

Possibilistic programming approach for fuzzy multidimensional analysis of preference in group decision making

Multiple attribute decision making (MADM) problems are the most encountered problems in decision making. Fuzziness is inherent in decision making process and linguistic variables are well suited to assessing an alternative on qualitative attributes using fuzzy rating. A few techniques in MADM assess the weights of attributes based on preference information on alternatives. But they are not practical any more when the set of all paired comparison judgments from decision makers (DMs) on attributes are not crisp and also we have to deal with fuzzy decision matrix. This paper investigates the generation of a possibilistic model for multidimensional analysis of preference (LINMAP). The model assesses the fuzzy weights as well as locating the ideal solution with fuzzy decision making preference on attributes and fuzzy decision matrix. All of the information is assumed as triangular fuzzy numbers (TFNs). This method is developed in group decision making environments and formulates the problem as a possibilistic programming with multiple objectives.     

系数为对称梯形模糊数的模糊线性规划

针对模糊系数的线性规划, 提出了一种系数为对称梯形模糊数的线性规划的方法, 同时得出一些定理、命题以及相应的算法, 并通过实例验证了该方法的有效性. 该方法与常规方法的不同之处在于无须将模糊线性规划转化为经典线性规划就能得到满意的模糊优化解, 因此提出的方法所取得的规划结果更加满足决策者的需要.     

A duality approach for solving bounded linear programming problems with fuzzy variables based on ranking functions and its application in bounded transportation problems

There are several methods, in the literature, for solving fuzzy variable linear programming problems (fuzzy linear programming in which the right-hand-side vectors and decision variables are represented by trapezoidal fuzzy numbers). In this paper, the shortcomings of some existing methods are pointed out and to overcome these shortcomings a new method based on the bounded dual simplex method is proposed to determine the fuzzy optimal solution of that kind of fuzzy variable linear programming problems in which some or all variables are restricted to lie within lower and upper bounds. To illustrate the proposed method, an application example is solved and the obtained results are given. The advantages of the proposed method over existing methods are discussed. Also, one application of this algorithm in solving bounded transportation problems with fuzzy supplies and demands is dealt with. The proposed method is easy to understand and to apply for determining the fuzzy optimal solution of bounded fuzzy variable linear programming problems occurring in real-life situations.     

Fuzzy random programming with equilibrium chance constraints

To model fuzzy random decision systems, this paper first defines three kinds of equilibrium chances via fuzzy integrals in the sense of Sugeno. Then a new class of fuzzy random programming problems is presented based on equilibrium chances. Also, some convex theorems about fuzzy random linear programming problems are proved, the results provide us methods to convert primal fuzzy random programming problems to their equivalent stochastic convex programming ones so that both the primal problems and their equivalent problems have the same optimal solutions and the techniques developed for stochastic convex programming can apply. After that, a solution approach, which integrates simulations, neural network and genetic algorithm, is suggested to solve general fuzzy random programming problems. At the end of this paper, three numerical examples are provided. Since the equivalent stochastic programming problems of the three examples are very complex and nonconvex, the techniques of stochastic programming cannot apply. In this paper, we solve them by the proposed hybrid intelligent algorithm. The results show that the algorithm is feasible and effectiveness.     

An intuitionistic fuzzy goal programming approach for finding pareto-optimal solutions to multi-objective programming problems

Multi-objective optimization in the intuitionistic fuzzy environment is the process of finding a Pareto-optimal solution that simultaneously maximizes the degree of satisfaction and minimizes the degree of dissatisfaction of an intuitionistic fuzzy decision. In this paper, a new method for solving multi-objective programming problems is developed that unlike other methods in the literature, provides compromise solutions satisfying both the conditions of intuitionistic fuzzy efficiency and Pareto-optimality. This method combines the advantages of the intuitionistic fuzzy sets concept, goal programming, and interactive procedures, and supports the decision maker in the process of solving programming problems with crisp, fuzzy, or intuitionistic fuzzy objectives and constraints. A characteristic of the proposed method is that it provides a well-structured approach for determining satisfaction and the dissatisfaction degrees that efficiently uses the concepts of violation for both objective functions and constraints. Another feature of the proposed method comes from its continuous interaction with the decision maker. In this situation, through adjusting the problem's parameters, the decision maker would have the ability of revisiting the membership and non-membership functions. Therefore, despite the lack of information at the beginning of the solving process, a compromise solution that satisfies the decision maker's preferences can be obtained. A further feature of the proposed method is the introduction of a new two-step goal programming approach for determining the compromise solutions to multi-objective problems. This approach ensures that the compromise solution obtained during each iterative step satisfies both the conditions of intuitionistic fuzzy efficiency and Pareto-optimality. The application of the proposed model is also discussed in this paper.     

Signed distance ranking based approach for solving bounded interval-valued fuzzy numbers linear programming problems

Fuzzy linear programming (FLP) problems with a wide varietyof applications in sciencesand engineering allow working with imprecise data and constraints, leading to more realistic models. The main contribution of this study is to deal with the formulation of a kind of FLP problems, known as bounded interval-valued fuzzy numbers linear programming (BIVFNLP) problems, with coefficients of decision variables in the objective function, resource vector, and coefficients of the technological matrix represented as interval-valued fuzzy numbers (IVFNs), and crisp decision variables limited to lower and upper bounds. Here, based on signed distance ranking to order IVFNs, the bounded simplex method is extended to obtain an interval-valued fuzzy optimal value for the BIVFNLP problem under consideration. Finally, one illustrative example is given to show the superiority of the proposed algorithm over the existing ones.     

矿山产能分配的变量模糊线性规划模型

针对矿山资源开采过程中产能不确定的分配问题,引入了模糊结构元素理论。将产能用结构元表示,并利用结构元加权序将模糊数比较转化为单调函数比较,将含有模糊变量的线性规划问题等价转化为经典线性规划问题。以某矿山为例,建立矿山产能分配的变量模糊线性规划模型,并进行求解。结果表明：实现了将实际问题中的模糊事件进行精确表达,原问题的求解更简便。得到矿山产能取得最大可能利润时的可能分配。应用结构元加权序求解的线性规划模型优于结构元元序的。     

Interactive fuzzy stochastic multi-level 0–1 programming using tabu search and probability maximization

In this paper, we consider interactive fuzzy programming for multi-level 0–1 programming problems involving random variable coefficients both in objective functions and constraints. Following the probability maximization model together with the concept of chance constraints, the formulated stochastic multi-level 0–1 programming problems are transformed into deterministic ones. Taking into account vagueness of judgments of the decision makers, we present interactive fuzzy programming. In the proposed interactive method, after determining the fuzzy goals of the decision makers at all levels, a satisfactory solution is derived efficiently by updating satisfactory levels of the decision makers with considerations of overall satisfactory balance among all levels. For solving the transformed deterministic problems efficiently, we also introduce novel tabu search for general 0–1 programming problems. A numerical example for a three-level 0–1 programming problem is provided to illustrate the proposed method.     

Fuzzy random chance-constrained programming

By fuzzy random programming, we mean the optimization theory dealing with fuzzy random decision problems. This paper presents a new concept of chance of fuzzy random events, and constructs a general framework of fuzzy random chance-constrained programming. We also design a spectrum of fuzzy random simulations for computing uncertain functions arising in the area of fuzzy random programming. To speed up the process of handling uncertain functions, we train a neural network to approximate uncertain functions based on the training data generated by fuzzy random simulation. Finally, we integrate the fuzzy random simulation, neural network, and genetic algorithm to produce a more powerful and effective hybrid intelligent algorithm for solving fuzzy random programming models and illustrate its effectiveness by some numerical examples