The usual duality results are established for mixed symmetric multiobjective dual programs
without nonnegativity constraints using the notion of invexity/generalized invexity which has …

A pair of multiobjective mixed symmetric dual programs is formulated over arbitrary cones.
Weak, strong, converse and self-duality theorems are proved for these programs under K …

Mixed second-order multiobjective symmetric duality with cone constraints - ScienceDirect
Skip to main contentSkip to article Elsevier logo Journals & Books Search RegisterSign in …

A new symmetric dual formulation, called the mixed symmetric dual, is presented for a class
of nonlilnear multiobjective programming problems and various duality theorems are …

A pair of Mond–Weir type multiobjective second order symmetric dual programs are
formulated without non-negativity constraints. Weak duality, strong duality and converse …

Extending earlier duality results for properly efficient solutions, two pairs of symmetric dual
multiobjective programming problems for efficient solutions are given and appropriate …

In this paper, we have formulated a second-order mixed symmetric dual programs for a class
of nondifferentiable multiobjective programming problem. Weak, strong and converse duality …

A pair of Wolfe type multiobjective second order symmetric dual programs with cone
constraints is formulated and usual duality results are established under second order …

A pair of Mond-Weir type second order mixed symmetric duals is presented for a class of
non-differentiable multi-objective non-linear programming problems with multiple …

Nondifferentiable second order symmetric duality in multiobjective programming -
ScienceDirect Skip to main contentSkip to article Elsevier logo Journals & Books Search …