This manual relates to an old release of the Library.
The documentation for the current release is also available on this site.
Example description
 E04VJF Example Program Results

 NLP problem contains   4 variables

 NEA (the number of nonzero entries in A) =   4
   I     IAFUN(I)   JAVAR(I)          A(I)
 ----    --------   --------   -----------
   1         4         1       -1.0000E+00
   2         5         1        1.0000E+00
   3         4         2        1.0000E+00
   4         5         2       -1.0000E+00

 NEG (the number of nonzero entries in G) =  10
   I     IGFUN(I)   JGVAR(I)
 ----    --------   --------
   1         1         1
   2         2         1
   3         3         1
   4         1         2
   5         2         2
   6         3         2
   7         6         3
   8         6         4
   9         1         3
  10         2         4

 Final objective value =      5126.5
 Optimal X =    1.189E-01  -3.962E-01   6.799E+02   1.026E+03