Minimax and symmetric duality for a class of multiobjective variational mixed integer programming problems
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.
symmetric duality separability partial-invexity self-duality efficient solution multiobjective variational mixed integer problem