首页 | 本学科首页   官方微博 | 高级检索  
     


L-Matrices and solvability of linear complementarity problems by a linear program-Matrices and solvability of linear complementarity problems by a linear program
Authors:Fengmei Yang  Shouyang Wang  Mei Yu  Luis Coladas
Affiliation:(1) Department of Mathematics and Information Science, Beijing University of Chemical Technology, 100029 Beijing, China;(2) Institute of Systems Science, Academy of Mathematics and Systems Sciences Chinese Academy of Sciences, 100080 Beijing, China;(3) Department of Statistics and Operations Research, University of Santiago de Compostela, Santiago de Compostela, Spain
Abstract:The classes ofL 1-matrices,L 2-matrices,L 3-matrices andW-matrices are introduced to study solvability of a linear complementarity problem via solving a linear program. Three sufficient conditions are presented to guarantee that a linear complementarity problem is solvable via a linear program. The new sufficient conditions are weaker than the ones introduced by Mangasarian. This fact is also illustrated by an example. Partially supported by NSFC. This author is also with College of Business Administration of Human University as a Lotus chair professor.
Keywords:Linear complementarity problems  linear programs
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号