nag_opt_handle_solve_lp_simplex (e04mkc) Example Program Results

 E04MK, Simplex method for LP problems
 Status: converged, an optimal solution found
 Final objective value         2.359648E-02
 
 Primal variables:
   idx   Lower bound       Value       Upper bound
     1  -1.00000E-02   -1.00000E-02    1.00000E-02
     2  -1.00000E-01   -1.00000E-01    1.50000E-01
     3  -1.00000E-02    3.00000E-02    3.00000E-02
     4  -4.00000E-02    2.00000E-02    2.00000E-02
     5  -1.00000E-01   -6.74853E-02    5.00000E-02
     6  -1.00000E-02   -2.28013E-03         inf
     7  -1.00000E-02   -2.34528E-04         inf
 
 Box bounds dual variables:
   idx   Lower bound       Value       Upper bound       Value
     1  -1.00000E-02    3.30098E-01    1.00000E-02    0.00000E+00
     2  -1.00000E-01    1.43844E-02    1.50000E-01    0.00000E+00
     3  -1.00000E-02    0.00000E+00    3.00000E-02    9.09967E-02
     4  -4.00000E-02    0.00000E+00    2.00000E-02    7.66124E-02
     5  -1.00000E-01    0.00000E+00    5.00000E-02    0.00000E+00
     6  -1.00000E-02    0.00000E+00         inf       0.00000E+00
     7  -1.00000E-02    0.00000E+00         inf       0.00000E+00
 
 Linear constraints dual variables:
   idx   Lower bound       Value       Upper bound       Value
     1  -1.30000E-01    0.00000E+00   -1.30000E-01    1.43111E+00
     2       -inf       0.00000E+00   -4.90000E-03    0.00000E+00
     3       -inf       0.00000E+00   -6.40000E-03    0.00000E+00
     4       -inf       0.00000E+00   -3.70000E-03    0.00000E+00
     5       -inf       0.00000E+00   -1.20000E-03    0.00000E+00
     6  -9.92000E-02    1.50098E+00         inf       0.00000E+00
     7  -3.00000E-03    1.51661E+00    2.00000E-03    0.00000E+00