Solution of Fully Bipolar Fuzzy Linear Programming Models

A suggested algorithm to solve triangular fuzzy rough integer linear programming (TFRILP) problems with α-level is introduced in this paper in order to find rough value optimal solutions and decision rough integer variables, where all parameters and decision variables in the constraints and the objective function are triangular fuzzy rough numbers. In real-life situations, the parameters of a linear programming problem model may not be defined precisely, because of the current market globalization and some other uncontrollable factors. In order to solve this problem, a proper methodology is adopted to solve the TFRILP problems by the slice-sum method with the branch-and-bound technique, through which two fuzzy integers linear programming (FILP) problems with triangular fuzzy interval coefficients and variables were constructed. One of these problems is an FILP problem, where all of its coefficients are the upper approximation interval and represent rather satisfactory solutions; the other is an FILP problem, where all of its coefficients are the lower approximation interval and represent completely satisfactory solutions. Moreover, α-level at α = 0.5 is adopted to find some other rough value optimal solutions and decision rough integer variables. Integer programming is used, since a lot of the linear programming problems require that the decision variables be integers. In addition, the motivation behind this study is to enable the decision makers to make the right decision considering the proposed solutions, while dealing with the uncertain and imprecise data. A flowchart is also provided to illustrate the problem-solving steps. Finally, two numerical examples are given to clarify the obtained results.

In this paper, we propose a method of solving the fully fuzzy linear fractional programming problems, Express all the parameters and variables are triangular fuzzy numbers. Convert all the triangular fuzzy numbers in their parametric form, we convert the fractional programming problem in to a single objective linear programming problem in parametric form. We put new fuzzy arithmetic and fuzzy ranking, we obtain the optimal solution the given fully fuzzy linear fractional programming problem without converting to its equivalent crisp linear programming problem. A numerical example is provided to illustrate the efficiency of the proposed method.

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.

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.

In this paper, an efficient approach is presented to solve fully fuzzy linear fractional programming problems. In this approach, first by Alpha-cuts on the objective function and the constraints, the problem is transforming into a bi-objective linear programming problem, and then the resulting problem is converted into two crisp linear programming problems. A numerical example is presented to illustrate the proposed approach. The obtained results demonstrate the acceptable performance of the proposed solution approach.

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

<abstract><p>The primary goal of optimization theory is to formulate solutions for real-life challenges that play a fundamental role in our daily lives. One of the most significant issues within this framework is the Linear Fractional Programming Problem (LFrPP). In practical situations, such as production planning and financial decision-making, it is often feasible to express objectives as a ratio of two distinct objectives. To enhance the efficacy of these problems in representing real-world scenarios, it is reasonable to utilize fuzzy sets for expressing variables and parameters. In this research, we have worked on the Fully Fuzzy Linear Fractional Linear Programming Problem (FFLFrLPP). In our approach to problem-solving, we simplified the intricate structure of the FFLFrLPP into a crisp Linear Programming Problem (LPP) while accommodating the inherent fuzziness. Notably, unlike literature, our proposed technique avoided variable transformation, which is highly competitive in addressing fuzzy-based problems. Our methodology also distinguishes itself from the literature in preserving fuzziness throughout the process, from problem formulation to solution. In this study, we conducted a rigorous evaluation of our proposed methodology by applying it to a selection of numerical examples and production problems sourced from the existing literature. Our findings revealed significant improvements in performance when compared to established solution approaches. Additionally, we presented comprehensive statistical analyses showcasing the robustness and effectiveness of our algorithms when addressing large-scale problem instances. This research underscores the innovative contributions of our methods to the field, further advancing the state-of-the-art in problem-solving techniques.</p></abstract>

In this paper, we develop a new algorithm for the initial fuzzy basic feasible solution to a transportation problem with imprecise parameters. All the decision variables are assumed to be triangular fuzzy numbers or trapezoidal fuzzy numbers or real numbers. By applying the efficient ranking function and arithmetic operations the solution is obtained without changing it into its crisp equivalent form. Using the parametric form of fuzzy numbers such as left fuzziness index, right fuzziness index, modal value and by using a proposed algorithm we obtained the initial basic fuzzy feasible solution to the problem. We further discuss the optimality by applying the modified distribution method. A numerical example is solved to show the effectiveness of the proposed algorithm.

ABSTRACTIn this paper, we consider a Fuzzy Stochastic Linear Fractional Programming problem (FSLFP). In this problem, the coefficients and scalars in the objective function are the triangular fuzzy number and technological coefficients and the quantities on the right side of the constraints are fuzzy random variables with the specific distribution. Here we change an FSLFP problem to an equivalent deterministic Multi-objective Linear Fractional Programming (MOLFP) problem. Then by using Fuzzy Mathematical programming approach transformed MOLFP problem is reduced single objective Linear programming (LP) problem. A numerical example is presented to demonstrate the effectiveness of the proposed method.

<p>There exist several methods for solving fuzzy linear or nonlinear programming problems under positivity fuzzy variables and restricted fuzzy coefficients. Due to the limitation of these methods, they can’t be applied for solving fully fuzzy linear or non- linear programming problems with unrestricted fuzzy coefficients and fuzzy variables. In this paper an efficient method to find the fuzzy optimal solution for fully fuzzy quadratic programming (FFQP) problem with unrestricted variables and parameters has been proposed. All the coefficients and decision variables of both objective functions and the constraints are triangular fuzzy numbers. The proposed method is based on converted FFQP problem into crisp quadratic programming (CQP) problem. Finally an illustrative numerical example has been given to clarify the proposed solution method.</p>

On LR-type fully intuitionistic fuzzy linear programming with inequality constraints: Solutions with unique optimal values

The present paper is devoted to the application of the space transformation technique for solving linear and nonlinear programming problems. By using a surjective mapping the initial constrained optimization problem is transformed to a problem in a new space with only equality constraints. For the numerical solution of the latter problem we use the generalized gradient-projection method and Newton’s method. After inverse transformation to the initial space we obtain the family of numerical methods for solving optimization problems with equality and inequality constraints. In the linear programming case after some simplification and after choosing a particular exponential transformation function we obtain from the proposed methods the well-known primal-dual interior point linear programming algorithm and the so-called “variation of Kermarkar’s algorithm”.

Multi-objective linear bi-level multi-follower programming problem (MOBLMFPP) is a special case of two level hierarchical programming problems in which the second level hierarchy includes multiple followers. This paper presents an alternate method based on fuzzy goal programming approach for the solution of multi-objective linear bi-level multi-follower programming (MOLBMFP) problem in which there is no sharing of information among followers. In the proposed FGP model formulation, each of objective functions of each level (leader and follower's level of MOLBMFPP) as well as decision variables at each level are characterised into fuzzy goals. Suitable linear membership functions are defined for each objective function and decision variables. Then minimising the sum of the negative deviational variables of both levels, the highest membership value of each of fuzzy goals is obtained. Existence of compromise optimal solution for MOLBMFPP is established in context of proposed approach. A numerical example is illustrated in support of proposed methodology. A comparative analysis is also carried out in order to show efficiency of proposed method over earlier method for the solution of MOLBMFPP.

Optimal multiobjective reservoir operation with fuzzy decision variables and resources: A compromise approach

In this paper, we propose a new model for linear fractional programming problem with absolute value functions. The major contribution of this paper is that transformation of linear fractional programming problem into separate linear programming problems with some theorems and then solution of these problems by popular algorithm. This work also used to simplex type algorithms to arrive at an optimal solution for a linear programming problem with absolute value. Moreover, we compare this method with an existing method. Numerical experiments are also given to illustrate the assertions.