Optimality Conditions and Duality Theorems for Multiobjective Invex Programs

DOI10.1080/02522667.1991.10699066zbMath0733.90060OpenAlexW2330538100MaRDI QIDQ3360671

Do Sang Kim, Gue Myung Lee

Publication date: 1991

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1991.10699066

zbMATH Keywords

efficiencyduality relationssufficient optimalityKuhn-Tucker type conditionsmultiobjective invex programssingle objective invex programs

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Duality theory (optimization) (49N15) Convexity of real functions of several variables, generalizations (26B25)

Related Items (4)

Saddle points criteria in nondifferentiable multiobjective programming with \(V\)-invex functions via an \(\eta \)-approximation method ⋮ Nonsmooth \(\rho - (\eta , \theta )\)-invexity in multiobjective programming problems ⋮ Generalized convexity in multiobjective programming ⋮ Generalized convexity and efficiency for non-regular multiobjective programming problems with inequality-type constraints

Cites Work

• Unnamed Item
• A converse duality theorem in multiple objective programming
• On sufficiency of the Kuhn-Tucker conditions
• Necessary conditions for optimality of nondifferentiable convex multiobjective programming
• Efficiency and generalized convex duality for multiobjective programs
• What is invexity?
• Lagrangean conditions and quasiduality

This page was built for publication: Optimality Conditions and Duality Theorems for Multiobjective Invex Programs