24.10.2013 Views

LINDO/LINDOGlobal - Gams

LINDO/LINDOGlobal - Gams

LINDO/LINDOGlobal - Gams

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

282 <strong>LINDO</strong>/<strong>LINDO</strong>Global<br />

GOP ITRLIM IPM (real)<br />

This is the total barrier iteration limit summed over all branches in GOP. The default value is -1, which means no<br />

iteration limit is imposed. If this limit is reached, GOP will stop.<br />

(default = -1)<br />

GOP ITRLIM NLP (real)<br />

This is the total nonlinear iteration limit summed over all branches in GOP. The default value is -1, which means no<br />

iteration limit is imposed. If this limit is reached, GOP will stop.<br />

(default = -1)<br />

GOP LINEARZ (integer)<br />

This is a flag indicating if GOP exploits linearizable model.<br />

(default = 1)<br />

0 Exploit lineariable model<br />

1 Do not exploit lineariable model<br />

REPORTEVSOL (integer)<br />

(default = 0)<br />

STOC NSAMPLE PER STAGE (string)<br />

Comma separated list of sample sizes per stage. The sample size of stage 1 is assumed to be 1 so that this list starts<br />

with stage stage 2.<br />

STOC NSAMPLE SPAR (integer)<br />

Common sample size per stochastic parameter. Possible values are positive integers.<br />

(default = -1)<br />

STOC NSAMPLE STAGE (integer)<br />

Common sample size per stage.<br />

(default = -1)<br />

STOC RG SEED (integer)<br />

Seed to initialize the random number generator. Possible values are positive integers.<br />

(default = 1031)<br />

STOC METHOD (integer)<br />

Stochastic optimization method to solve the model.<br />

(default = -1)<br />

-1 Solve with the method chosen by the solver<br />

0 Solve the deterministic equivalent (DETEQ)<br />

1 Solve with the Nested Benders Decomposition (NBD) method<br />

STOC REOPT (integer)<br />

Reoptimization method to solve the node-models.<br />

(default = 0)<br />

0 Solver decides<br />

1 Use primal method<br />

2 Use dual simplex<br />

3 Use barrier solver

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!