16.01.2015 Views

GAMS — The Solver Manuals - Available Software

GAMS — The Solver Manuals - Available Software

GAMS — The Solver Manuals - Available Software

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

MINOS 359<br />

of each major iteration.<br />

(Default = 1 or 100)<br />

Superbasics limit i<br />

This places a limit on the storage allocated for superbasic variables. Ideally, i should be set slightly larger<br />

than the number of degrees of freedom expected at an optimal solution.<br />

For linear problems, an optimum is normally a basic solution with no degrees of freedom. (<strong>The</strong> number of<br />

variables lying strictly between their bounds is not more than m, the number of general constraints.) <strong>The</strong><br />

default value of i is therefore 1.<br />

For nonlinear problems, the number of degrees of freedom is often called the number of independent variables.<br />

Normally, i need not be greater than n 1 + 1, where n 1 is the number of nonlinear variables.<br />

For many problems, i may be considerably smaller than n 1 . This will save storage if n 1 is very large.<br />

This parameter also sets the Hessian dimension, unless the latter is specified explicitly (and conversely). If<br />

neither parameter is specified, <strong>GAMS</strong> chooses values for both, using certain characteristics of the problem.<br />

(Default = Hessian dimension)<br />

Unbounded objective value r<br />

<strong>The</strong>se parameters are intended to detect unboundedness in nonlinear problems. During a line search of the<br />

form<br />

minimize F (x + αp)<br />

α<br />

If |F | exceeds r or if α exceeds r 2 , iterations are terminated with the exit message PROBLEM IS UNBOUNDED<br />

(OR BADLY SCALED).<br />

If singularities are present, unboundedness in F (x) may be manifested by a floating-point overflow (during<br />

the evaluation of F (x + αp), before the test against r 1 can be made.<br />

Unboundedness is x is best avoided by placing finite upper and lower bounds on the variables. See also the<br />

Minor damping parameter.<br />

(Default = 10 20 )<br />

Unbounded step size r<br />

<strong>The</strong>se parameters are intended to detect unboundedness in nonlinear problems. During a line search of the<br />

form<br />

minimize F (x + αp)<br />

α<br />

If α exceeds r, iterations are terminated with the exit message PROBLEM IS UNBOUNDED (OR BADLY SCALED).<br />

If singularities are present, unboundedness in F (x) may be manifested by a floating-point overflow (during<br />

the evaluation of F (x + αp), before the test against r can be made.<br />

Unboundedness is x is best avoided by placing finite upper and lower bounds on the variables. See also the<br />

Minor damping parameter.<br />

(Default = 10 10 )<br />

Verify option i<br />

This option refers to a finite-difference check on the gradients (first derivatives) computed by <strong>GAMS</strong> for<br />

each nonlinear function. <strong>GAMS</strong> computes gradients analytically, and the values obtained should normally<br />

be taken as correct.<br />

Gradient verification occurs before the problem is scaled, and before the first basis is factorized. (Hence, it<br />

occurs before the basic variables are set to satisfy the general constraints Ax + s = 0.)<br />

(Default = 0)<br />

Verify option 0<br />

Only a cheap test is performed, requiring three evaluations of the nonlinear objective (if any) and two<br />

evaluations of the nonlinear constraints. Verify No is an equivalent option.<br />

Verify option 1<br />

A more reliable check is made on each component of the objective gradient. Verify objective gradients<br />

is an equivalent option.<br />

Verify option 2<br />

A check is made on each column of the Jacobian matrix associated with the nonlinear constraints.<br />

Verify constraint gradients is an equivalent option.

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

Saved successfully!

Ooh no, something went wrong!