Multiobjective mixed symmetric duality involving cones

  • I. Ahmad*
  • , Z. Husain
  • *Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

24 Scopus citations

Abstract

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-preinvexity and K-pseudoinvexity assumptions. This mixed symmetric dual formulation unifies the symmetric dual formulations of Suneja et al. (2002) [14] and Khurana (2005) [15].

Original languageEnglish
Pages (from-to)319-326
Number of pages8
JournalComputers and Mathematics with Applications
Volume59
Issue number1
DOIs
StatePublished - Jan 2010
Externally publishedYes

Bibliographical note

Funding Information:
The research of the second author was supported by the Department of Atomic Energy, Government of India, under the NBHM Post-Doctoral Fellowship Program No. 40/9/2005-R&D II/916.

Keywords

  • Cone constraints
  • K-preinvexity
  • Multiobjective programming
  • Symmetric duality
  • Weakly efficient solutions

ASJC Scopus subject areas

  • Modeling and Simulation
  • Computational Theory and Mathematics
  • Computational Mathematics

Fingerprint

Dive into the research topics of 'Multiobjective mixed symmetric duality involving cones'. Together they form a unique fingerprint.

Cite this