Show simple item record

dc.contributor.authorYang, X.
dc.contributor.authorTeo, Kok Lay
dc.contributor.authorYang, X.
dc.date.accessioned2017-01-30T13:53:34Z
dc.date.available2017-01-30T13:53:34Z
dc.date.created2010-04-14T20:02:42Z
dc.date.issued2003
dc.identifier.citationYang, Xin and Teo, Kok and Yang, Xiao. 2003. Mixed symmetric duality in nondifferentiable mathematical programming. Indian Journal of Pure and Applied Mathematics. 34 (5): pp. 805-815.
dc.identifier.urihttp://hdl.handle.net/20.500.11937/36086
dc.description.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 existing symmetric dual formulations in the literature.

dc.publisherScientific Publishers
dc.titleMixed symmetric duality in nondifferentiable mathematical programming
dc.typeJournal Article
dcterms.source.volume34
dcterms.source.startPage805
dcterms.source.endPage815
dcterms.source.issn00195588
dcterms.source.titleIndian Journal of Pure and Applied Mathematics
curtin.accessStatusOpen access
curtin.facultySchool of Science and Computing
curtin.facultyDepartment of Mathematics and Statistics
curtin.facultyFaculty of Science and Engineering


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record