Summary: Second order symmetric duality
in nondifferentiable multiobjective
Department of Mathematics, Aligarh Muslim University, Aligarh 202 002, India
Received 22 August 2003; received in revised form 25 May 2004; accepted 5 June 2004
A pair of Mond≠Weir type second order symmetric nondifferentiable multiobjective
programs is formulated. Weak, strong and converse duality theorems are established
under g-pseudobonvexity assumptions. Special cases are discussed to show that this
paper extends some work appeared in this area.
” 2004 Elsevier Inc. All rights reserved.
Keywords: Nondifferentiable programming; Multiobjective symmetric duality; g-Pseudobonvexity;
Efficient solutions; Properly efficient solutions
Symmetric duality in mathematical programming in which the dual of the
dual is the primal problem was first introduced by Dorn . Subsequently,
Dantzig et al. , Mond  and Bazaraa and Goode  formulated a pair
of symmetric dual programs and established duality under convexity≠concavity
0020-0255/$ - see front matter ” 2004 Elsevier Inc. All rights reserved.