FIRST AND SECOND ORDER SUFFICIENT CONDITIONS FOR STRICT MINIMALITY IN MULTIOBJECTIVE PROGRAMMING

From MaRDI portal





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)].




Cited in
(17)








This page was built for publication: FIRST AND SECOND ORDER SUFFICIENT CONDITIONS FOR STRICT MINIMALITY IN MULTIOBJECTIVE PROGRAMMING

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