introduction
GAMS/CoinGlpk brings the open source LP/MIP solver Glpk from the GNU Open Software foundation to the broad audience of GAMS users.
The code has been written primarily by A. Makhorin.
The GAMS interface for Glpk is maintained by Stefan Vigerske, Humboldt University, in a COIN-OR project called GAMSlinks.
The interface uses the OSI Glpk interface written by Vivian De Smedt and Braden Hunsaker.<BR>
For more information visit the web site for
<a href="http://www.coin-or.org">COIN-OR</a>,
<a href="https://projects.coin-or.org/Osi">OSI<a>,
<a href="http://www.gnu.org/software/glpk/glpk.html">Glpk<a>, and
<a href="https://projects.coin-or.org/GAMSlinks">GAMSlinks</a>.<BR>
For documentation of GAMS parameters, see the <A href="http://www.gams.com/docs/parame.htm">GAMS parameters documentation</A>.


writemps
Write an MPS problem file.
The parameter value is the name of the MPS file.


startalg
This option determines whether a primal or dual simplex algorithm should be used to solve the root node.


scaling
This option determines the method how the constraint matrix is scaled.


pricing
Sets the pricing method for both primal and dual simplex.


tol_dual
Absolute tolerance used to check if the current basis solution is dual feasible.
(Glpk manual: Do not change this parameter without detailed understanding its purpose.)


tol_primal
Relative tolerance used to check if the current basis solution is primal feasible.
(Glpk manual: Do not change this parameter without detailed understanding its purpose.)


tol_integer
Absolute tolerance used to check if the current basis solution is integer feasible.
(Glpk manual: Do not change this parameter without detailed understanding its purpose.)


backtracking
Determines which method to use for the backtracking heuristic.


cuts
Determines whether cuts should be generated for the root problem.
Currently only Gomory's mixed integer cuts are implemented.


reslim
Maximum time in seconds.


iterlim
Maximum number of iterations.


optcr
Relative optimality criterion for a MIP.
Glpk uses this parameter as relative tolerance to check if the value of the objective function is not better than in the best known integer feasible solution.
