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

     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.

Optimization is essentially the art, science and mathematics of choosing the best among a given set of finite or infinite alternatives. Though currently optimization is an interdisciplinary subject cutting through the boundaries of mathematics, economics, engineering, natural sciences, and many other fields of human Endeavour it had its root in antiquity. In modern day language the problem mathematically is as follows - Among all closed curves of a given length find the one that closes maximum area. This is called the Isoperimetric problem. This problem is now mentioned in a regular fashion in any course in the Calculus of Variations. However, most problems of antiquity came from geometry and since there were no general methods to solve suc

Due to its importance in physics and applied mathematics, the non-linear Sturm-Liouville problems
witnessed massive attention since 1960. A powerful Mathematical technique called the Newton-Kantorovich
method is applied in this work to one of the non-linear Sturm-Liouville problems. To the best of the authors’
knowledge, this technique of Newton-Kantorovich has never been applied before to solve the non-linear
Sturm-Liouville problems under consideration. Accordingly, the purpose of this work is to show that this
important specific kind of non-linear Sturm-Liouville differential equations problems can be solved by
applying the well-known Newton-Kantorovich method. Also, to show the efficiency of appl

In this paper, game theory was used and applied to the transport sector in Iraq, as this sector includes two axes, the public transport axis and the second axis the private transport axis, as each of these axes includes several types of transport, namely (sea transport, air transport, land transport, transport by rail, port transport) and the travel and tourism sector, as public transport lacks this sector, as the competitive advantage matrix for the transport sector was formed and after applying the MinMax-MaxMin principle to the matrix in all its stages, it was found that there was an equilibrium point except for the last stage where the equilibrium point was not available Therefore, the use of the linear programming method was

Abstract :

The study aims at building a mathematical model for the aggregate production planning for Baghdad soft drinks company. The study is based on a set of aggregate planning strategies (Control of working hours, storage level control strategy) for the purpose of exploiting the resources and productive capacities available in an optimal manner and minimizing production costs by using (Matlab) program. The most important finding of the research is the importance of exploiting during the available time of production capacity. In the months when the demand is less than the production capacity available for investment. In the subsequent months when the demand exceeds the available energy and to minimize the use of overti

The problem of Bi-level programming is to reduce or maximize the function of the target by having another target function within the constraints. This problem has received a great deal of attention in the programming community due to the proliferation of applications and the use of evolutionary algorithms in addressing this kind of problem. Two non-linear bi-level programming methods are used in this paper. The goal is to achieve the optimal solution through the simulation method using the Monte Carlo method using different small and large sample sizes. The research reached the Branch Bound algorithm was preferred in solving the problem of non-linear two-level programming this is because the results were better.

Abstract: Word sense disambiguation (WSD) is a significant field in computational linguistics as it is indispensable for many language understanding applications. Automatic processing of documents is made difficult because of the fact that many of the terms it contain ambiguous. Word Sense Disambiguation (WSD) systems try to solve these ambiguities and find the correct meaning. Genetic algorithms can be active to resolve this problem since they have been effectively applied for many optimization problems. In this paper, genetic algorithms proposed to solve the word sense disambiguation problem that can automatically select the intended meaning of a word in context without any additional resource. The proposed algorithm is evaluated on a col