Abstract
A pair of multiobjective mixed symmetric dual programs is formulated over arbitrary cones. Weak, strong, converse and self-duality theorems are proved for these programs under K-preinvexity and K-pseudoinvexity assumptions. This mixed symmetric dual formulation unifies the symmetric dual formulations of Suneja et al. (2002) [14] and Khurana (2005) [15].
| Original language | English |
|---|---|
| Pages (from-to) | 319-326 |
| Number of pages | 8 |
| Journal | Computers and Mathematics with Applications |
| Volume | 59 |
| Issue number | 1 |
| DOIs | |
| State | Published - Jan 2010 |
| Externally published | Yes |
Bibliographical note
Funding Information:The research of the second author was supported by the Department of Atomic Energy, Government of India, under the NBHM Post-Doctoral Fellowship Program No. 40/9/2005-R&D II/916.
Keywords
- Cone constraints
- K-preinvexity
- Multiobjective programming
- Symmetric duality
- Weakly efficient solutions
ASJC Scopus subject areas
- Modeling and Simulation
- Computational Theory and Mathematics
- Computational Mathematics