Set approach for set optimization with variable ordering structures

نویسندگان

  • Gabriele Eichfelder
  • Maria Pilecka
چکیده

This paper aims at combining variable ordering structures with set relations in set optimization, which have been defined using the constant ordering cone before. Since the purpose is to connect these two important approaches in set optimization, we do not restrict our considerations to one certain relation. Conversely, we provide the reader with many new variable set relations generalizing the relations from [16, 25] and discuss their usefulness. After analyzing the properties of the introduced relations, we define new solution notions for set-valued optimization problems equipped with variable ordering structures and compare them with other concepts from the literature. In order to characterize the introduced solutions a nonlinear scalarization approach is used.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimality conditions for approximate solutions of vector optimization problems with variable ordering structures

‎We consider nonconvex vector optimization problems with variable ordering structures in Banach spaces‎. ‎Under certain boundedness and continuity properties we present necessary conditions for approximate solutions of these problems‎. ‎Using a generic approach to subdifferentials we derive necessary conditions for approximate minimizers and approximately minimal solutions of vector optimizatio...

متن کامل

Set Approach for Set Optimization with Variable Ordering Structures Part II: Scalarization Approaches

This paper aims at combining variable ordering structures with set relations in set optimization, which have been defined using the constant ordering cone before. Since the purpose is to connect these two important approaches in set optimization, we do not restrict our considerations to one certain relation. Conversely, we provide the reader with many new variable set relations generalizing the...

متن کامل

Restricting the parameter set of the Pascoletti-Serafini scalarization

‎A common approach to determine efficient solutions of a multiple objective optimization problem‎ ‎is reformulating it to a parameter dependent scalar optimization problem‎. ‎This reformulation is called scalarization approach‎. Here, a well-known scalarization approach named Pascoletti-Serafini scalarization is considered‎. First, some difficulties of this scalarization are discussed and then ...

متن کامل

TOPOLOGY OPTIMIZATION OF PLANE STRUCTURES USING BINARY LEVEL SET METHOD AND ISOGEOMETRIC ANALYSIS

This paper presents the topology optimization of plane structures using a binary level set (BLS) approach and isogeometric analysis (IGA). In the standard level set method, the domain boundary is descripted as an isocountour of a scalar function of a higher dimensionality. The evolution of this boundary is governed by Hamilton–Jacobi equation. In the BLS method, the interfaces of subdomai...

متن کامل

Graceful labelings of the generalized Petersen graphs

A graceful labeling of a graph $G=(V,E)$ with $m$ edges is aninjection $f: V(G) rightarrow {0,1,ldots,m}$ such that the resulting edge labelsobtained by $|f(u)-f(v)|$ on every edge $uv$ are pairwise distinct. For natural numbers $n$ and $k$, where $n > 2k$, a generalized Petersengraph $P(n, k)$ is the graph whose vertex set is ${u_1, u_2, cdots, u_n} cup {v_1, v_2, cdots, v_n}$ and its edge set...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014