Minimax mixed integer symmetric duality for multiobjective variational problems

Minimax mixed integer symmetric duality for multiobjective variational problems

0.00 Avg rating0 Votes
Article ID: iaor20084637
Country: Netherlands
Volume: 177
Issue: 1
Start Page Number: 71
End Page Number: 82
Publication Date: Feb 2007
Journal: European Journal of Operational Research
Authors: ,
Keywords: programming: integer
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.

Reviews

Required fields are marked *. Your email address will not be published.