Please use this identifier to cite or link to this item: https://hdl.handle.net/10316/7723
DC FieldValueLanguage
dc.contributor.authorJúdice, Joaquim-
dc.contributor.authorSherali, Hanif-
dc.contributor.authorRibeiro, Isabel M.-
dc.date.accessioned2009-02-17T11:18:17Z-
dc.date.available2009-02-17T11:18:17Z-
dc.date.issued2007en_US
dc.identifier.citationComputational Optimization and Applications. 37:2 (2007) 139-156en_US
dc.identifier.urihttps://hdl.handle.net/10316/7723-
dc.description.abstractAbstract In this paper an eigenvalue complementarity problem (EiCP) is studied, which finds its origins in the solution of a contact problem in mechanics. The EiCP is shown to be equivalent to a Nonlinear Complementarity Problem, a Mathematical Programming Problem with Complementarity Constraints and a Global Optimization Problem. A finite Reformulation–Linearization Technique (Rlt)-based tree search algorithm is introduced for processing the EiCP via the lattermost of these formulations. Computational experience is included to highlight the efficacy of the above formulations and corresponding techniques for the solution of the EiCP.en_US
dc.language.isoengeng
dc.rightsopenAccesseng
dc.titleThe eigenvalue complementarity problemen_US
dc.typearticleen_US
dc.identifier.doi10.1007/s10589-007-9017-0en_US
item.openairetypearticle-
item.fulltextCom Texto completo-
item.languageiso639-1en-
item.grantfulltextopen-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
crisitem.author.orcid0000-0001-9441-4877-
Appears in Collections:FCTUC Matemática - Artigos em Revistas Internacionais
Files in This Item:
File Description SizeFormat
obra.pdf370.1 kBAdobe PDFView/Open
Show simple item record

SCOPUSTM   
Citations

57
checked on May 1, 2023

WEB OF SCIENCETM
Citations 1

59
checked on May 2, 2023

Page view(s) 50

525
checked on Jul 16, 2024

Download(s) 50

746
checked on Jul 16, 2024

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.