Solving Fuzzy Multi-objective Linear Programming Problems Using Multi-player Zero-Sum Game

In this paper, we discusses the problem that involving the conflict fuzzy multi-objective in transportation planning which is one of special case in multi-objective linear programming. To find the simultaneously optimal solution of the problem, we use the Interactive Fuzzy Multi-Objective Linear Programming (IFMOLP) method. This method can reduce the fuzzy multi-objective linear programming problem into deterministic single objective linear programming which can be solved using simplex method. Beside that , with IFMOLP method, decision maker (DM) can establish interactively the goal from the objective function to produce the pareto optimal solution so that.

Multi-criteria decision making method is used in such cases having multiple targets. Multi-objective linear programming problems, which deal with uncertain measurements for both objectives and constraints, are solved by fuzzy multi-objective linear programming methods. Analytic hierarchy process (AHP), one of the multi-criteria decision-making methods based on weighting of objectives, is designed to solve complex problems. In this study, multiple criteria decision making problems and decision makers’ opinions on these problems as well as their solution processes are discussed. Firstly, a fuzzy multi objective linear programming problem is solved using the approaches of Zimmerman and Hybrid. In the literature, these methods are applied using triangular fuzzy numbers based on decision makers’ opinions only in cases where the objective function is minimization. In this study, as an alternative to the triangular fuzzy numbers, trapezoidal fuzzy numbers are defined, and both minimization and maximization of objective functions are examined. Finally, a solution algorithm for a fuzzy multi-objective linear programming problem is proposed under some given conditions. The algorithm is applied to a sample problem that involves modeling of a congress organizing which aims to place attendees to accommodations under specific objectives and constraints. In the evaluation phase of the algorithm, targets are weighted by using triangular and trapezoidal fuzzy numbers. At the end, the results of the proposed algorithm are compared with the results of other methods in the literature.

Solving fuzzy multi-objective linear programming problems using deviation degree measures and weighted max–min method

The purpose of this paper is to develop a new two-stage method for fuzzy multi-objective linear program and apply to engineering project portfolio selection. In the fuzzy multi-objective linear program, all the objective coefficients, technological coefficients and resources are trapezoidal fuzzy numbers (TrFNs). An order relationship for TrFNs is introduced by using the interval expectation of TrFNs. In the first stage, the fuzzy multi-objective linear program with TrFNs is transformed into an interval multi-objective linear program according to the order relationship of TrFNs. Combining the ranking order relation between intervals with the satisfactory crisp equivalent forms of interval inequality relations, the interval multi-objective linear program is further transformed into a crisp multi-objective linear program. In the second stage, the positive and negative ideal solutions are calculated as well as the closeness degrees from the positive ideal solution to all objectives on the basis of the TOPSIS (Technique for Order Preference by Similarity to Ideal Solution). Then, using the closeness degrees, we convert the crisp multi-objective linear program into mono-objective program to solve. The proposed method is not only mathematically rigorous, but also can adequately consider the acceptance degree of decision maker that the fuzzy constraints may be violated. The other possible cases of the fuzzy multi-objective linear program are also discussed. The proposed method is illustrated by means of a project portfolio selection problem.

Study on multi-objective linear fractional programming problem involving pentagonal intuitionistic fuzzy number

In this paper, we focus on large-scale multiobjective fuzzy linear programming problems with the block angular structure and examine the efficiency of the Dantzig-Wolfe decomposition method in the interactive fuzzy satisficing method proposed by M. Sakawa et al. After overviewing the Dantzig-Wolfe decomposition method (1961) and the interactive fuzzy satisficing method, three-objective linear programming problems with 15 coupling constraints are considered in order to show the efficiency of the Dantzig-Wolfe decomposition method over the revised simplex method. Through a lot of computational experiments on workstation for numerical examples with both 50 and 200 variables, the advantages of the Dantzig-Wolfe decomposition method are discussed with respect to processing time and required memory storage.

