This paper deals with approximate solutions of general (that is, without any convexity assumption) multi-objective optimization problems (MOPs). In this text, by reviewing some standard scalarization techniques we are interested in finding the relationships between ε-(weakly, properly) efficient points of an MOP and ε-optimal solutions of the related scalarized problem. For this purpose, the re...

multi objective quadratic fractional programming (moqfp) problem involves optimization of several objective functions in the form of a ratio of numerator and denominator functions which involve both contains linear and quadratic forms with the assumption that the set of feasible solutions is a convex polyhedral with a nite number of extreme points and the denominator part of each of the object...

We study a recent programming paradigm known as Adaptive Programming (AP) as an ideal candidate for a metaobject protocol (MOP) for object-oriented programming languages; we call it the AP MOP. The major beneet of the AP MOP is to provide a mechanism for writing base-level programs in a structure-shy manner. Doing so, the programs are more robust to changes in the structural aspects of the appl...

Large-scale multi-objective optimization problems (LS-MOP) are complex problems with a large number of decision variables. Due to its high-dimensional decision space, LS-MOP poses a significant challenge to multi-objective optimization methods including multiobjective evolutionary algorithms (MOEAs). Following the algorithmic framework of multiobjective evolutionary algorithm based on decomposi...