In this paper, general linear complementarity problems (LCPs) are studied via global optimization problems. In particular, unsolvable LCPs are reformulated as multicriteria optimization, minimax optimization and quadratic programming problems. The solvability and unsolvability of LCPs are obtained via these reformulations. Furthermore, first-order and second-order global optimality conditions of LCPs are derived. Some examples are also given to demonstrate these optimality conditions.Department of Applied Mathematic
AbstractThe linear complementarity problem LCP(M,q) is to find a vector z in IRn satisfying zT(Mz+q)...
Finite termination, at point satisfying the minimum principle necessary optimality condition, is est...
We show that the Extended Linear ComplementarityProblem (ELCP) can be recast as a standard Linear Co...
We define the Linear Complementarity Problem (LCP) and outline its applications including those to L...
AbstractThe extended linear complementarity problem (XLCP) has been introduced in a recent paper by ...
A Mathematical Program with Linear Complementarity Constraints (MPLCC) is an optimization problem wh...
Abstract Linear programming with linear complementarity constraints (LPLCC) is an area of active res...
AbstractWe give here bounds for the feasible domain and the solution norm of Linear Complementarity ...
A family of complementarity problems are defined as extensions of the well known Linear Complementar...
The extended linear complementarity problem (XLCP) has been introduced in a recent paper by Mangasar...
A family of complementarity problems are defined as extensions of the well known Linear Complementar...
Abstract. We consider the extended linear complementarity problem (XLCP) introduced by Mangasarian a...
AbstractWe describe a “condition” number for the linear complementarity problem (LCP), which charact...
The nonlinear complementarity problem is cast as an unconstrained minimization problem that is obtai...
Abstract — The linear complementarity problem (LCP) is a general problem that unifies linear and qua...
AbstractThe linear complementarity problem LCP(M,q) is to find a vector z in IRn satisfying zT(Mz+q)...
Finite termination, at point satisfying the minimum principle necessary optimality condition, is est...
We show that the Extended Linear ComplementarityProblem (ELCP) can be recast as a standard Linear Co...
We define the Linear Complementarity Problem (LCP) and outline its applications including those to L...
AbstractThe extended linear complementarity problem (XLCP) has been introduced in a recent paper by ...
A Mathematical Program with Linear Complementarity Constraints (MPLCC) is an optimization problem wh...
Abstract Linear programming with linear complementarity constraints (LPLCC) is an area of active res...
AbstractWe give here bounds for the feasible domain and the solution norm of Linear Complementarity ...
A family of complementarity problems are defined as extensions of the well known Linear Complementar...
The extended linear complementarity problem (XLCP) has been introduced in a recent paper by Mangasar...
A family of complementarity problems are defined as extensions of the well known Linear Complementar...
Abstract. We consider the extended linear complementarity problem (XLCP) introduced by Mangasarian a...
AbstractWe describe a “condition” number for the linear complementarity problem (LCP), which charact...
The nonlinear complementarity problem is cast as an unconstrained minimization problem that is obtai...
Abstract — The linear complementarity problem (LCP) is a general problem that unifies linear and qua...
AbstractThe linear complementarity problem LCP(M,q) is to find a vector z in IRn satisfying zT(Mz+q)...
Finite termination, at point satisfying the minimum principle necessary optimality condition, is est...
We show that the Extended Linear ComplementarityProblem (ELCP) can be recast as a standard Linear Co...