Among a variety of approaches introduced in the literature to establish duality theory, Fenchel duality was of great importance in convex analysis and optimization. In this paper we establish some conditions to obtain classical strong Fenchel duality for evenly convex optimization problems defined in infinite dimensional spaces. The objective function of the primal problem is a family of (possible) infinite even convex functions. The strong duality conditions we present are based on the consideration of the epigraphs of the c-conjugate of the dual objective functions and the ε-c-subdifferential of the primal objective functions.
A new human-based heuristic optimization method, named the Snooker-Based Optimization Algorithm (SBOA), is introduced in this study. The inspiration for this method is drawn from the traits of sales elites—those qualities every salesperson aspires to possess. Typically, salespersons strive to enhance their skills through autonomous learning or by seeking guidance from others. Furthermore, they engage in regular communication with customers to gain approval for their products or services. Building upon this concept, SBOA aims to find the optimal solution within a given search space, traversing all positions to obtain all possible values. To assesses the feasibility and effectiveness of SBOA in comparison to other algorithms, we conducte
... Show MoreWriting in English is one of the essential factors for successful EFL learning .Iraqi students at the preparatory schools encounter problems when using their background knowledge in handling subskills of writing(Burhan,2013:164).Therefore, this study aims to investigate the 4thyear preparatory school students’ problems in English composition writing, and find solutions to these pro
... Show MoreThe effect of the magnetic abrasive finishing (MAF) method on the temperature rise (TR), and material removal rate (MRR) has been investigated in this paper. Sixteen runs were to determine the optimum temperature in the contact area (between the abrasive powder and surface of workpiece) and the MRR according to Taguchi orthogonal array (OA). Four variable technological parameters (cutting speed, finishing time, working gap, and the current in the inductor) with four levels for each parameter were used, the matrix is known as a L16 (44) OA. The signal to noise ratio (S/N) ratio and analysis of the variance (ANOVA) were utilized to analyze the results using (MINITAB17) to find the optimum condition and identify the significant p
... Show MoreEach organization struggles to exploit each possible opportunity for gaining success and continuing with its work carrier. In this field, organization success can be concluded by fulfilling end user requirements combined with optimizing available resources usage within a specified time and acceptable quality level to gain maximum profit. The project ranking process is governed by the multi-criteria environment, which is more difficult for the governmental organization because other organizations' main target is maximizing profit constrained with available resources. The governmental organization should consider human, social, economic and many more factors. This paper focused on building a multi-criteria optimizing proje
... Show MoreCharge transfer complex formation method has been applied for the spectrophotometric determination of cimetidine, in bulk sample and dosage form. The method was accurate, simple, rapid, inexpensive and sensitive depending on the formed charge- transfer complex between cited drug and, 2,3-Dichloro-5,6-dicyano-p- benzoquinone (DDQ) as a chromogenic reagent. The formed complex shows absorbance maxima at 587 nm against reagent blank. The calibration graph is linear in the ranges of (5.0 - 50.0) µg.mL-1 with detection limit of 0.268µg.mL-1. The results show the absence of interferences from the excipients on the determination of the drug. Therefore the proposed method has been successfully applied for the determination of cimetid
... Show MoreIn this paper, two of the local search algorithms are used (genetic algorithm and particle swarm optimization), in scheduling number of products (n jobs) on a single machine to minimize a multi-objective function which is denoted as (total completion time, total tardiness, total earliness and the total late work). A branch and bound (BAB) method is used for comparing the results for (n) jobs starting from (5-18). The results show that the two algorithms have found the optimal and near optimal solutions in an appropriate times.
This paper devoted to the analysis of regular singular initial value problems for ordinary differential equations with a singularity of the first kind , we propose semi - analytic technique using two point osculatory interpolation to construct polynomial solution, and discussion behavior of the solution in the neighborhood of the regular singular points and its numerical approximation, two examples are presented to demonstrate the applicability and efficiency of the methods. Finally , we discuss behavior of the solution in the neighborhood of the singularity point which appears to perform satisfactorily for singular problems.
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 ampliï¬cation 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 scientiï¬c literature.