Minimax and symmetric duality for a class of multiobjective variational mixed integer programming problems [An article from: European Journal of Operational Research]

This digital document is a journal article from European Journal of Operational Research, published by Elsevier in 2004. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.

Description:
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.