Higher-order duality in nondifferentiable minimax programming with generalized type i functions

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

Research output: Contribution to journalArticlepeer-review

18 Scopus citations

Abstract

A unified higher-order dual for a nondifferentiable minimax programming problem is formulated. Weak, strong and strict converse duality theorems are discussed involving generalized higher-order (F,α,ρ,d)-Type I functions.

Original languageEnglish
Pages (from-to)1-12
Number of pages12
JournalJournal of Optimization Theory and Applications
Volume141
Issue number1
DOIs
StatePublished - Apr 2009
Externally publishedYes

Bibliographical note

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

Keywords

  • Higher-order duality
  • Minimax programming
  • Nondifferentiable programming

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Control and Optimization
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Higher-order duality in nondifferentiable minimax programming with generalized type i functions'. Together they form a unique fingerprint.

Cite this