scholarly journals A Benson-type algorithm for bounded convex vector optimization problems with vertex selection

2021 ◽  
pp. 1-21
Author(s):  
Daniel Dörfler ◽  
Andreas Löhne ◽  
Christopher Schneider ◽  
Benjamin Weißing
Keyword(s):  
Vector Optimization ◽  
Optimization Problems ◽  
Vector Optimization Problems ◽  
Convex Vector Optimization ◽  
Type Algorithm ◽  
Bounded Convex

Lagrangian multipliers for generalized affine and generalized convex vector optimization problems of set-valued maps

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Renying Zeng
Keyword(s):  
Optimality Conditions ◽  
Vector Optimization ◽  
Optimization Problems ◽  
Efficient Solutions ◽  
Vector Optimization Problems ◽  
Lagrangian Multipliers ◽  
Weakly Efficient Solutions ◽  
Affine Maps ◽  
Convex Vector Optimization ◽  
Affine Set

Abstract In this paper, we introduce some definitions of generalized affine set-valued maps: affinelike, preaffinelike, nearaffinelike, and prenearaffinelike maps. We present examples to explain that our definitions of generalized affine maps are different from each other. We derive a theorem of alternative of Farkas–Minkowski type, discuss Lagrangian multipliers for constrained set-valued optimization problems, and obtain some optimality conditions for weakly efficient solutions.

Sign in / Sign up

Export Citation Format

Share Document