On least element problems for feasible sets in vector complementarity problems

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. Copyright Springer-Verlag 2004

MoreLess

Year of publication:	2004
Authors:	Fang, Ya-ping ; Huang, Nan-jing
Published in:	Computational Statistics. - Springer. - Vol. 60.2004, 3, p. 369-377
Publisher:	Springer
Subject:	Strictly pseudomonotone map \| Z-map \| Vector complementarity problem \| Vector variational inequality \| Feasible set \| Least element problem

Online Resource

Check full text access |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	text/html
Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10010759208