Abstract.
The purpose of this paper is devoted to the least element problems of feasible sets for vector complementarity problems under certain conditions. We generalize the notion of a Z-map due to Riddell to the set-valued case. Some conditions of the feasible set being a sublattice are presented and the least element problems are discussed under some strict pseudomonotonicity conditions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Acknowledgments.
The authors would like to express their thanks to Professor S. Schaible and two anonymous referees for their helpful comments and suggestions.
Author information
Authors and Affiliations
Corresponding author
Additional information
Manuscript received: August 2003/Final version received: February 2004
This work was supported by the National Natural Science Foundation of China.
Rights and permissions
About this article
Cite this article
Fang, Yp., Huang, Nj. On least element problems for feasible sets in vector complementarity problems. Math Meth Oper Res 60, 369–377 (2004). https://doi.org/10.1007/s001860400375
Issue Date:
DOI: https://doi.org/10.1007/s001860400375