algorithm is proposed to find an integral solution of (nonlinear) complementarity problems. The algorithm starts with a … stated under which the algorithm terminates with a simplex one of whose vertices is an integral solution of the …

In this paper an algorithm is proposed to find an integral solution of (nonlinear) complementarity problems. The … algorithm starts with a nonnegative integral point and generates a unique sequence of adjacent integral simplices of varying … dimension. Conditions are stated under which the algorithm terminates with a simplex one of whose vertices is an integral …

property and some boundary condition the function has a zero point. To prove this we use a simplicial algorithm that terminates …

zero point. To prove this we use a simplicial algorithm that terminates with a zero point within a finite number of …

using a combinatorial argument based on a simplicial algorithm with vector labeling and lexicographic linear programming … pivot steps. We also adept the algorithm to prove the existence of a solution to the discrete complementarity problem. …