Showing 1 - 10 of 39,318
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 …
Persistent link: https://www.econbiz.de/10011343323
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 …
Persistent link: https://www.econbiz.de/10011255731
AMS classifications: 90C33, 90C26, 91B50.
Persistent link: https://www.econbiz.de/10011092187
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 …
Persistent link: https://www.econbiz.de/10005137267
the triangulation lies in a cube of size one. With respect to this triangulation we assume that the function satisfies … prove this we use a simplicial algorithm that terminates with a zero point within a finite number of iterations. The …
Persistent link: https://www.econbiz.de/10011378347
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 …
Persistent link: https://www.econbiz.de/10014028508
AMS classifications: 47H10; 54H25; 55M20; 90C33; 91B50
Persistent link: https://www.econbiz.de/10011090682
the triangulation lies in a cube of size one. With respect to this triangulation we assume that the function satisfies … prove this we use a simplicial algorithm that terminates with a zero point within a finite number of iterations. The …
Persistent link: https://www.econbiz.de/10010325776
Persistent link: https://www.econbiz.de/10003807167
the triangulation lies in a cube of size one. With respect to this triangulation we assume that the function satisfies … prove this we use a simplicial algorithm that terminates with a zero point within a finite number of iterations. The …
Persistent link: https://www.econbiz.de/10014206228