In this paper we present a new method for solving fully fuzzy multi-objective linear programming problems and find the fuzzy optimal solution of it. Numerical examples are provided to illustrate the method.

ان الغرض من هذا البحث هو المزج بين القيود الضبابية والاحتمالية. كما يهدف الى مناقشة اكثر حالات مشكلات البرمجة الضبابية شيوعا وهي عندما تكون المشكلة الضبابية تتبع دالة الانتماء مرة دالة الاتنماء المثلثية مرة اخرى، من خلال التطبيق العملي والتجريبي. فضلا عن توظيف البرمجة الخطية الضبابية في معالجة مشكلات تخطيط وجدولة الإنتاج لشركة العراق لصناعة الأثاث، وكذلك تم استخدام الطرائق الكمية للتنبؤ بالطلب واعتماده

In many applications such as production, planning, the decision maker is important in optimizing an objective function that has fuzzy ratio two functions which can be handed using fuzzy fractional programming problem technique. A special class of optimization technique named fuzzy fractional programming problem is considered in this work when the coefficients of objective function are fuzzy. New ranking function is proposed and used to convert the data of the fuzzy fractional programming problem from fuzzy number to crisp number so that the shortcoming when treating the original fuzzy problem can be avoided. Here a novel ranking function approach of ordinary fuzzy numbers is adopted for ranking of triangular fuzzy numbers with simpler an

     In this article, we aim to define a universal set consisting of the subscripts of the fuzzy differential equation (5) except the two elements  and , subsets of that universal set are defined according to certain conditions. Then, we use the constructed universal set with its subsets for suggesting an analytical method which facilitates solving fuzzy initial value problems of any order by using the strongly generalized H-differentiability. Also, valid sets with graphs for solutions of fuzzy initial value problems of higher orders are found.

The aims of the paper are to present a modified symmetric fuzzy approach to find the best workable compromise solution for quadratic fractional programming problems (QFPP) with fuzzy crisp in both the objective functions and the constraints. We introduced a modified symmetric fuzzy by proposing a procedure, that starts first by converting the quadratic fractional programming problems that exist in the objective functions to crisp numbers and then converts the linear function that exists in the constraints to crisp numbers. After that, we applied the fuzzy approach to determine the optimal solution for our quadratic fractional programming problem which is supported theoretically and practically. The computer application for the algo

    Fuzzy numbers are used in various fields such as fuzzy process methods, decision control theory, problems involving decision making, and systematic reasoning. Fuzzy systems, including fuzzy set theory. In this paper, pentagonal fuzzy variables (PFV) are used to formulate linear programming problems (LPP). Here, we will concentrate on an approach to addressing these issues that uses the simplex technique (SM). Linear programming problems (LPP) and linear programming problems (LPP) with pentagonal fuzzy numbers (PFN) are the two basic categories into which we divide these issues. The focus of this paper is to find the optimal solution (OS) for LPP with PFN on the objective function (OF) and right-hand side. New ranking f

In this paper, a new technique is offered for solving three types of linear integral equations of the 2^nd kind including Volterra-Fredholm integral equations (LVFIE) (as a general case), Volterra integral equations (LVIE) and Fredholm integral equations (LFIE) (as special cases). The new technique depends on approximating the solution to a polynomial of degree  and therefore reducing the problem to a linear programming problem(LPP), which will be solved to find the approximate solution of LVFIE. Moreover, quadrature methods including trapezoidal rule (TR), Simpson 1/3 rule (SR), Boole rule (BR), and Romberg integration formula (RI) are used to approximate the integrals that exist in LVFIE. Also, a comparison between those

   The main focus of this research is to examine the Travelling Salesman Problem (TSP) and the methods used to solve this problem where this problem is considered as one of the combinatorial optimization problems which met wide publicity and attention from the researches for to it's simple formulation and important applications and engagement to the rest of combinatorial problems , which is based on finding the optimal path through known number of cities where the salesman visits each city only once before returning to the city of departure n this research , the benefits  of( FMOLP)   algorithm is employed as one of the best methods to solve the (TSP) problem and the application of the algorithm in conjun

Abstract

The use of modern scientific methods and techniques, is considered important topics to solve many of the problems which face some sector, including industrial, service and health. The researcher always intends to use modern methods characterized by accuracy, clarity and speed to reach the optimal solution and be easy at the same time in terms of understanding and application.

the research presented this comparison between the two methods of solution for linear fractional programming models which are linear transformation for Charnas & Cooper , and denominator function restriction method through applied on the oil heaters and gas cookers plant , where the show after reac