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)).
| Original language | English |
|---|---|
| Pages (from-to) | 151-156 |
| Number of pages | 6 |
| Journal | OPSEARCH |
| Volume | 53 |
| Issue number | 1 |
| DOIs | |
| State | Published - 1 Mar 2016 |
Bibliographical note
Funding Information: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.
Publisher Copyright:
© 2015, Operational Research Society of India.
Keywords
- Multiobjective programming
- Properly efficient solution
- Strong duality
- Support function
- Symmetric duality
ASJC Scopus subject areas
- Management Information Systems
- Information Systems
- Computer Science Applications
- Management Science and Operations Research