Symmetric duality for minimax multiobjective variational mixed integer programming problems with partial-invexity |
| |
| Authors: | Xiuhong Chen Jiangyu Yang |
| |
| Affiliation: | 1. Department of Computer Science, Nanjing University of Science and Technology, Nanjing 210094, PR China;2. School of Information Technology, Southern Yangtze University, Wuxi 214122, PR China |
| |
| 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 |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
