Symmetric duality for minimax mixed integer programming problems with pseudo-invexity |
| |
| Authors: | SK Mishra SY Wang KK Lai |
| |
| Institution: | 1. Department of Mathematics, Statistics and Computer Science, College of Basic Sciences and Humanities, G.B. Pant University of Agriculture and Technology, Pantnagar, India;2. Institute of Systems Sciences, Academy of Mathematics Chinese Academy of Sciences, Beijing, China;3. Department of Management Sciences, City University of Hong Kong, 83 Tat Chee Avenue, Kowloon, Hong Kong |
| |
| Abstract: | In this paper, we consider the pair of symmetric dual multiobjective variational mixed integer programs proposed by Chen and Yang X. Chen, J. Yang, Symmetric duality for minimax multiobjective variational mixed integer programming problems with partial-invexity, European Journal of Operational Research 181 (2007) 76-85.] and extend some of their results under the assumptions of partial-pseudo-invexity and separability on the functions involved. These results include several results available in literature as special cases. |
| |
| Keywords: | Multiobjective symmetric variational mixed integer problems Separability Efficient solution Partial-pseudo-invexity Symmetric duality Self-duality |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
