On the maximum degree of an LCP map

On the maximum degree of an LCP map

0.00 Avg rating0 Votes
Article ID: iaor1991278
Country: United States
Volume: 15
Start Page Number: 423
End Page Number: 429
Publication Date: Nov 1990
Journal: Mathematics of Operations Research
Authors:
Abstract:

The Linear Complementarity Problem can be shown to be equivalent to inverting a certain piecewise linear mapping. The paper gives bounds on the degree of this mapping and presents a class of matrices that generates maps of high degree.

Reviews

Required fields are marked *. Your email address will not be published.