This paper develop conventional Runge-Kutta methods of order four and order five to solve ordinary differential equations with oscillating solutions. The new modified Runge-Kutta methods (MRK) contain the invalidation of phase lag, phase lag’s derivatives, and amplification error. Numerical tests from their outcomes show the robustness and competence of the new methods compared to the well-known Runge-Kutta methods in the scientific literature.

The objective of an Optimal Power Flow (OPF) algorithm is to find steady state operation point which minimizes generation cost, loss etc. while maintaining an acceptable system performance in terms of limits on generators real and reactive powers, line flow limits etc. The OPF solution includes an objective function. A common objective function concerns the active power generation cost. A Linear programming method is proposed to solve the OPF problem. The Linear Programming (LP) approach transforms the nonlinear optimization problem into an iterative algorithm that in each iteration solves a linear optimization problem resulting from linearization both the objective function and constrains. A computer program, written in MATLAB environme

It is generally accepted that there are two spectrophotometric techniques for quantifying ceftazidime (CFT) in bulk medications and pharmaceutical formulations.  The methods  are described as simple, sensitive, selective, accurate and efficient techniques. The first method used an alkaline medium to convert ceftazidime to its diazonium salt, which is then combined with the 1-Naphthol (1-NPT) and 2-Naphthol (2-NPT) reagents. The azo dye that was produced brown  and red in color with absorption intensities of ƛmax 585 and 545nm respectively. Beer's law was followed in terms of concentration ranging from  (3-40) µg .ml^-1 For (CFT-1-NPT) and (CFT-2-NPT), the detection limits were 1.0096 and 0.8017 µg.ml^-1, respec

Scheduling considered being one of the most fundamental and essential bases of the project management. Several methods are used for project scheduling such as CPM, PERT and GERT. Since too many uncertainties are involved in methods for estimating the duration and cost of activities, these methods lack the capability of modeling practical projects. Although schedules can be developed for construction projects at early stage, there is always a possibility for unexpected material or technical shortages during construction stage. The objective of this research is to build a fuzzy mathematical model including time cost tradeoff and resource constraints analysis to be applied concurrently. The proposed model has been formulated using fuzzy the

This work describes two efficient and useful methods for solving fractional pantograph delay equations (FPDEs) with initial and boundary conditions. These two methods depend mainly on orthogonal polynomials, which are the method of the operational matrix of fractional derivative that depends on Bernstein polynomials and the operational matrix of the fractional derivative with Shifted Legendre polynomials. The basic procedure of this method is to convert the pantograph delay equation to a system of linear equations and by using, the operational matrices we get rid of the integration and differentiation operations, which makes solving the problem easier. The concept of Caputo has been used to describe fractional derivatives. Finally, some

One of the serious problems in any wireless communication system using multi carrier modulation technique like Orthogonal Frequency Division Multiplexing (OFDM) is its Peak to Average Power Ratio (PAPR).It limits the transmission power due to the limitation of dynamic range of Analog to Digital Converter and Digital to Analog Converter (ADC/DAC) and power amplifiers at the transmitter, which in turn sets the limit over maximum achievable rate.

        This issue is especially important for mobile terminals to sustain longer battery life time. Therefore reducing PAPR can be regarded as an important issue to realize efficient and affordable mobile communication services.

Machine scheduling problems (MSP) are     considered as one of the most important classes of combinatorial optimization problems. In this paper, the problem of job scheduling on a single machine is studied to minimize the multiobjective and multiobjective objective function. This objective function is: total completion time, total lead time and maximum tardiness time, respectively, which are formulated as  are formulated. In this study, a mathematical model is created to solve the research problem. This problem can be divided into several sub-problems and simple algorithms have been found to find the solutions to these sub-problems and compare them with efficient solutions. For this problem, some rules that provide efficient solutio