Mixed symmetric duality in nondifferentiable mathematical programming

Xin Min Yang, Kok Lay Teo, Xiaoqi Yang

Research output: Journal article publicationJournal articleAcademic researchpeer-review

14 Citations (Scopus)


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 languageEnglish
Pages (from-to)805-815
Number of pages11
JournalIndian Journal of Pure and Applied Mathematics
Issue number5
Publication statusPublished - 1 May 2003


  • Generalized Convexity
  • Nondifferentiable Nonlinear Programming
  • Support Function
  • Symmetric Duality

ASJC Scopus subject areas

  • General Mathematics
  • Applied Mathematics


Dive into the research topics of 'Mixed symmetric duality in nondifferentiable mathematical programming'. Together they form a unique fingerprint.

Cite this