Feasibility and Solvability for Vector Complementarity Problems1

Y. P. Fang and N. J. Huang
Additional contact information
Y. P. Fang: Sichuan University
N. J. Huang: Sichuan University

Journal of Optimization Theory and Applications, 2006, vol. 129, issue 3, No 2, 373-390

Abstract: Abstract The purpose of this paper is to discuss the feasibility and solvability of vector complementarity problems. We prove that, under suitable conditions, the vector complementarity problem with a pseudomonotonicity assumption is solvable whenever it is strictly feasible. By strengthening the generalized monotonicity condition, we show also that the homogeneous vector complementarity problem is solvable whenever it is feasible. At last, we study the solvability of the vector complementarity problem on product spaces.

Keywords: Vector complementarity problem; pseudomonotonicity; feasibility; solvability (search for similar items in EconPapers)
Date: 2006
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10957-006-9073-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:joptap:v:129:y:2006:i:3:d:10.1007_s10957-006-9073-0

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1007/s10957-006-9073-0

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().