The complementarity problem is examined in the case where the basic mapping is the sum of a finite number of superpositions of a univalent off-diagonal antitone mapping and a multivalent diagonal monotone one. An extension is proposed for the Jacobi algorithm, which constructs a sequence converging to a point solution. With the use of this property, the existence of a solution to the original problem is also established. Under certain additional conditions, the minimal element in the feasible set of this problem is one of its solutions. Copyright © 2005 by MAIK "Nauka/Interperiodica"
We consider a generalized mixed complementarity problem (MCP) with box constraints and multi-valued ...
We consider a generalized mixed complementarity problem (MCP) with box constraints and multi-valued ...
In this paper an algorithm is proposed to find an integral solution of (nonlinear) complementarity p...
The complementarity problem is examined in the case where the basic mapping is the sum of a finite n...
The complementarity problem is examined in the case where the basic mapping is the sum of a finite n...
We propose an extended version of Chandrasekaran's method for general complementarity problems with ...
We propose an extended version of Chandrasekaran's method for general complementarity problems with ...
We propose an extended version of Chandrasekaran's method for general complementarity problems with ...
We propose an extended version of Chandrasekaran's method for general complementarity problems with ...
We consider a generalized complementarity problem whose cost mapping is multi-valued and is the sum ...
We consider a generalized complementarity problem whose cost mapping is multi-valued and is the sum ...
We consider a generalized complementarity problem whose cost mapping is multi-valued and is the sum ...
We consider a generalized complementarity problem whose cost mapping is multi-valued and is the sum ...
We consider a generalized mixed complementarity problem (MCP) with box constraints and multi-valued ...
We consider a generalized mixed complementarity problem (MCP) with box constraints and multi-valued ...
We consider a generalized mixed complementarity problem (MCP) with box constraints and multi-valued ...
We consider a generalized mixed complementarity problem (MCP) with box constraints and multi-valued ...
In this paper an algorithm is proposed to find an integral solution of (nonlinear) complementarity p...
The complementarity problem is examined in the case where the basic mapping is the sum of a finite n...
The complementarity problem is examined in the case where the basic mapping is the sum of a finite n...
We propose an extended version of Chandrasekaran's method for general complementarity problems with ...
We propose an extended version of Chandrasekaran's method for general complementarity problems with ...
We propose an extended version of Chandrasekaran's method for general complementarity problems with ...
We propose an extended version of Chandrasekaran's method for general complementarity problems with ...
We consider a generalized complementarity problem whose cost mapping is multi-valued and is the sum ...
We consider a generalized complementarity problem whose cost mapping is multi-valued and is the sum ...
We consider a generalized complementarity problem whose cost mapping is multi-valued and is the sum ...
We consider a generalized complementarity problem whose cost mapping is multi-valued and is the sum ...
We consider a generalized mixed complementarity problem (MCP) with box constraints and multi-valued ...
We consider a generalized mixed complementarity problem (MCP) with box constraints and multi-valued ...
We consider a generalized mixed complementarity problem (MCP) with box constraints and multi-valued ...
We consider a generalized mixed complementarity problem (MCP) with box constraints and multi-valued ...
In this paper an algorithm is proposed to find an integral solution of (nonlinear) complementarity p...