𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the set of weakly efficient minimizers for convex multiobjective programming

✍ Scribed by Rubén López; Cristian Vera

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
569 KB
Volume
36
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Necessary Conditions for Suboptimization
Necessary Conditions for Suboptimization over the Weakly Efficient Set Associated to Generalized Invex Multiobjective Programming
✍ Xu Zengkun 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 157 KB

The problem of optimizing a real-valued function over the weakly efficient set associated to a multiobjective program is examined. Two types of necessary conditions for suboptimizing the solution of the general problem are presented, Ž which are somewhat similar to Theorem 4.1 of S.

Characterizations of Nonemptiness and Co
Characterizations of Nonemptiness and Compactness of the Set of Weakly Efficient Solutions for Convex Vector Optimization and Applications
✍ X.X. Huang; X.Q. Yang 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 134 KB

In this paper, we give characterizations for the nonemptiness and compactness of the set of weakly efficient solutions of an unconstrained/constrained convex vector optimization problem with extended vector-valued functions in terms of the 0-coercivity of some scalar functions. Finally, we apply the

On the Boolean algebras of definable set
On the Boolean algebras of definable sets in weakly o-minimal theories
✍ Stefano Leonesi; Carlo Toffalori 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 141 KB 👁 1 views

## Abstract We consider the sets definable in the countable models of a weakly o‐minimal theory __T__ of totally ordered structures. We investigate under which conditions their Boolean algebras are isomorphic (hence __T__ is p‐__ω__‐categorical), in other words when each of these definable sets adm