Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Second order symmetric duality in nondifferentiable multiobjective
 

Summary: Second order symmetric duality
in nondifferentiable multiobjective
programming
Izhar Ahmad
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
Abstract
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
1. Introduction
Symmetric duality in mathematical programming in which the dual of the
dual is the primal problem was first introduced by Dorn [6]. Subsequently,
Dantzig et al. [5], Mond [13] and Bazaraa and Goode [1] formulated a pair
of symmetric dual programs and established duality under convexity≠concavity
0020-0255/$ - see front matter ” 2004 Elsevier Inc. All rights reserved.

  

Source: Ahmad, Izahr - Department of Mathematics and Statistics, King Fahd University of Petroleum and Minerals

 

Collections: Mathematics