On least element problems for feasible sets in vector complementarity problems

Ya-ping Fang () and Nan-jing Huang ()

Mathematical Methods of Operations Research, 2004, vol. 60, issue 3, 369-377

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

Keywords: Strictly pseudomonotone map; Z-map; Vector complementarity problem; Vector variational inequality; Feasible set; Least element problem (search for similar items in EconPapers)
Date: 2004
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s001860400375 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:mathme:v:60:y:2004:i:3:p:369-377

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/s001860400375

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().