Duality for some nondifferentiable static multiobjective programming problems (Q1340528)

The following multiobjective programming problem is considered: \[ \text{Minimize } (f_1(x)+ (x^T B_1 x)^{1/2},\;f_2(x)+ (x^T B_2 x)^{1/2},\dots, f_p(x)+ (x^T B_p x)^{1/2}), \] where \(f\) and \(g\) are differentiable functions from \(\mathbb{R}^n\to \mathbb{R}^p\) and \(\mathbb{R}^n\to \mathbb{R}^m\), respectively; \(B_i\), for each \(i\in P= \{1,2,\dots, p\}\), is an \(n\times n\) positive semidefinite matrix. The above problem is an extension of a programming problem studied recently by \textit{B. Mond} and \textit{I. Smart} [J. Math. Anal. Appl. 141, No. 2, 373-388 (1989; Zbl 0674.90083)] in the sense that the authors obtain multiobjective versions of the weak dual theorems. In the second part of the paper the following fractional programming problem is considered: \[ \text{Minimize } {f(x)+ (x^T Bx)^{1/2}\over g(x)} \] subject to \(h(x)\geq 0\), where \(f\) and \(g\) are differentiable functions from \(\mathbb{R}^n\to \mathbb{R}\) and \(g(x)> 0\), \(B\) is an \(n\times n\) positive semi-definite matrix, and \(h\) is a differentiable function from \(\mathbb{R}^n\to\mathbb{R}^m\). A weak duality result is derived.