In this article, we view the Pareto and weak solutions of multiobjective optimization by using an approximate version KKT type conditions. one our main results Ekeland’s variational principle for vector-valued maps plays a key role. We also focus on improved Geoffrion proper it’s approximation characterize them through saddle point

efficient and on-time maintenance plays a crucial role inreducing cost and increasing the market share of an industrial unit. preventivemaintenance is a broad term that encompasses a set of activitiesaimed at improving the overall reliability and availability of a systembefore machinery breakdown. the previous studies have addressed thescheduling of preventive maintenance. these studies have co...

a wind turbine transformer (wtt) is designed using a 3d wound core while the transformer’s total owning cost (toc) and its inrush current performance realized as the two objective functions in a multi-objective optimization process. multi-objective genetic algorithm is utilized to derive pareto optimal solutions. the effects of inrush current improvement on other operating and design parameters...

Different implementation possibilities of an algorithm into hardware offer a variety of design solutions. Only best solutions so called pareto optimal solutions are for design decision of interest. Heuristic methods are preferred for the generation of these pareto optimal solutions, because exhaustive search methods cannot efficiently cope with this problem. This paper describes the mapping of ...

Most engineering optimization uses multiple objective functions rather than single objective function. To realize an artificial life algorithm based multi-objective optimization, this paper proposes a Pareto artificial life algorithm that is capable of searching Pareto set for multi-objective function solutions. The Pareto set of optimum solutions is found by applying two objective functions fo...

We analyze the Pareto efficiency, or inefficiency, of solutions to routing games and load balancing games, focusing on Nash equilibria and greedy solutions to these games. For some settings, we show that the solutions are necessarily Pareto optimal. When this is not the case, we provide a measure to quantify the distance of the solution from Pareto efficiency. Using this measure, we provide upp...

Many practical optimization problems usually have several conflicting objectives. In those multi-objective optimization, no solution optimizing all objective functions simultaneously exists in general. Instead, Pareto optimal solutions, which are “efficient” in terms of all objective functions, are introduced. In general we have many Pareto optimal solutions. Therefore, we need to decide a fina...

In multidisciplinary optimization a designer solves a problem where there are different criteria usually contradicting each other. In general, the solution of such a problem is not unique. When seeking an optimal design, it is natural to exclude from the consideration any design solution which can be improved without deterioration of any discipline and violation of the constraints; in other wor...

a multi-objective optimization procedure has been developed to determine some kinetic parameters of free radical polymerization of vinyl acetate based on genetic algorithm. for this purpose, mathematical modeling of free radical polymerization of vinyl acetate is carried out first and then selected kinetic parameters are optimized by minimizing objective functions defined from comparing experim...