Counterexample and optimality conditions in differentiable multiobjective programming (Q5942350)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1638278
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counterexample and optimality conditions in differentiable multiobjective programming |
scientific article; zbMATH DE number 1638278 |
Statements
Counterexample and optimality conditions in differentiable multiobjective programming (English)
0 references
28 August 2001
0 references
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.
0 references
multiobjective programming
0 references
Pareto optimal solutions
0 references
optimality conditions
0 references
0.9253174662590028
0 references
