Lagrangian duality for minimization of nonconvex multifunctions

DOI10.1023/A:1022658019642zbMath0901.90161MaRDI QIDQ1379972

J. Ning

Publication date: 26 November 1998

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

vector optimization; alternative type theorems; nearly convexlike functions

Mathematics Subject Classification ID

90C29: Multi-objective and goal programming

26B25: Convexity of real functions of several variables, generalizations

Related Items

Conjugate duality in set-valued vector optimization

Cites Work

• Unnamed Item
• Unnamed Item
• On general minimax theorems
• Inequality systems and optimization
• A generalization of a minimax theorem of Fan via a theorem of the alternative
• Existence and Lagrangian duality for maximization of set-valued functions
• An improved definition of proper efficiency for vector maximization with respect to cones
• Perfect duality for convexlike programs
• Convexlike and concavelike conditions in alternative, minimax, and minimization theorems
• A solvability theorem for a class of quasiconvex mappings with applications to optimization
• Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
• Invex multifunctions and duality
• Convexlike alternative theorems and mathematical programming
• The geometry of Pareto efficiency over cones
• Proper Efficient Points for Maximizations with Respect to Cones