- Full text PDF available (9)
- This year (0)
- Last 5 years (2)
- Last 10 years (10)
Journals and Conferences
Article history: Received 10 October 2007 Accepted 24 August 2009 Available online 15 September 2009
A Mond–Weir type dual for a class of nondifferentiable minimax fractional programming problem is considered. Appropriate duality results are proved involving (F,a,q,d)-pseudoconvex functions. 2005 Elsevier Inc. All rights reserved.
A class of second order (F,a,q,d)-convex functions and their generalizations is introduced. Using the assumptions on the functions involved, weak, strong and strict converse duality theorems are established for a second order Mond–Weir type multiobtive dual. 2005 Elsevier Inc. All rights reserved.
A pair of Mond–Weir type nondifferentiable multiobjective second order symmetric dual programs is formulated and symmetric duality theorems are established under the assumptions of second order F-pseudoconvexity/ F-pseudoconcavity. © 2005 Elsevier Ltd. All rights reserved.
Usual symmetric duality results are proved forWolfe and Mond -Weir type nondifferentiable nonlinear symmetric dual programs under Fconvexity F-concavity and F-pseudoconvexity F-pseudoconcavity assumptions. These duality results are then used to formulate Wolfe and MondWeir type nondifferentiable minimax mixed integer dual programs and symmetric duality… (More)
In this paper, we are concerned with a class of nondifferentiable minimax programming problem and its two types of second order dual models. Weak, strong and strict converse duality theorems from a view point of generalized convexity are established. Our study naturally unifies and extends some previously known results onminimax programming.
In the present paper, two types of second order dual models are formulated for a minmax fractional programming problem. The concept of η-bonvexity/ generalized η-bonvexity is adopted in order to discuss weak, strong and strict converse duality theorems.