Sufficient optimality conditions and duality in vector optimization with invex-convexlike functions

DOI10.1007/BF02192569zbMath0839.90102MaRDI QIDQ1906741

Phan Quoc Khanh

Publication date: 23 June 1996

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

zbMATH Keywords

vector optimizationPontryagin maximum principlecooperative differential gamesWolfe dualityinvex-convexlike functionsKuhn-Tucker sufficient optimality condition

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Cooperative games (91A12) Differential games (aspects of game theory) (91A23) Programming in abstract spaces (90C48)

Related Items (6)

Conditions for solutions, their globality, and their duality relations in vector optimization with relaxed quasiconvexity ⋮ Using \(\rho \)-cone arcwise connectedness on parametric set-valued optimization problems ⋮ PARAMETRIC SET-VALUED OPTIMIZATION PROBLEMS UNDER GENERALIZED CONE CONVEXITY ⋮ Optimality conditions under relaxed quasiconvexity assumptions using star and adjusted subdifferentials ⋮ Higher order weak epiderivatives and applications to duality and optimality conditions ⋮ Stochastic measures of arbitrage.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The essence of invexity
• On necessary optimality conditions in vector optimization problems
• On necessary and sufficient conditions in vector optimization
• Pre-invex functions in multiple objective optimization
• On sufficiency of the Kuhn-Tucker conditions
• Zero duality gaps in infinite-dimensional programming
• Proper solutions of vector optimization problems
• Invex-convexlike functions and duality
• A modified wolfe dual for weak vector minimization
• Nonsmooth invexity
• Convexlike alternative theorems and mathematical programming
• What is invexity?
• Duality with generalized convexity
• Necessary and sufficient conditions in constrained optimization
• Generalised convexity and duality in multiple objective programming
• Generalized invexity for nonsmooth vector-valued mappings
• Minimax Theorems

This page was built for publication: Sufficient optimality conditions and duality in vector optimization with invex-convexlike functions