In this paper, a new class of nonconvex sets and functions called strongly -convex sets and strongly -convex functions are introduced. This class is considered as a natural extension of strongly -convex sets and functions introduced in the literature. Some basic and differentiability properties related to strongly -convex functions are discussed. As an application to optimization problems, some optimality properties of constrained optimization problems are proved. In these optimization problems, either the objective function or the inequality constraints functions are strongly -convex.
The research aims to study and analysis of concurrent engineering (CE) and cost optimization (CO), and the use of concurrent engineering inputs to outputs to improve the cost, and the statement of the role of concurrent engineering in improving the quality of the product, and achieve savings in the design and manufacturing time and assembly and reduce costs, as well as employing some models to determine how much the savings in time, including the model (Lexmark) model (Pert) to determine the savings in design time for manufacturing and assembly time.
To achieve the search objectives, the General Company for Electrical and Electronic Industries \ Refrigerated Engine
... Show MoreThe main aim of this research is to introduce financing cost optimization and different financing alternatives. There are many studies about financing cost optimization. All previous studies considering the cost of financing have many shortcomings, some considered only one source of financing as a credit line without taking into account different financing alternatives. Having only one funding alternative powers, restricts contractors and leads to a very specific financing model. Although it is beneficial for the contractor to use a long-term loan to minimize interest charges and prevent a substantial withdrawal from his credit line, none of the existing financial-based planning models have considered long-term loans in
... Show MoreAbstract
This study investigated the optimization of wear behavior of AISI 4340 steel based on the Taguchi method under various testing conditions. In this paper, a neural network and the Taguchi design method have been implemented for minimizing the wear rate in 4340 steel. A back-propagation neural network (BPNN) was developed to predict the wear rate. In the development of a predictive model, wear parameters like sliding speed, applying load and sliding distance were considered as the input model variables of the AISI 4340 steel. An analysis of variance (ANOVA) was used to determine the significant parameter affecting the wear rate. Finally, the Taguchi approach was applied to determine
... Show MoreSolid waste is a major issue in today's world. Which can be a contributing factor to pollution and the spread of vector-borne diseases. Because of its complicated nonlinear processes, this problem is difficult to model and optimize using traditional methods. In this study, a mathematical model was developed to optimize the cost of solid waste recycling and management. In the optimization phase, the salp swarm algorithm (SSA) is utilized to determine the level of discarded solid waste and reclaimed solid waste. An optimization technique SSA is a new method of finding the ideal solution for a mathematical relationship based on leaders and followers. It takes a lot of random solutions, as well as their outward or inward fluctuations, t
... Show MoreThe Traveling Salesman Problem is a story application of Atom Swarm Optimizations in this research. We have developed several novel techniques intended for solving TSP with PSO. Additionally, we introduced the notions to Swap Operative and Swap Chronological sequence and redefining the remaining operatives their foundation; that way, the study created unique PSO. Research prove it can produce satisfactory outcomes. The aim of this paper be there to assess the functioning of particle swarm optimization, for the going salesman issue TSP. The solution to this trouble is common to be NP-hard, it has N! permutations. The study's goal is to examine the capacity of both algorithms to solve intercontinental and other benchmark problems. Overall, th
... Show MoreThis paper proposes a novel meta-heuristic optimization algorithm called the fine-tuning meta-heuristic algorithm (FTMA) for solving global optimization problems. In this algorithm, the solutions are fine-tuned using the fundamental steps in meta-heuristic optimization, namely, exploration, exploitation, and randomization, in such a way that if one step improves the solution, then it is unnecessary to execute the remaining steps. The performance of the proposed FTMA has been compared with that of five other optimization algorithms over ten benchmark test functions. Nine of them are well-known and already exist in the literature, while the tenth one is proposed by the authors and introduced in this article. One test trial was shown t
... Show MoreIn this paper, our purpose is to study the classical continuous optimal control (CCOC) for quaternary nonlinear parabolic boundary value problems (QNLPBVPs). The existence and uniqueness theorem (EUTh) for the quaternary state vector solution (QSVS) of the weak form (WF) for the QNLPBVPs with a given quaternary classical continuous control vector (QCCCV) is stated and proved via the Galerkin Method (GM) and the first compactness theorem under suitable assumptions(ASSUMS). Furthermore, the continuity operator for the existence theorem of a QCCCV dominated by the QNLPBVPs is stated and proved under suitable conditions.