Contents IJPAM: Volume 116, No. 3 (2017)

  In this paper, the concept of normalized duality mapping has introduced in real convex modular spaces. Then, some of its properties have shown which allow dealing with results related to the concept of uniformly smooth convex real modular spaces. For multivalued mappings defined on these spaces, the convergence of a two-step type iterative sequence to a fixed point is proved

The purpose of this paper is to solve the stochastic demand for the unbalanced transport problem using heuristic algorithms to obtain the optimum solution, by minimizing the costs of transporting the gasoline product for the Oil Products Distribution Company of the Iraqi Ministry of Oil. The most important conclusions that were reached are the results prove the possibility of solving the random transportation problem when the demand is uncertain by the stochastic programming model. The most obvious finding to emerge from this work is that the genetic algorithm was able to address the problems of unbalanced transport, And the possibility of applying the model approved by the oil products distribution company in the Iraqi Ministry of Oil to m

Abstract  

  In this work, two algorithms of Metaheuristic algorithms were hybridized. The first is Invasive Weed Optimization algorithm (IWO) it is a numerical stochastic optimization algorithm and the second is Whale Optimization Algorithm (WOA) it is an algorithm based on the intelligence of swarms and community intelligence. Invasive Weed Optimization Algorithm (IWO) is an algorithm inspired by nature and specifically from the colonizing weeds behavior of weeds, first proposed in 2006 by Mehrabian and Lucas. Due to their strength and adaptability, weeds pose a serious threat to cultivated plants, making them a threat to the cultivation process. The behavior of these weeds has been simulated and used in Invas

              -convex sets and -convex functions, which are considered as an important class of generalized convex sets and convex functions, have been introduced and studied by Youness [5] and other researchers. This class has recently extended, by Youness, to strongly -convex sets and strongly -convex functions. In these generalized classes, the definitions of the classical convex sets and convex functions are relaxed and introduced with respect to a mapping . In this paper, new properties of strongly -convex sets are presented. We define strongly -convex hull, strongly -convex cone, and strongly -convex cone hull and we proof some of their properties.  Some examples to illustrate the aforementioned concepts and to cl

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.