Abstract
In this paper, we establish a strong duality theorem for a Mond-Weir type multiobjective higher order nondifferentiable symmetric dual programs. Our work relaxes the hypotheses used to prove the strong duality result (by omitting one of the condition (hypothesis (IV)), Theorem 2.1) in the recent paper (Yang et al. J. Ind. Manag. Optim. 9, 525–530, (2013)).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Agarwal, R.P., Ahmad, I., Gupta, S.K.: A note on higher order nondifferentiable symmetric duality in multiobjective programming. Appl. Math. Lett. 24, 1308–1311 (2011)
Chen, X.: Higher order symmetric duality in nondifferentiable multiobjective programming problems. J. Math. Anal. Appl. 290, 423–435 (2004)
Schechter, M.: More on subgradient duality. J. Math. Anal. Appl. 71, 251–262 (1979)
Yang, X., Yang, J., Wing, H., Lee, J.: Strong duality theorem for multiobjective higher order nondifferentiable symmetric dual programs. J. Ind. Manag. Optim. 9, 525–530 (2013)
Acknowledgments
The authors wish to thank the reviewers for her/his valuable and constructive suggestions which has considerably improved the presentation of the paper. The first author is also grateful to the Ministry of Human Resource and Development, India for financial support, to carry out this work.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Debnath, I.P., Gupta, S.K. & Ahmad, I. A note on strong duality theorem for a multiobjective higher order nondifferentiable symmetric dual programs. OPSEARCH 53, 151–156 (2016). https://doi.org/10.1007/s12597-015-0221-x
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12597-015-0221-x