Duality for a class of nondifferentiable multiobjective programming problems (Q1840559): Difference between revisions

In a recent paper written by \textit{B. Mond} and \textit{Schechter} nondifferentiable symmetric duality in which the objective function contained a support function has been studied. In the paper under review the authors replace the objective function by a more general function -- the support function of a compact convex set. A general model for a class of nondifferentiable multiobjective programs is formulated and weak duality theorems under weak convexity conditions are formulated and proved. The special case of the support function as the square root of a positive semidefinite quadratic form is considered.