Similar Search Results

Solving Discrete Systems of Nonlinear Equations

Laan, Gerard van der; Talman, Dolf; Yang, Zaifu - 2009

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

Solving discrete systems of nonlinear equations

Laan, Gerard van der (contributor); Talman, Dolf (contributor) - 2008

Persistent link: https://www.econbiz.de/10003807167

Solving discrete systems of nonlinear equations

Laan, Gerard van der; Talman, Dolf; Yang, Zaifu - 2009

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

Computing integral solutions of complementarity problems

Laan, Gerard van der; Talman, Dolf; Yang, Zaifu - 2004

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

Combinatorial integer labeling theorems on finite sets with an application to discrete systems of nonlinear equations

Laan, Gerard van der; Talman, Dolf; Yang, Zaifu - 2007

Tucker's well-known combinatorial lemma states that for any given symmetric triangulation of the n-dimensional unit cube and for any integer labeling that assigns to each vertex of the triangulation a label from the set {1,2,...n,-1,-2,....-n} with the property that antipodal vertices on the...

Persistent link: https://www.econbiz.de/10011373836

Solving discrete zero point problems with vector labeling

Laan, Gerard van der; Talman, Dolf; Yang, Zaifu - 2005

proof 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. …

Persistent link: https://www.econbiz.de/10011346458

Optimal resource allocation in multiclass networks

Naumov, Valeriy; Martikainen, Olli - 2011

In this paper, we study resource allocation in multiclass networks having several types of flexible servers and general constraints on the number of servers at each station. Each job class is characterized by the station where the job is processed and by the amount of work allocated to that...

Persistent link: https://www.econbiz.de/10009388987

A Numerical Algorithm to Find All Scalar Feedback Nash Equilibria

Engwerda, Jacob Christiaan - 2013

In this note we generalize a numerical algorithm presented in [9] to calculate all solutions of the scalar algebraic …-quadratic differential game. The algorithm is based on calculating the positive roots of a polynomial matrix …

Persistent link: https://www.econbiz.de/10013076437

Solving discrete systems of nonlinear equations

Laan, Gerard van der; Talman, Dolf; Yang, Zaifu - In: European journal of operational research : EJOR 214 (2011) 3, pp. 493-500

Persistent link: https://www.econbiz.de/10009314914

Solving discrete systems of nonlinear equations

Laan, Gerard van der; Talman, Dolf; Yang, Zaifu - 2009

Persistent link: https://www.econbiz.de/10003861027