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 language | English |
|---|---|
| Pages (from-to) | 593-608 |
| Number of pages | 16 |
| Journal | Journal of Global Optimization |
| Volume | 44 |
| Issue number | 4 |
| DOIs | |
| State | Published - Aug 2009 |
| Externally published | Yes |
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