Displaying similar documents to “Sufficient condition for Pareto optimization in Banach spaces”

Efficient and Local Efficient Solutions for Assignment Type Problems

Jacques A. Ferland, Pina Marziliano (2010)

RAIRO - Operations Research

Similarity:

In this paper, we analyse the multiobjective problem generated by applying a goal programming approach to deal with linear assignment type problem. We specify sufficient conditions for a solution to be efficient for this problem. The notion of efficiency with respect to a neighborhood is also introduced and characterized through sufficient conditions. Unfortunately, these conditions are not necessary in general.

Second-order optimality conditions for nondominated solutions of multiobjective programming with C 1 , 1 data

Liping Liu, Pekka Neittaanmäki, Michal Křížek (2000)

Applications of Mathematics

Similarity:

We examine new second-order necessary conditions and sufficient conditions which characterize nondominated solutions of a generalized constrained multiobjective programming problem. The vector-valued criterion function as well as constraint functions are supposed to be from the class C 1 , 1 . Second-order optimality conditions for local Pareto solutions are derived as a special case.

On local derivations in the Kadison sense

Andrzej Nowicki (2001)

Colloquium Mathematicae

Similarity:

Let k be a field. We prove that any polynomial ring over k is a Kadison algebra if and only if k is infinite. Moreover, we present some new examples of Kadison algebras and examples of algebras which are not Kadison algebras.