Article

Multiobjective higher-order symmetric duality involving generalized cone-invex functions

Department of Mathematics, Indian Institute of Technology Patna, Patna-800 013, India; Department of Applied Mathematics, Birla Institute of Technology Mesra, Ranchi-835 215, India
Computers & Mathematics with Applications 01/2010; DOI: 10.1016/j.camwa.2010.10.023
Source: DBLP

ABSTRACT In this paper, a pair of Mond–Weir type multiobjective higher-order symmetric dual programs over arbitrary cones is formulated and usual duality results are established under higher-order K-preinvexity/K-pseudoinvexity assumptions. Symmetric minimax mixed integer primal and dual problems are also discussed.

0 Bookmarks
 · 
63 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper we establish weak, strong and converse duality results for a pair of Wolfe type higher-order symmetric dual problems over cones under the assumption of higher-order cone-invexity. We also introduce the concepts of higher-order strictly and strongly cone-pseudoinvexity and use them to obtain weak, strong and converse duality results for the pair of Mond-Weir type higher-order symmetric dual problems.
    Journal of Computational and Applied Mathematics 01/2014; 255:825-836. · 0.99 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, a new pair of Mond-Weir type multiobjective second-order symmetric dual models with cone constraints is formulated in which the objective function is optimised with respect to an arbitrary closed convex cone. Usual duality relations are further established under K-η-bonvexity/second-order symmetric dual K-H-convexity assumptions. A nontrivial example has also been illustrated to justify the weak duality theorems. Several results including many recent works are obtained as special cases. Reference to this paper should be made as follows: Gupta, S.K. and Dangar, D. (2012) 'Duality for second-order symmetric multiobjective programming with cone constraints', Int.