Abstract
A mixed symmetric dual formulation is presented for a class of nondifferentiable nonlinear programming problems with multiple arguments. Weak, strong and converse duality theorems are established. The mixed symmetric dual formulation unifies the two exsting symmetric dual formulations in the literature.
Original language | English |
---|---|
Pages (from-to) | 805-815 |
Number of pages | 11 |
Journal | Indian Journal of Pure and Applied Mathematics |
Volume | 34 |
Issue number | 5 |
Publication status | Published - 1 May 2003 |
Keywords
- Generalized Convexity
- Nondifferentiable Nonlinear Programming
- Support Function
- Symmetric Duality
ASJC Scopus subject areas
- Mathematics(all)
- Applied Mathematics