The GAMS Callable Program Library for Variational and Complementarity Solvers

dc.contributor.author	Preckel, Paul
dc.contributor.author	Ferris, Michael
dc.contributor.author	Dirkse, Steven
dc.date.accessioned	2013-01-25T19:50:23Z
dc.date.available	2013-01-25T19:50:23Z
dc.date.issued	1994-07-19
dc.identifier.citation	94-07	en
dc.identifier.uri	http://digital.library.wisc.edu/1793/64532
dc.description.abstract	The GAMS modeling language has recently been extended to enable the formulation of Mixed Complementarity Problems (MCP). The GAMS Callable Program Library (CPLIB) is a set of Fort ran subroutines developed as an extension for the GAMS I/O library and designed to provide a simple and convenient interface to the MCP defined by a GAMS model. This paper provides technical documentation for CPLIB for use by those who are developing or have developed algorithms for MCP, in order that their solvers may be made available as GAMS subsystems.	en
dc.subject	complementarity	en
dc.title	The GAMS Callable Program Library for Variational and Complementarity Solvers	en
dc.type	Technical Report	en

Math Prog Technical Reports
Math Prog Technical Reports Archive for the Department of Computer Sciences at the University of Wisconsin-Madison