Vector optimization problems are a generalization of multiobjective optimization in which the preference order is related to an arbitrary closed and convex cone, rather than the nonnegative octant. Due to its real life applications, it is important to have practical solution approaches for computing. In this work, we consider the inexact projected gradient-like method for solving smooth constra...

The quasi-equilibrium problems with constraints are formulated and some sufficient conditions on the existence of their solutions are shown. As special cases, we obtain several results on the existence of solutions of different vector quasivariational inequality and vector optimization problems. An application of the obtained results is given to show the existence of solutions of quasi-optimiza...

Particle swarm optimization is a metaheuristic technique widely applied to solve various optimization problems as well as parameter selection problems for various classification techniques. This paper presents an approach for linear support vector machines classifier optimization combining its selection from a family of similar classifiers with parameter optimization. Experimental results indic...

In this paper we study the behavior of Convex Quadratic Optimization problems when variation occurs simultaneously in the right-hand side vector of the constraints and in the coefficient vector of the linear term in the objective function. It is proven that the optimal value function is piecewise-quadratic. The concepts of transition point and invariancy interval are generalized to the case of ...

The main purpose of this paper consists of providing characterizations of the inclusion of the solution set of a given conic system posed in a real locally convex topological space into a variety of subsets of the same space de…ned by means of vector-valued functions. These Farkas-type results are used to derive characterizations of the weak solutions of vector optimization problems (including ...

In this paper, we study a general minimization vector problem which is expressed in terms of perturbation mapping defined on product locally convex Hausdorff topological spaces with values another space. Several representations the epigraph conjugate are given, and then, variants Farkas lemmas associated system by established. A dual so-called loose mentioned stable strong duality results betwe...

Motivation Most problems in nature have several (possibly conflicting) objectives to be satisfied. Many of these problems are frequently treated as single-objective optimization problems by transforming all but one objective into constraints. What is a multiobjective optimization problem? The Multiobjective Optimization Problem (MOP) (also called multicriteria optimization, multiperformance or ...