Abstract
A pair of Mond-Weir type second order symmetric nondifferentiable multiobjective programs is formulated. Weak, strong and converse duality theorems are established under η-pseudobonvexity assumptions. Special cases are discussed to show that this paper extends some work appeared in this area.
| Original language | English |
|---|---|
| Pages (from-to) | 23-34 |
| Number of pages | 12 |
| Journal | Information Sciences |
| Volume | 173 |
| Issue number | 1-3 |
| DOIs | |
| State | Published - 16 Jun 2005 |
| Externally published | Yes |
Keywords
- Efficient solutions
- Multiobjective symmetric duality
- Nondifferentiable programming
- Properly efficient solutions
- η-Pseudobonvexity
ASJC Scopus subject areas
- Software
- Control and Systems Engineering
- Theoretical Computer Science
- Computer Science Applications
- Information Systems and Management
- Artificial Intelligence