The GAMS Callable Program Library for Variational and Complementarity Solvers
暂无分享,去创建一个
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 Fortran subroutines developed as an extension for the GAMS I/O library and designed to provide a simple and convenient interface to the MCP deened 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.
[1] Arne Drud,et al. CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems , 1985, Math. Program..
[2] David Kendrick,et al. GAMS, a user's guide , 1988, SGNM.
[3] Michael A. Saunders,et al. MINOS 5. 0 user's guide , 1983 .
[4] William H. Press,et al. Numerical Recipes: The Art of Scientific Computing , 1987 .
[5] T. Rutherford. Extension of GAMS for complementarity problems arising in applied economic analysis , 1995 .