LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

On approximate solutions of nondifferentiable vector optimization problems with cone-convex objectives

Photo by timaesthetic from unsplash

In this paper, we study a nondifferentiable constrained vector optimization problem where the partial order in the image space is induced by a closed, convex and pointed cone with nonempty… Click to show full abstract

In this paper, we study a nondifferentiable constrained vector optimization problem where the partial order in the image space is induced by a closed, convex and pointed cone with nonempty interior. Under the C-convexity assumption, we present necessary and sufficient KKT optimality conditions for weakly C-$$\epsilon $$ϵ-efficient solutions. In addition, we formulate a Wolfe-type dual problem, and then weak and strong duality theorems are presented.

Keywords: optimization; approximate solutions; nondifferentiable vector; solutions nondifferentiable; vector optimization

Journal Title: Optimization Letters
Year Published: 2019

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.