Generalized convexity in multiobjective programming (Q5916441)
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 4114403
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generalized convexity in multiobjective programming |
scientific article; zbMATH DE number 4114403 |
Statements
Generalized convexity in multiobjective programming (English)
0 references
1989
0 references
The so-called weighting problem, the k-th objective Lagrangian problem and the k-th objective constraint problem associated with a multiobjective nonlinear optimization problem are considered. The relationship between the solutions of these three problems and the noninferior solutions of the multiobjective optimization problem are studied as well as weaker types of convexities as e.g. quasiconvexity and pseudoconvexity. Also duality results are included.
0 references
weighting problem
0 references
multiobjective nonlinear optimization
0 references
quasiconvexity
0 references
pseudoconvexity
0 references
0.8623142838478088
0 references
0.8620726466178894
0 references
0.8529045581817627
0 references
0.8419468402862549
0 references
