Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
482135 | European Journal of Operational Research | 2007 | 12 Pages |
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
I. Ahmad, Z. Husain,