The linear complementarity problem is a continuous optimization problem that generalizes convex quadratic programming, Nash equilibria of bimatrix games and several such problems. This paper presents a continuous optimization formulation for the weighted independence number of a graph by characterizing it as the maximum weighted l1 norm over the solution set of a linear complementarity problem ...

The strict feasibility plays an important role in the development of theory and algorithms of complementarity problems. In this paper, we establish su cient conditions to ensure the strict feasibility of a nonlinear complementarity problem. Our analysis method, based on a newly introduced concept of -exceptional sequence, can be viewed as a uni ed approach for proving the existence of a strictl...

The aim of this paper is to introduce and study set- valued homomorphism on lattices and T-rough lattice with respect to a sublattice. This paper deals with T-rough set approach on the lattice theory. The result of this study contributes to, T-rough fuzzy set and approximation theory and proved in several papers. Keywords: approximation space; lattice; prime ideal; rough ideal; T-rough set; set...

We investigate the properties of a new merit function which allows us to reduce a nonlinear complementarity problem to an unconstrained global minimization one. Assuming that the complementarity problem is deened by a P 0-function we prove that every stationary point of the unconstrained problem is a global solution; furthermore, if the complementarity problem is deened by a uniform P-function,...