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 language | English |
|---|---|
| Pages (from-to) | 1-12 |
| Number of pages | 12 |
| Journal | Journal of Optimization Theory and Applications |
| Volume | 141 |
| Issue number | 1 |
| DOIs | |
| State | Published - Apr 2009 |
| Externally published | Yes |
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