Abstract
A Mond-Weir type multiobjective variational mixed integer symmetric dual program over arbitrary cones is formulated. Applying the separability and generalized F-convexity on the functions involved, weak, strong and converse duality theorems are established. Self duality theorem is proved. A close relationship between these variational problems and static symmetric dual minimax mixed integer multiobjective programming problems is also presented.
| Original language | English |
|---|---|
| Pages (from-to) | 71-82 |
| Number of pages | 12 |
| Journal | European Journal of Operational Research |
| Volume | 177 |
| Issue number | 1 |
| DOIs | |
| State | Published - 16 Feb 2007 |
| Externally published | Yes |
Keywords
- Efficient solutions
- Generalized F-convexity
- Mixed integer programming
- Multiobjective symmetric duality
- Variational problem
ASJC Scopus subject areas
- General Computer Science
- Modeling and Simulation
- Management Science and Operations Research
- Information Systems and Management
- Industrial and Manufacturing Engineering