A note on strong duality theorem for a multiobjective higher order nondifferentiable symmetric dual programs

Indira P. Debnath (), S. K. Gupta () and I. Ahmad ()
Additional contact information
Indira P. Debnath: Indian Institute of Technology Roorkee
S. K. Gupta: Indian Institute of Technology Roorkee
I. Ahmad: King Fahd University of Petroleum and Minerals

OPSEARCH, 2016, vol. 53, issue 1, No 9, 156 pages

Abstract: 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)).

Keywords: Symmetric duality; Strong duality; Multiobjective programming; Support function; Properly efficient solution (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s12597-015-0221-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:opsear:v:53:y:2016:i:1:d:10.1007_s12597-015-0221-x

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/12597

DOI: 10.1007/s12597-015-0221-x

Access Statistics for this article

OPSEARCH is currently edited by Birendra Mandal

More articles in OPSEARCH from Springer, Operational Research Society of India
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().