{"title":"参数线性互补问题","authors":"K. Tammer","doi":"10.18452/2540","DOIUrl":null,"url":null,"abstract":"We study linear complementarity problems depending on parameters in the right hand side and or in the matrix For the case that all elements of the right hand side are independent parameters we give a new proof for the equivalence of three di erent important local properties of the corresponding solution set map in a neighbourhood of an element of its graph For one and multiparametric problems this equivalence does not hold and the corresponding graph may have a rather complicate structure But we are able to show that for a generic class of linear complementarity problems depending linearly on only one real parameter the situation is much more easier","PeriodicalId":120488,"journal":{"name":"mathematical programming with data perturbations","volume":"74 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Parametric Linear Complementarity Problems\",\"authors\":\"K. Tammer\",\"doi\":\"10.18452/2540\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study linear complementarity problems depending on parameters in the right hand side and or in the matrix For the case that all elements of the right hand side are independent parameters we give a new proof for the equivalence of three di erent important local properties of the corresponding solution set map in a neighbourhood of an element of its graph For one and multiparametric problems this equivalence does not hold and the corresponding graph may have a rather complicate structure But we are able to show that for a generic class of linear complementarity problems depending linearly on only one real parameter the situation is much more easier\",\"PeriodicalId\":120488,\"journal\":{\"name\":\"mathematical programming with data perturbations\",\"volume\":\"74 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-09-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"mathematical programming with data perturbations\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.18452/2540\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"mathematical programming with data perturbations","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18452/2540","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We study linear complementarity problems depending on parameters in the right hand side and or in the matrix For the case that all elements of the right hand side are independent parameters we give a new proof for the equivalence of three di erent important local properties of the corresponding solution set map in a neighbourhood of an element of its graph For one and multiparametric problems this equivalence does not hold and the corresponding graph may have a rather complicate structure But we are able to show that for a generic class of linear complementarity problems depending linearly on only one real parameter the situation is much more easier