Abstract
Purchase PDF (209 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (0)
Purchase PDF (198 K)
doi:10.1016/j.ejor.2006.04.045 
Copyright © 2006 Elsevier B.V. All rights reserved.
Discrete Optimization
Symmetric duality for minimax multiobjective variational mixed integer programming problems with partial-invexity
Received 6 December 2004;
accepted 18 April 2006.
Available online 26 July 2006.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
A pair of symmetric dual multiobjective variational mixed integer programs for the polars of arbitrary cones are formulated, which some primal and dual variables are constrained to belong to the set of integers. Under the separability with respect to integer variables and partial-invexity assumptions on the functions involved, we prove the weak, strong, converse and self-duality theorems to related minimax efficient solution. These results include some of available results.
Keywords: Multiobjective variational problems; Mixed integer programming; Symmetric duality; Self-duality; Partial-invexity; Closed convex cone
