Higher order symmetric duality in nondifferentiable multi-objective programming problems involving generalized cone convex functions

  • Ravi P. Agarwal*
  • , Izhar Ahmad
  • , Anurag Jayswal
  • *Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

18 Scopus citations

Abstract

A pair of Mond-Weir type multi-objective higher order symmetric dual programs over arbitrary cones is formulated. Weak, strong and converse duality theorems are established under higher order K-F-convexity assumptions. Our results generalize several known results in the literature.

Original languageEnglish
Pages (from-to)1644-1650
Number of pages7
JournalMathematical and Computer Modelling
Volume52
Issue number9-10
DOIs
StatePublished - Nov 2010

Keywords

  • Cone constraints
  • Duality theorems
  • Efficiency
  • K-F- convexity
  • Multi-objective programming

ASJC Scopus subject areas

  • Modeling and Simulation
  • Computer Science Applications

Fingerprint

Dive into the research topics of 'Higher order symmetric duality in nondifferentiable multi-objective programming problems involving generalized cone convex functions'. Together they form a unique fingerprint.

Cite this