A new approach to multiobjective programming with a modified objective function (Q1430183): Difference between revisions

The author studies the multiobjective programming problem \((VP)\): \(V-\min\) \(f(x)\) s.t. \(g(x)\leq 0\) where \(f:X\to\mathbb{R}^k\), \(g:X\to \mathbb{R}^m\) are differentiable functions on a nonempty open set \(X\subset \mathbb{R}^n\). The relationship of (weak) efficient points of (VP) is examined with (weak) efficient points of the multiobjective programming problem \(VP_\eta (\overline x):V-\min \lfloor\eta x,\overline x)^T\nabla f_1 (\overline x),\dots,\eta(x, \overline x)^T\nabla f_k(\overline x)\rfloor\) s.t. \(g(x)\leq 0\) where \(f=(f_1, f_2,\dots,f_k),g,X\) are defined in \((VP)\), \(\overline x\in D:=\{x\in X:g(x)\leq 0\}\) and \(\eta:D\times D\to \mathbb{R}^n\). An \(\eta\)-Lagrangean function \(L_\eta(x, \xi)\) is introduced and some well-known saddle point results are also discussed.