Second order duality in multiobjective programming

  • Izhar Ahmad*
  • , Zakir Husain
  • *Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

A nonlinear multiobjective programming problem is considered. Weak, strong and strict converse duality theorems are established under generalized second order (F, α, ρ, d)-convexity for second order Mangasarian type and general Mond-Weir type vector duals.

Original languageEnglish
Pages (from-to)131-148
Number of pages18
JournalJournal of Applied Analysis
Volume14
Issue number1
DOIs
StatePublished - Jun 2008
Externally publishedYes

Bibliographical note

Funding Information:
2000 Mathematics Subject Classification. Primary: 90C29, 90C30, 90C46. Key words and phrases. Multiobjective programming, second order duality, efficient solution, generalized (F, α, ρ, d)-convexity. The research of second author is supported by the Department of Atomic Energy, Government of India, under the NBHM Post-Doctoral Fellowship Program No. 40/9/2005-R & D II/2398.

Keywords

  • Efficient solution
  • Generalized (F; α ρ d)-convexity
  • Multiobjective programming
  • Second order duality

ASJC Scopus subject areas

  • Mathematical Physics
  • Statistics, Probability and Uncertainty
  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Second order duality in multiobjective programming'. Together they form a unique fingerprint.

Cite this