One of the most important optimality conditions to aid in solving a vector optimization problem is the first-order necessary optimality condition that generalizes the Karush-Kuhn-Tucker condition. However, to obtain the sufficient optimality conditions, it is necessary to impose additional assumptions on the objective functions and on the constraint set.The present work is concerned with the co...

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...

We study a multiobjective variational problem on time scales. For this problem, necessary and sufficient conditions for weak local Pareto optimality are given. We also prove a necessary optimality condition for the isoperimetric problem with multiple constraints on time scales.

A new notion of the optimality for multicriterion problems which generalizes the well-known notions of optimality in Pareto and Nash senses is considered and some properties of the introduced notions are studied.

This paper formalizes and adapts the well known concept of Pareto efficiency in the context of the popular robust optimization (RO) methodology. We argue that the classical RO paradigm need not produce solutions that possess the associated property of Pareto optimality, and illustrate via examples how this could lead to inefficiencies and sub-optimal performance in practice. We provide a basic ...

Selecting a set of alternatives based on the preferences of agents is an important problem in committee selection and beyond. Among the various criteria put forth for desirability of a committee, Pareto optimality is a minimal and important requirement. As asking agents to specify their preferences over exponentially many subsets of alternatives is practically infeasible, we assume that each ag...

Selecting a set of alternatives based on the preferences of agents is an important problem in committee selection and beyond. Among the various criteria put forth for the desirability of a committee, Pareto optimality is a minimal and important requirement. As asking agents to specify their preferences over exponentially many subsets of alternatives is practically infeasible, we assume that eac...

This paper is concerned with the problem of finding a representative sample of Pareto-optimal points inmulti-objective optimization. The Normal Boundary Intersection algorithm is a scalarization scheme for generating a set of evenly spaced Efficient solutions. A drawback of this algorithm is that Pareto-optimality of solutions is not guaranteed. The contributions of this paper are two-fold. Fir...

Abstract. The study of fractional variational problems in terms of a combined fractional Caputo derivative is introduced. Necessary optimality conditions of Euler–Lagrange type for the basic, isoperimetric, and Lagrange variational problems are proved, as well as transversality and sufficient optimality conditions. This allows to obtain necessary and sufficient Pareto optimality conditions for ...