Symmetric duality for minimax mixed integer programming problems with pseudo-invexity
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
Original language | English |
---|---|
Pages (from-to) | 37-42 |
Journal / Publication | European Journal of Operational Research |
Volume | 198 |
Issue number | 1 |
Publication status | Published - 1 Oct 2009 |
Link(s)
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. © 2008 Elsevier B.V. All rights reserved.
Research Area(s)
- Efficient solution, Multiobjective symmetric variational mixed integer problems, Partial-pseudo-invexity, Self-duality, Separability, Symmetric duality
Citation Format(s)
Symmetric duality for minimax mixed integer programming problems with pseudo-invexity. / Mishra, S. K.; Wang, S. Y.; Lai, K. K.
In: European Journal of Operational Research, Vol. 198, No. 1, 01.10.2009, p. 37-42.
In: European Journal of Operational Research, Vol. 198, No. 1, 01.10.2009, p. 37-42.
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review