Complementarity Problems in GAMS and the PATH Solver
| dc.contributor.author | Munson, Todd | |
| dc.contributor.author | Ferris, Michael | |
| dc.date.accessioned | 2013-01-17T20:42:54Z | |
| dc.date.available | 2013-01-17T20:42:54Z | |
| dc.date.issued | 1998-09-25 | |
| dc.identifier.citation | 98-12 | en |
| dc.identifier.uri | http://digital.library.wisc.edu/1793/64384 | |
| dc.description.abstract | A fundamental mathematical problem is to find a solution to a square system of nonlinear equations. There are many methods to approach this problem, the most famous of which is Newton?s method. In this paper, we describe a generalization of this problem, the complementarity problem. We show how such problems are modeled within the GAMS modeling language and provide details about the PATH solver, a generalization of Newton?s method, for finding a solution. While the modeling format is applicable in many disciplines, we draw the examples in this paper from an economic background. Finally, some extensions of the modeling format and the solver are described. | en |
| dc.subject | algorithms | en |
| dc.subject | variational inequalities | en |
| dc.subject | complementarity problems | en |
| dc.title | Complementarity Problems in GAMS and the PATH Solver | en |
| dc.type | Technical Report | en |
Files in this item
This item appears in the following Collection(s)
-
Math Prog Technical Reports
Math Prog Technical Reports Archive for the Department of Computer Sciences at the University of Wisconsin-Madison

