GAMS — The Solver Manuals - Available Software

COIN-OR 77
The above statement should appear before the Solve statement. If CoinGlpk was specified as the default solver
during GAMS installation, the above statement is not necessary.
The GAMS/CoinGlpk options file consists of one option or comment per line. An asterisk (*) at the beginning
of a line causes the entire line to be ignored. Otherwise, the line will be interpreted as an option name and value
separated by any amount of white space (blanks or tabs). Following is an example options file coincbc.opt.
factorization givens
initbasis standard
It will cause CoinGlpk to use Givens rotation updates for the factorization and to use a standard initial basis.
(This option setting might help to avoid numerical difficulties in some cases.)
4.3 Summary of CoinGlpk Options
Among the following Glpk options, only the GAMS parameters reslim, iterlim, and optcr are currently supported
in CoinGlpk. Note, that the option optca to set the absolute MIP gap is currently not supported.
startalg
scaling
pricing
factorization
initbasis
tol dual
tol primal
tol integer
backtracking
presolve
cuts
covercuts
cliquecuts
gomorycuts
mircuts
reslim fixedrun
noiterlim
names
solvefinal
reslim
iterlim
optcr
writemps
LP solver for root node
scaling method
pricing method
basis factorization method
method for initial basis
dual feasibility tolerance
primal feasibility tolerance
integer feasibility tolerance
backtracking heuristic
LP presolver
turning on or off all cut generators
cover cuts
clique cuts
gomorys mixed-integer cuts
mixed-integer rounding cuts
resource limit for solve with fixed discrete variables
turn off iteration limit
indicates whether row and column names should be given to glpk
switch for solve of the problem with fixed discrete variables
resource limit
iteration limit
relative stopping tolerance on MIP gap
create MPS file for problem
4.4 Detailed Descriptions of CoinGlpk Options
startalg (string)
This option determines whether a primal or dual simplex algorithm should be used to solve an LP or the
root node of a MIP.
(default = primal)
primal Let GLPK use a primal simplex algorithm.
dual Let GLPK use a dual simplex algorithm.
scaling (string)