Luís M. Fernandes

Learn More
In this paper, we discuss the solution of linear and quadratic eigenvalue complementarity problems (EiCPs) using an enumerative algorithm of the type introduced by Júdice et al. [1]. Procedures for computing the interval that contains all the eigenvalues of the linear EiCP are first presented. A nonlinear programming (NLP) model for the quadratic EiCP is(More)
In this paper, a parametric algorithm is introduced for computing all eigenvalues for two Eigenvalue Complementarity Problems discussed in the literature. The algorithm searches a finite number of nested intervals [ ¯ í µí±™, ¯ í µí±¢] in such a way that, in each iteration, either an eigenvalue is computed in [ ¯ í µí±™, ¯ í µí±¢] or a certificate of(More)
In this paper, the solution of the symmetric Quadratic Eigenvalue Complementarity Problem (QE-iCP) is addressed. The QEiCP has a solution provided the so-called co-regular and co-hyperbolic properties hold and is said to be symmetric if all the matrices involved in its definition are symmetric. We show that under the two conditions stated above the(More)
In this paper a discrete location model for non-essential service facilities planning is described, which seeks the number, location, and size of facilities, that maximizes the total expected demand attracted by the facilities. It is assumed that the demand for service is sensitive to the distance from facilities and to their size. It is also assumed that(More)
This paper addresses the problem of finding an optimal correction of an inconsistent linear system, where only the nonzero coefficients of the constraint matrix are allowed to be perturbed for reconstructing a consistent system. Using the Frobenius norm as a measure of the distance to feasibility, a nonconvex minimization problem is formulated, whose(More)
  • 1