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

In this paper, we propose new types of non-convex functions called strongly --vex functions and semi strongly --vex functions. We study some properties of these proposed functions. As an application of these functions in optimization problems, we discuss some optimality properties of the generalized nonlinear optimization problem for which we use, as an objective function, strongly --vex function and semi strongly --vex function.

     In this paper, the Adomian decomposition method (ADM) is successfully applied to find the approximate solutions for the system of fuzzy Fredholm integral equations (SFFIEs) and we also study the convergence of the technique. A consistent way to reduce the size of the computation is given to reach the exact solution. One of the best methods adopted to determine the behavior of the approximate solutions. Finally, the problems that have been addressed confirm the validity of the method  applied in this research using a comparison by combining numerical methods such as the Trapezoidal rule and Simpson rule with ADM.

In this paper Hermite interpolation method is used for solving linear and non-linear second order singular multi point boundary value problems with nonlocal condition. The approximate solution is found in the form of a rapidly convergent polynomial. We discuss behavior of the solution in the neighborhood of the singularity point which appears to perform satisfactorily for singular problems. The examples to demonstrate the applicability and efficiency of the method have been given.

 The aim of this paper is to present a semi - analytic technique for solving singular initial value problems of ordinary differential equations with a singularity of different kinds to construct polynomial solution using two point  osculatory  interpolation.           The efficiency and accuracy of suggested method is assessed by comparisons with exact and other approximate solutions for a wide classes of non–homogeneous, non–linear singular initial value problems.             A new, efficient estimate of the global error is used for adaptive mesh selection. Also, analyze some of the numerical aspects

Decision making is vital and important activity in field operations research ,engineering ,administration science and economic science with any industrial or service company or organization because the core of management process as well as improve him performance . The research includes decision making process when the objective function is fraction function and solve models fraction programming by using some fraction programming methods and using goal programming method aid programming ( win QSB )and the results explain the effect use the goal programming method in decision making process when the objective function is
fraction .

While analytical solutions to Quadratic Assignment Problems (QAP) have indeed been since a long time, the expanding use of Evolutionary Algorithms (EAs) for similar issues gives a framework for dealing with QAP with an extraordinarily broad scope. The study's key contribution is that it normalizes all of the criteria into a single scale, regardless of their measurement systems or the requirements of minimum or maximum, relieving the researchers of the exhaustively quantifying the quality criteria. A tabu search algorithm for quadratic assignment problems (TSQAP) is proposed, which combines the limitations of tabu search with a discrete assignment problem. The effectiveness of the proposed technique has been compared to well-established a

In this research two algorithms are applied, the first is Fuzzy C Means (FCM) algorithm and the second is hard K means (HKM) algorithm to know which of them is better than the others these two algorithms are applied on a set of data collected  from the Ministry of Planning on the water turbidity of five areas in Baghdad to know which of these areas are less turbid in clear water to see which months during the year are less turbid in clear water in the specified area.