A new approach is undertaken to solve the fully fuzzy multiobjective linear programming (FFMLP) problem. The coefficients of the objective functions, constraints, right-hand-side parameters, and variables are of the triangular fuzzy number (T r FN)s. A solution strategy, called compromise solution algorithm (CSA), is presented using a three-step procedure. First, a revised simplex method together with Gaussian elimination in the environment of the linear ranking function is used to convert the FFMLP problems partially into semi fully fuzzy multiobjective linear programming (SFFMLP) problems. Then, the obtained SFFMLP problems are gathered together as a single problem. Finally, the gathered problem is solved by one of four different methods to find a fuzzy compromise solution for the FFMLP problems. The CSA is then numerically applied to a FFMLP problem to illustrate the practicability of the proposed procedure.

We attempt to find solutions to the fully fuzzified linear program where all the parameters and variables are fuzzy numbers. We first change the problem of maximizing a fuzzy number, the value of the objective function, into a multiobjective fuzzy linear programming problem. We prove that fuzzy flexible programming can be used to explore the whole undominated set to the multiobjective fuzzy linear program. An evolutionary algorithm is designed to solve the fuzzy flexible program. The program was applied to two applications with good solutions.

A bipolar approach in fuzzy multi-objective linear programming

This article addresses a special class of non-linear programming problems, viz., linear fractional programming problems having multiple objectives. In solving the real-life linear fractional optimization problems, the ambiguity and hesitation in the decision are inherent and ever-present, therefore, it is perfectly viable to formulate and solve these optimization models using the intuitionistic fuzzy environment. The purpose of this study is to propose a simple and computationally efficient approach to obtain the solution of multiple objective linear fractional programming problems having all the decision variables and parameters expressed in terms of triangular intuitionistic fuzzy numbers. The proposed solution algorithm is primarily based on the goal programming approach, fuzzy-based linearization technique, and a membership function strategy. The original linear fractional programming problem is first converted to its equivalent deterministic/crisp multi-objective linear fractional optimization problem using the weighted goal programming methodology along with the linear membership technique to resolve the intuitionistic fuzzy constraints into the crisp one. Finally, the variable transformation technique for the under- and over-deviational variables of the goal programming model is employed to linearize all the fractions involved in the problem so as to convert the original problem to an equivalent linear optimization problem. Further, this linear programming problem can be solved using any available commercial packages. Moreover, a numerical illustration is provided to demonstrate the steps of the proposed technique followed by the analysis and solution of an E-education set-up problem. The discussion and comparisons of the practical case establish the relevancy and usefulness of the proposed model.

On computational methods for solutions of multiobjective linear production programming games

The aim of this paper is twofold. Firstly, to define a solution concept of Pareto-optimality for a multi-objective flexible linear programming (MOFLP) problem (or multi-objective fuzzy linear programming problem) and design a method to extract a Pareto-optimal solution of MOFLP problem from the set of optimal solutions of equivalent optimization problem formulated by Dubey and Mehra (2013). Secondly, to extend this study to multi-objective linear programming problem involving hard and flexible constraints with interval uncertainty. A flexible constraint with interval uncertainty generalizes a flexible constraint by allowing preferences to be expressed in the form of intervals. An optimistic-pessimistic approach is proposed to solve multi-objective flexible linear programming with interval uncertainty (MOFLPIU) using an interval-valued fuzzy set representation and the Hurwicz optimism-pessimism criterion.

A method for generating all efficient solutions of 0-1 multi-objective linear programming problem

In this paper, statistical averaging method (arithmetic mean, geometric mean) and new statistical averaging method (new arithmetic mean, new geometric mean) have been proposed for extreme point multi-objective linear programming problem (EPMOLPP). Extreme point can be taken from graphical representation of linear programming problem (LPP). Graphical solution of LPP has been discussed in this research The objective of this method is for making single objective from multi-objective extreme point linear programming problem. Chandra Sen’s method is for making single objective from multi-objective linear programming problem (MOLPP). Here Chandra Sen’s method has also been used to solve EPMOLPP. An algorithm and program solution have been given for our proposed method to solve such type of problems. A numerical example is given and the result in Table 2 indicates that the proposed technique gives better results.

A general concept for solving linear multicriteria programming problems with crisp, fuzzy or stochastic values