✦ LIBER ✦

Methods for optimizing over the efficient and weakly efficient sets of an affine fractional vector optimization program

✍ Scribed by An, Le Thi Hoai; Tao, Pham Dinh; Nam, Nguyen Canh; Muu, Le Dung

Book ID: 121681766
Publisher: Taylor and Francis Group
Year: 2010
Tongue: English
Weight: 190 KB
Volume: 59
Category: Article
ISSN: 0233-1934
DOI: 10.1080/02331930903500290

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Inner Approximation Method for Optimi

An Inner Approximation Method for Optimization over the Weakly Efficient Set

✍ Syuuji Yamada; Tetsuzo Tanino; Masahiro Inuiguchi 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 140 KB

An algorithm for optimizing over the wea

An algorithm for optimizing over the weakly-efficient set

✍ Harold P. Benson 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 642 KB

An outcome space algorithm for optimizat

An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem

✍ Harold P. Benson 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 300 KB

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

Reverse Convex Programming Approach in t

Reverse Convex Programming Approach in the Space of Extreme Criteria for Optimization over Efficient Sets

✍ N. V. Thoai 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 386 KB

Branch-and-Bound Variant of an Outcome-B

Branch-and-Bound Variant of an Outcome-Based Algorithm for Optimizing over the Efficient Set of a Bicriteria Linear Programming Problem

✍ J. Fülöp; L. D. Muu 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 118 KB