In this paper, a new technique is offered for solving three types of linear integral equations of the 2nd 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 methods i

In this paper, a new technique is offered for solving three types of linear integral equations of the 2nd 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 methods is

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

We use of multi-choice Goal Programming (MCGP), which is a developed model of Goal Programming where it is used in circumstances of the multiplicity and difference of goals when choosing between decision alternatives in cases of allocating resources, as it is a model that seeks to find the closest and best solutions to the specific values ​​of the goals within the aspiration levels, as the first goal in the multi-choice goal programming model that is used to reduce the total cost of storage and shortage, while the other goal was to reduce the difference between the real demand that the hospitals need from the blood transfusion center and the units that already achieved. The case Iraqi Center

The learner has face difficult in learning if not accompanied by strong motivation and directed towards the goals that set for himself,as the type of goals set by the learner for himself is behind the difference in achievement of the tasks and levels of learning, and these goals are directed and determine his behavior Academic in the way of his study and his direction towards the lecture and colleagues.

Current research aims:

• Build tools for thegoal orientations
• Measuring the goal orientations for the university studentsaccording to variables (type/class/specialization).

In order to achieve the objectives of the research, a tool was constructed for the (the Goal orientation), and the psych

   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

This article introduces a novel procedure to detect an approximate solution to Fredholm fractional integro-differential equations with linear type (LFFIDE) defined using Caputo fractional derivative. The new procedure approximates the solution using three types of polynomials: Laguerre polynomials, Hermite polynomials, and Legendre polynomials, thereafter transforming the problem into a linear programming problem. The approximate solutions are compared using testing examples to examine the efficiency of the suggested approach. Also, a comparison with the other methods using the same polynomials illustrates The effectiveness and consistency of the proposed technique. Finally, the error analysis of the proposed technique and convergent are di

In this work, we first construct Hermite wavelets on the interval [0,1) with it’s product, Operational matrix of integration 2^k M×2^k M is derived, and used it for solving nonlinear Variational problems with reduced it to a system of algebric equations and aid of direct method. Finally, some examples are given to illustrate the efficiency and performance of presented method.

The paper is devoted to solve nth order linear delay integro-differential equations of convolution type (DIDE's-CT) using collocation method with the aid of B-spline functions. A new algorithm with the aid of Matlab language is derived to treat numerically three types (retarded, neutral and mixed) of nth order linear DIDE's-CT using B-spline functions and Weddle rule for calculating the required integrals for these equations. Comparison between approximated and exact results has been given in test examples with suitable graphing for every example for solving three types of linear DIDE's-CT of different orders for conciliated the accuracy of the results of the proposed method.

The development of information systems in recent years has contributed to various methods of gathering information to evaluate IS performance. The most common approach used to collect information is called the survey system. This method, however, suffers one major drawback. The decision makers consume considerable time to transform data from survey sheets to analytical programs. As such, this paper proposes a method called ‘survey algorithm based on R programming language’ or SABR, for data transformation from the survey sheets inside R environments by treating the arrangement of data as a relational format. R and Relational data format provide excellent opportunity to manage and analyse the accumulated data. Moreover, a survey syste