G2: Constrained


G2a:   Linear programming  (8 routines)
G2b:   Transportation and assignments problem  (1 routine)
G2c:   Integer programming  (2 routines)
G2d:   Network (for network reliability search class M)  (1 routine)
G2e:   Quadratic programming  (6 routines)
G2f:   Geometric programming  (0 routines)
G2g:   Dynamic programming  (0 routines)
G2h:   General nonlinear programming  (9 routines)
G2i:   Global solution to nonconvex problems  (2 routines)

Library Contents
GAMS Index
Up (G)
Previous (G1)
Next (G3)
© The Numerical Algorithms Group Ltd, Oxford UK. 2001