Optimization of set-valued functions

DOI10.1006/jmaa.1994.1284zbMath0987.49011OpenAlexW1966817579MaRDI QIDQ1336173

Lai-Jiu Lin

Publication date: 30 June 2002

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jmaa.1994.1284

zbMATH Keywords

set-valued functionsFarkas-Minkowski type theoremMond-Weir type and Wolfe type vector dualityMoreau-Rockafellar type theorem

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Set-valued and variational analysis (49J53) Duality theory (optimization) (49N15)

Related Items (46)

Strong duality for proper efficiency in vector optimization ⋮ The Strictly Efficient Subgradient of Set-Valued Optimisation ⋮ Optimality conditions for the difference of convex set-valued mappings ⋮ The semi-\(E\) cone convex set-valued map and its applications ⋮ Lagrangian multipliers, saddle points, and duality in vector optimization of set-valued maps ⋮ Optimality conditions for multiobjective programming with generalized \(({\mathfrak J},\rho,\theta)\)-convex set functions ⋮ Lagrangian duality for preinvex set-valued functions ⋮ On the optimality conditions for D.C. vector optimization problems ⋮ Subdifferential and optimality conditions for the difference of set-valued mappings ⋮ Sequential Pareto subdifferential sum rule for convex set-valued mappings and applications ⋮ Pareto epsilon-subdifferential sum rule for set-valued mappings and applications to set optimization ⋮ Approximate quasi efficiency of set-valued optimization problems via weak subdifferential ⋮ Necessary conditions for efficient solution of vector optimization problems ⋮ Nonconvex vector optimization of set-valued mappings. ⋮ Subdifferentials of multifunctions and Lagrange multipliers for multiobjective optimization. ⋮ \(\varepsilon\)-subdifferentials of set-valued maps and \(\varepsilon\)-weak Pareto optimality for multiobjective optimization ⋮ A survey of recent[1985-1995advances in generalized convexity with applications to duality theory and optimality conditions] ⋮ On subdifferential calculus for set-valued mappings and optimality conditions ⋮ Superefficiency in vector optimization with nearly subconvexlike set-valued maps ⋮ Optimality conditions for vector optimization problems with difference of convex maps ⋮ Optimality and duality for multiobjective programming involving subdifferentiable set functions ⋮ Hartley proper efficiency in multifunction optimization ⋮ Strong duality with super efficiency in set-valued optimization ⋮ Moreau-Rockafellar theorems for nonconvex set-valued maps ⋮ Theorems of the alternative for multifunctions. ⋮ Optimality conditions for a nonconvex set-valued optimization problem ⋮ Pareto-Fenchel ε-Subdifferential Composition Rule and ε-Efficiency ⋮ Pareto-Fenchel \({\epsilon}\)-subdifferential sum rule and \({\epsilon}\)-efficiency ⋮ Sufficient optimality conditions and duality theorems for set-valued optimization problem under generalized cone convexity ⋮ Characterizations of solutions for vector equilibrium problems ⋮ Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior ⋮ Generalized constraint qualifications and optimality conditions for set-valued optimization problems ⋮ Existence of a solution and variational principles for vector equilibrium problems ⋮ Weak subdifferential for set-valued mappings and its applications ⋮ Set Optimization—A Rather Short Introduction ⋮ Strong Duality with Proper Efficiency in Multiobjective Optimization Involving Nonconvex Set-Valued Maps ⋮ Lagrangian multipliers for generalized affine and generalized convex vector optimization problems of set-valued maps ⋮ Benson proper efficiency in the vector optimization of set-valued maps ⋮ Duality for a minimax programming problem containing \(n\)-set functions ⋮ A note on the paper ``Optimality conditions for vector optimization problems with difference of convex maps ⋮ Henig efficiency in vector optimization with nearly cone-subconvexlike set-valued functions ⋮ Theorems of the alternative and optimization with set-valued maps ⋮ Necessary optimality conditions of a D.C. set-valued bilevel optimization problem ⋮ The optimality conditions for vector optimization of set-valued maps ⋮ Super efficiency in vector optimization with nearly convexlike set-valued maps. ⋮ Near-subconvexlikeness in vector optimization with set-valued functions

This page was built for publication: Optimization of set-valued functions