A unified vector optimization problem: complete scalarizations and applications

اسناد مشابه

• Duality for vector optimization problems via a general scalarization

  سند علمی۲۰۱۰Radu Ioan Boţ, Sorin-Mihai Grad

  Considering a vector optimization problem to which properly efficient solutions are defined by using convex cone-monotone scalarization functions, we attach to it, by means of perturbation theory, new vector duals. When the primal problem, the scalarization function and the pertu

• Gerstewitz nonlinear scalar functional and the applications in vector optimization problems

  مقاله‌ی دسترسی آزاد۲۰۲۲Filomat['Ying Gao', 'Liping Tang', '']

  In this paper, we study the properties of Gerstewitz nonlinear scalar functional with respect to coradiant set and radiant in real linear space. With help nonconvex separation theorem co-radiant set, first obtain that is a special co-radiant(radiant) when corresponding set. Based

• Vector F -complementarity Problems with Nonconvex Preferences and Applications to Vector Optimization Problems

  سند علمی۲۰۰۷Jun Li, Nan-Jing Huang

  In this paper, several classes of vector F -complementarity problems (in short, VF -CP) and vector F -variational inequalities (in short, VF -VI) with relations determined by nonconvex preferences are introduced in Banach spaces. Some characterizations of solution sets for (VF -C

• Well-posed Vector Optimization Problems and Vector Variational Inequalities

  سند علمی۲۰۰۴M. Rocca, Matteo Rocca

  In this paper we introduce notions of well-posedness for a vector optimization problem and for a vector variational inequality of differential type, we study their basic properties and we establish the links among them. The proposed concept of well-posedness for a vector optimiza

• A constrained tropical optimization problem: complete solution and application example

  سند علمی۲۰۱۳CoRRNikolai Krivulin

  A multidimensional optimization problem is considered, which is formulated in terms of tropical mathematics as to minimize a nonlinear objective function subject to linear inequality constraints. The optimization problem is motivated by a problem in project scheduling when an opt

• Vector duality for convex vector optimization problems with respect to quasi-minimality

  سند علمی۲۰۱۲Sorin-Mihai Grad

  We define the quasi-minimal elements of a set with respect to a convex cone and characterize them via linear scalarization. Then we attach to a general vector optimization problem a dual vector optimization problem with respect to quasi-efficient solutions and establish new duali