A converse duality theorem on higher-order dual models in nondifferentiable mathematical programming
| dc.contributor.author | Yang, X. | |
| dc.contributor.author | Teo, Kok Lay | |
| dc.date.accessioned | 2017-01-30T15:06:27Z | |
| dc.date.available | 2017-01-30T15:06:27Z | |
| dc.date.created | 2011-03-02T20:01:35Z | |
| dc.date.issued | 2010 | |
| dc.identifier.citation | Yang, X.M. and Teo, K.L. 2010. A converse duality theorem on higher-order dual models in nondifferentiable mathematical programming. Optimization Letters. 6 (1): pp. 11-15. | |
| dc.identifier.uri | http://hdl.handle.net/20.500.11937/43295 | |
| dc.identifier.doi | 10.1007/s11590-010-0247-1 | |
| dc.description.abstract |
We consider in this paper Mond–Weir type higher-order dual models in nondifferentiable mathematical programming introduced by Mishra and Rueda (2002, J. Math. Anal. Appl. 272, 496–506). We give a converse duality theorem on Mond-Weir type higher-order dual model under mild assumptions. | |
| dc.publisher | Springer Verlag | |
| dc.subject | Nondifferentiable mathematical programming - Converse duality - Higher-order dual models | |
| dc.title | A converse duality theorem on higher-order dual models in nondifferentiable mathematical programming | |
| dc.type | Journal Article | |
| dcterms.source.issn | 18624472 | |
| dcterms.source.title | Optimization Letters | |
| curtin.note |
The original publication is available at: | |
| curtin.department | Department of Mathematics and Statistics | |
| curtin.accessStatus | Fulltext not available |