FIRST AND SECOND ORDER SUFFICIENT CONDITIONS FOR STRICT MINIMALITY IN MULTIOBJECTIVE PROGRAMMING (Q3148352)
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 1810515
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | FIRST AND SECOND ORDER SUFFICIENT CONDITIONS FOR STRICT MINIMALITY IN MULTIOBJECTIVE PROGRAMMING |
scientific article; zbMATH DE number 1810515 |
Statements
FIRST AND SECOND ORDER SUFFICIENT CONDITIONS FOR STRICT MINIMALITY IN MULTIOBJECTIVE PROGRAMMING (English)
0 references
27 January 2003
0 references
multiobjective programming
0 references
strict local Pareto minimum
0 references
first and second order sufficient optimality conditions
0 references
support function
0 references
0 references
0 references
0.8548564314842224
0 references
0.8544723987579346
0 references
0.8410083055496216
0 references
The authors provide first and second order sufficient optimality conditions for the multiobjective programming problem: \(\text{Min }f(x)\), \(x\in S\), \(S \subset \mathbb R^n\) and \(f :\mathbb R\to \mathbb R^n\) is, in general, twice differentiable. The concept of support function to a multiobjective problem is introduced so that it contains the scalar case \((p = 1).\) The results then appear as a generalization of the scalar case studied by \textit{M. R. Hestenes} [Optimization Theory, The Finite dimensional case. Wiley, New York (1975; Zbl 0327.90015)]. The first and second order conditions are also obtained for the case of a feasible set defined by equality and inequality constraints through the notion of strict and super strict local (Pareto) minimum of order \(m\) introduced the first author [J. Math. Anal. Appl. 265, 264--284 (2002; Zbl 1010.90075)].
0 references