Second order duality for nondifferentiable minimax programming problems with generalized convexity

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

Research output: Contribution to journalArticlepeer-review

16 Scopus citations

Abstract

In this paper, we are concerned with a class of nondifferentiable minimax programming problem and its two types of second order dual models. Weak, strong and strict converse duality theorems from a view point of generalized convexity are established. Our study naturally unifies and extends some previously known results on minimax programming.

Original languageEnglish
Pages (from-to)593-608
Number of pages16
JournalJournal of Global Optimization
Volume44
Issue number4
DOIs
StatePublished - Aug 2009
Externally publishedYes

Bibliographical note

Funding Information:
Acknowledgements The research of Z. Husain 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

  • Generalized convexity
  • Minimax programming
  • Nondifferentiable programming
  • Second order duality

ASJC Scopus subject areas

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

Fingerprint

Dive into the research topics of 'Second order duality for nondifferentiable minimax programming problems with generalized convexity'. Together they form a unique fingerprint.

Cite this