Abstract
In this paper, a unified higher order dual is formulated for a nondifferentiable multiobjective programming problem, where every component of the objective function contains a term involving the support function of a compact convex set. Results about duality are presented under more suitable conditions. This higher order symmetric dual formulation unifies the symmetric dual formulations in the literature.
| Original language | English |
|---|---|
| Pages (from-to) | 419-425 |
| Number of pages | 7 |
| Journal | Mathematical and Computer Modelling |
| Volume | 55 |
| Issue number | 3-4 |
| DOIs | |
| State | Published - Feb 2012 |
Bibliographical note
Funding Information:This research is supported by King Fahd University of Petroleum and Minerals , Dhahran- 31261 , Saudi Arabia. The author is thankful to the referees for their valuable suggestions to improve the presentation of the paper.
Keywords
- Cones
- Efficient solutions
- Higher order duality
- Higher order generalized type-I functions
- Nondifferentiable multiobjective programming
- Support function
ASJC Scopus subject areas
- Modeling and Simulation
- Computer Science Applications
Fingerprint
Dive into the research topics of 'Unified higher order duality in nondifferentiable multiobjective programming involving cones'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver