```
E04US_A1W_F Example Program Results

*** e04us

Parameters
----------

Linear constraints.....         1       Variables..............         2
Nonlinear constraints..         1       Subfunctions...........        44

Infinite bound size....  1.00E+20       COLD start.............
Infinite step size.....  1.00E+20       EPS (machine precision)  1.11E-16
Step limit.............  2.00E+00       Hessian................        NO

Linear feasibility.....  1.05E-08       Crash tolerance........  1.00E-02
Nonlinear feasibility..  1.05E-08       Optimality tolerance...  3.26E-12
Line search tolerance..  9.00E-01       Function precision.....  4.37E-15

Derivative level.......         3       Monitoring file........        -1
Verify level...........         0

Major iterations limit.        50       Major print level......         1
Minor iterations limit.        50       Minor print level......         0

J'J initial Hessian....                 Reset frequency........         2

Workspace provided is     IWORK(       9),  WORK(     306).
To solve problem we need  IWORK(       9),  WORK(     306).

-----------------------------------------

The constraint Jacobian seems to be ok.

The largest relative error was    1.89E-08  in constraint    1

----------------------------------------

The objective Jacobian seems to be ok.

The largest relative error was    1.04E-08  in subfunction    3

Exit from NP problem after     6 major iterations,
8 minor iterations.

Varbl State     Value       Lower Bound   Upper Bound    Lagr Mult   Slack

V   1    FR   0.419953      0.400000          None           .      1.9953E-02
V   2    FR    1.28485      -4.00000          None           .       5.285

L Con State     Value       Lower Bound   Upper Bound    Lagr Mult   Slack

L   1    FR    1.70480       1.00000          None           .      0.7048

N Con State     Value       Lower Bound   Upper Bound    Lagr Mult   Slack

N   1    LL  -9.767742E-13       .            None      3.3358E-02 -9.7677E-13

Exit e04us  - Optimal solution found.

Final objective value =   0.1422983E-01
Optimal solution =    0.01423

Solution point, x
1          2
1      0.4200     1.2848

Computational mode    : algorithmic

Derivatives:
dx(1)/druser(1:44)
1            2            3            4            5
1   -4.9631E-25   0.0000E+00   4.9441E-04   4.2804E-04   4.9441E-04

6            7            8            9           10
1    4.2804E-04   5.3633E-05   5.3633E-05   4.3470E-05   2.3145E-05

11           12           13           14           15
1    4.5591E-06   2.2250E-06   2.2250E-06   3.1985E-07   2.0070E-07

16           17           18           19           20
1    2.0070E-07   5.1842E-08   4.0433E-08   4.5616E-10   4.5616E-10

21           22           23           24           25
1    1.5065E-09  -6.6867E-11  -6.6867E-11  -1.6147E-10  -4.2932E-13

26           27           28           29           30
1   -1.7526E-11  -1.7526E-11  -1.7431E-12  -2.5707E-12  -1.7431E-12

31           32           33           34           35
1   -4.7075E-13  -5.7168E-13  -1.6597E-13  -1.6597E-13  -2.0317E-13

36           37           38           39           40
1   -4.8052E-14  -5.2918E-14  -1.7234E-14  -5.1440E-15  -6.5606E-15

41           42           43           44
1   -1.8226E-15  -1.8226E-15  -6.3729E-16  -2.0483E-16
```