Affordable Access

∊-STRICTLY EFFICIENT SOLUTIONS OF VECTOR OPTIMIZATION PROBLEMS WITH SET-VALUED MAPS

Authors
Disciplines
  • Mathematics

Abstract

In this paper, the notion of ∊-strictly efficient solution for vector optimization with set-valued maps is introduced. Under the assumption of the ic-cone-convexlikeness for set-valued maps, the scalarization theorem, ∊-Lagrangian multiplier theorem, ∊-saddle point theorems and ∊-duality assertions are established for ∊-strictly efficient solution.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

Optimality conditions for proper efficient solutio...

on Journal of Mathematical Analys... Jan 01, 2003

Vectorization of set-valued maps with respect to t...

on Journal of Mathematical Analys... Jan 01, 2012

On solutions of set-valued optimization problems

on Computers & Mathematics with A... Jan 01, 2010

The Optimality Conditions for Vector Optimization...

on Journal of Mathematical Analys... Jan 01, 1999
More articles like this..