Characterization of weakly efficient solutions for nonlinear multiobjective programming problems. Duality

MaRDI QIDQ5176685zbMATH OpenFDO

Authors Rojas-Medar Marko Antonio, B. Hernández-Jiménez, R. Osuna-Gómez

Publication date 27 February 2015

Full work available at URL http://www.heldermann.de/JCA/JCA21/JCA214/jca21054.htm

zbMATH Keywords

dualitygeneralized convexityKKT-invexitynonlinear multiobjective programmingoptimality conditions

Mathematics Subject Classification ID

Duality theory (optimization) (49N15) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• On generalized convexity and duality in multiobjective programming problems
• Generalized invexity and duality in multiobjective programming problems
• Characterization of optimal solutions for nonlinear programming problems with conic constraints
• scientific article; zbMATH DE number 572159
• scientific article; zbMATH DE number 1092139

Cited in

(6)

• Characterization of the weakly efficient solutions in nonsmooth quasiconvex multiobjective optimization
• Proper or weak efficiency via saddle point conditions in cone-constrained nonconvex vector optimization problems
• Characterization of optimal solutions for nonlinear programming problems with conic constraints
• scientific article; zbMATH DE number 2156021 (Why is no real title available?)
• Higher-order optimality conditions for nonregular multiobjective problem
• Generalized convexity and efficiency for non-regular multiobjective programming problems with inequality-type constraints

This page was built for publication: Characterization of weakly efficient solutions for nonlinear multiobjective programming problems. Duality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5176685)