There are many researches deals with constructing an efficient solutions for real problem having Multi - objective confronted with each others. In this paper we construct a decision for Multi – objectives based on building a mathematical model formulating a unique objective function by combining the confronted objectives functions. Also we are presented some theories concerning this problem. Areal application problem has been presented to show the efficiency of the performance of our model and the method. Finally we obtained some results by randomly generating some problems.

In this paper, we develop the Hille and Nehari Type criteria for the oscillation of all solutions to the Fractional Differential Equations involving Conformable fractional derivative. Some new oscillatory criteria are obtained by using the Riccati transformations and comparison technique. We show the validity and effectiveness of our results by providing various examples.

       In this paper, the classical continuous triple optimal control problem (CCTOCP) for the triple nonlinear parabolic boundary value problem (TNLPBVP) with state vector constraints (SVCs) is studied.  The solvability theorem for the classical continuous triple optimal control vector CCTOCV with the SVCs is stated and proved. This is done under suitable conditions. The mathematical formulation of the adjoint triple boundary value problem (ATHBVP) associated with TNLPBVP is discovered. The Fréchet derivative of the Hamiltonian" is derived.  Under suitable conditions, theorems of necessary  and sufficient conditions for the optimality of the TNLPBVP with the SVCs are stated and proved.    

B Saleem, H Alwan, L Khalid, Journal of Engineering, 2011 - Cited by 2

This paper compares between the direct and indirect georeferencing techniques in Photogrammetry bases on a simulation model. A flight plan is designed which consists of three strips with nine overlapped images for each strip by a (Canon 500D) digital camera with a resolution of 15 Mega Pixels.

The triangulation computations are carried out by using (ERDAS LPS) software, and the direct measurements are taken directly on the simulated model to substitute using GPS/INS in real case. Two computational tests have been implemented to evaluate the positional accuracy for the whole model and the Root Mean Square Error (RMSE) relating to (30) check points show that th

       The basic goal of this research is to utilize an analytical method which is called the Modified Iterative Method in order to gain an approximate analytic solution to the Sine-Gordon equation. The suggested method is the amalgamation of the iterative method and a well-known technique, namely the Adomian decomposition method. A method minimizes the computational size, averts round-off errors, transformation and linearization, or takes some restrictive assumptions. Several examples are chosen to show the importance and effectiveness of the proposed method. In addition, a modified iterative method gives faster and easier solutions than other methods. These solutions are accurate and in agreement with the series

Non thermal argon plasma needle at atmospheric pressure was generated. The experimental set up is based on very simple and low cost electric components that generate electrical field sufficiently high at the electrodes to ionize various gases, which flow at atmospheric pressure. The high d.c power supply is 7.5kV peak to peak, the frequency of the electrical field is 28kHz, and the plasma power less than 15W. The plasma is generated using only one electrode. In the present work the voltage and current discharge waveform are measured. Also the temperature of the working Ar gas at different gas flow and distances from the plasma electrode tip was recorded

Metaheuristic is one of the most well-known fields of research used to find optimum solutions for non-deterministic polynomial hard (NP-hard) problems, for which it is difficult to find an optimal solution in a polynomial time. This paper introduces the metaheuristic-based algorithms and their classifications and non-deterministic polynomial hard problems. It also compares the performance of two metaheuristic-based algorithms (Elephant Herding Optimization algorithm and Tabu Search) to solve the Traveling Salesman Problem (TSP), which is one of the most known non-deterministic polynomial hard problems and widely used in the performance evaluations for different metaheuristics-based optimization algorithms. The experimental results of Ele