Minimax and symmetric duality for a class of multiobjective variational mixed integer programming problems

Minimax and symmetric duality for a class of multiobjective variational mixed integer programming problems

0.00 Avg rating0 Votes
Article ID: iaor20051951
Country: Netherlands
Volume: 154
Issue: 1
Start Page Number: 71
End Page Number: 83
Publication Date: Apr 2004
Journal: European Journal of Operational Research
Authors:
Keywords: programming: integer
Abstract:

In this paper, we formulate a pair of multiobjective variational mixed integer programs for arbitrary cones. Under the separability and partial-invexity assumptions on the functions involved, we establish the weak, strong, converse and self-duality theorems related to efficient solution.

Reviews

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