Counterexample and optimality conditions in differentiable multiobjective programming

DOI10.1023/A:1017570023018MaRDI QIDQ5942350zbMATH OpenOpenAlexWikidataFDO

Authors Do Sang Kim, Gue Myung Lee, Byung-Soo Lee, Sung-Jin Cho

Publication date 28 August 2001

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

Full work available at URL https://doi.org/10.1023/a:1017570023018

zbMATH Keywords

multiobjective programmingoptimality conditionsPareto optimal solutions

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29)

Review text

By giving a simple counterexample the authors show that the sufficient optimality conditions for Pareto optimal solutions of differentiable multiobjective programming problems (MOP) stated in Majundar (1997) are not correct in general. Modifications of the above mentioned results are developed based on the assumption that the functions involved at a (weak) Pareto optimal solution are convex, pseudoconvex and quasiconvex, respectively. In particular, in the modification of the sufficient optimality theorem for a Pareto optimal solution of (MOP), the assumption of pseudoconvexity of the objective functions is replaced by strict pseudoconvexity.

Recommendations

• Optimality conditions in differentiable multiobjective programming
• scientific article; zbMATH DE number 4185407
• scientific article; zbMATH DE number 179184
• scientific article; zbMATH DE number 4202032
• Optimality conditions for multiobjective programming with generalized \(({\mathfrak J},\rho,\theta)\)-convex set functions

Cites work

• Optimality conditions in differentiable multiobjective programming
• Optimality conditions in multiobjective differentiable programming

Cited in

(10)

• Optimality conditions in differentiable multiobjective programming
• Optimal design of a beam subject to bending: a basic application
• Thin-walled tubes under torsion: multi-objective optimal design
• scientific article; zbMATH DE number 4202032 (Why is no real title available?)
• Relaxation of constraints in lexicographic multiobjective programming problems
• Optimality and Duality for Invex Nonsmooth Multiobjective programming problems
• Global efficiency for multiobjective bilevel programming problems under generalized invexity
• scientific article; zbMATH DE number 4185407 (Why is no real title available?)
• Dini and Hadamard directional derivatives in multiobjective optimization: an overview of some results
• Optimality conditions and duality in nonsmooth multiobjective programs

This page was built for publication: Counterexample and optimality conditions in differentiable multiobjective programming

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