1
 
 SNMEMA EXIT 100 -- finished successfully
 SNMEMA INFO 104 -- memory requirements estimated

         ==============================
         S N O P T  7.2-11   (Jan 2011)
         ==============================
1
 
 Parameters
 ==========

 Files
 -----
 Solution file..........         0       Old basis file ........         0       Standard input.........         5
 Insert file............         0       New basis file ........         0       (Printer)..............         9
 Punch file.............         0       Backup basis file......         0       (Specs file)...........         0
 Load file..............         0       Dump file..............         0       Standard output........         6

 Frequencies
 -----------
 Print frequency........       100       Check frequency........        60       Save new basis map.....       100
 Summary frequency......       100       Factorization frequency        50       Expand frequency.......     10000

 QP subproblems
 --------------
 QPsolver Cholesky......
 Scale tolerance........      .900       Minor feasibility tol..  1.00E-06       Iteration limit........       200
 Scale option...........         0       Minor optimality  tol..  1.00E-06       Minor print level......         1
 Crash tolerance........      .100       Pivot tolerance........  3.25E-11       Partial price..........         1
 Crash option...........         3       Elastic weight.........  1.00E+04       Prtl price section ( A)         4
                                         New superbasics........        99       Prtl price section (-I)         5

 The SQP Method
 --------------
 Minimize...............                 Cold start.............                 Proximal Point method..         1
 Nonlinear objectiv vars         4       Objective Row..........         1       Function precision.....  1.00E-05
 Unbounded step size....  1.00E+20       Superbasics limit......         4       Difference interval....  3.16E-03
 Unbounded objective....  1.00E+15       Reduced Hessian dim....         4       Central difference int.  2.15E-02
 Major step limit.......  2.00E+00       Derivative linesearch..                 Derivative option......         1
 Major iterations limit.      1000       Linesearch tolerance...    .90000       Verify level...........         0
 Minor iterations limit.       500       Penalty parameter......  0.00E+00       Major Print Level......         1
                                         Major optimality tol...  1.00E-02

 Hessian Approximation
 ---------------------
 Full-Memory Hessian....                 Hessian updates........  99999999       Hessian frequency......  99999999
                                                                                 Hessian flush..........  99999999

 Nonlinear constraints
 ---------------------
 Nonlinear constraints..         4       Major feasibility tol..  1.00E-06       Violation limit........  1.00E+06
 Nonlinear Jacobian vars         4

 Miscellaneous
 -------------
 LU factor tolerance....      3.99       LU singularity tol.....  3.25E-11       Timing level...........         3
 LU update tolerance....      3.99       LU swap tolerance......  1.22E-04       Debug level............         0
 LU partial  pivoting...                 eps (machine precision)  2.22E-16       System information.....        No
                                                                                 Sticky parameters......        No
1
 

 

 Matrix statistics
 -----------------
               Total      Normal        Free       Fixed     Bounded
 Rows              5           0           1           4           0
 Columns           4           0           0           0           4

 No. of matrix elements                   16     Density      80.000
 Biggest  constant element        0.0000E+00  (excluding fixed columns,
 Smallest constant element        0.0000E+00   free rows, and RHS)

 No. of objective coefficients             0

 Nonlinear constraints       4     Linear constraints       1
 Nonlinear variables         4     Linear variables         0
 Jacobian  variables         4     Objective variables      4
 Total constraints           5     Total variables          4
1
 

 
 The user has defined      20   out of      20   first  derivatives

 Cheap test of user-supplied problem derivatives...

 The constraint gradients seem to be OK.

 -->  The largest discrepancy was    0.00E+00  in constraint     6
 

 The objective  gradients seem to be OK.

 Gradient projected in one direction   0.00000000000E+00
 Difference approximation              0.00000000000E+00
1
 
 

   Itns Major Minors    Step   nCon Feasible  Optimal  MeritFunction     L+U BSwap     nS  condHz Penalty
      0     0      0              1 (0.0E+00)(0.0E+00) 0.0000000E+00       5                              _  r
1
 
 SNOPTA EXIT   0 -- finished successfully
 SNOPTA INFO   1 -- optimality conditions satisfied

 Problem name                 Default
 No. of iterations                   0   Objective value      0.0000000000E+00
 No. of major iterations             0   Linear objective     0.0000000000E+00
 Penalty parameter           0.000E+00   Nonlinear objective  0.0000000000E+00
 No. of calls to funobj              2   No. of calls to funcon              2
 No. of degenerate steps             0   Percentage                        .00
 Max x                       2 6.2E+01   Max pi                      5 1.0E+00
 Max Primal infeas           0 0.0E+00   Max Dual infeas             0 0.0E+00
 Nonlinear constraint violn    0.0E+00
1
 
 Name           Default                  Objective Value      0.0000000000E+00

 Status         Optimal Soln             Iteration      0    Superbasics     0

 Objective               (Min)
 RHS
 Ranges
 Bounds

 Section 1 - Rows

  Number  ...Row.. State  ...Activity...  Slack Activity  ..Lower Limit.  ..Upper Limit.  .Dual Activity    ..i
 
       5  r      1    BS          .               .                None            None         -1.0          1
       6  r      2 D  BS          .               .               .               .               .           2
       7  r      3 D  BS          .               .               .               .               .           3
       8  r      4 D  BS          .               .               .               .               .           4
       9  r      5 D  BS          .               .               .               .               .           5
1
 
 Section 2 - Columns

  Number  .Column. State  ...Activity...  .Obj Gradient.  ..Lower Limit.  ..Upper Limit.  Reduced Gradnt    m+j
 
       1  x      1 A  FR          .18000          .               .07700          .24000          .           6
       2  x      2 A  FR        62.00000          .             20.00000        63.00000          .           7
       3  x      3 A  FR          .47000          .               .22000          .67000          .           8
       4  x      4 A  FR        52.00000          .             30.00000        90.00000          .           9
 
 Time for MPS input                              .00 seconds
 Time for solving problem                        .00 seconds
 Time for solution output                        .00 seconds
 Time for constraint functions                   .00 seconds
 Time for objective function                     .00 seconds
1
 
 SNMEMA EXIT 100 -- finished successfully
 SNMEMA INFO 104 -- memory requirements estimated

         ==============================
         S N O P T  7.2-11   (Jan 2011)
         ==============================
1
 
 Parameters
 ==========

 Files
 -----
 Solution file..........         0       Old basis file ........         0       Standard input.........         5
 Insert file............         0       New basis file ........         0       (Printer)..............         9
 Punch file.............         0       Backup basis file......         0       (Specs file)...........         0
 Load file..............         0       Dump file..............         0       Standard output........         6

 Frequencies
 -----------
 Print frequency........       100       Check frequency........        60       Save new basis map.....       100
 Summary frequency......       100       Factorization frequency        50       Expand frequency.......     10000

 QP subproblems
 --------------
 QPsolver Cholesky......
 Scale tolerance........      .900       Minor feasibility tol..  1.00E-06       Iteration limit........       200
 Scale option...........         0       Minor optimality  tol..  1.00E-06       Minor print level......         1
 Crash tolerance........      .100       Pivot tolerance........  3.25E-11       Partial price..........         1
 Crash option...........         3       Elastic weight.........  1.00E+04       Prtl price section ( A)         4
                                         New superbasics........        99       Prtl price section (-I)         5

 The SQP Method
 --------------
 Minimize...............                 Cold start.............                 Proximal Point method..         1
 Nonlinear objectiv vars         4       Objective Row..........         1       Function precision.....  1.00E-05
 Unbounded step size....  1.00E+20       Superbasics limit......         4       Difference interval....  3.16E-03
 Unbounded objective....  1.00E+15       Reduced Hessian dim....         4       Central difference int.  2.15E-02
 Major step limit.......  2.00E+00       Derivative linesearch..                 Derivative option......         1
 Major iterations limit.      1000       Linesearch tolerance...    .90000       Verify level...........         0
 Minor iterations limit.       500       Penalty parameter......  0.00E+00       Major Print Level......         1
                                         Major optimality tol...  1.00E-02

 Hessian Approximation
 ---------------------
 Full-Memory Hessian....                 Hessian updates........  99999999       Hessian frequency......  99999999
                                                                                 Hessian flush..........  99999999

 Nonlinear constraints
 ---------------------
 Nonlinear constraints..         4       Major feasibility tol..  1.00E-06       Violation limit........  1.00E+06
 Nonlinear Jacobian vars         4

 Miscellaneous
 -------------
 LU factor tolerance....      3.99       LU singularity tol.....  3.25E-11       Timing level...........         3
 LU update tolerance....      3.99       LU swap tolerance......  1.22E-04       Debug level............         0
 LU partial  pivoting...                 eps (machine precision)  2.22E-16       System information.....        No
                                                                                 Sticky parameters......        No
1
 

 

 Matrix statistics
 -----------------
               Total      Normal        Free       Fixed     Bounded
 Rows              5           0           1           4           0
 Columns           4           0           0           0           4

 No. of matrix elements                   16     Density      80.000
 Biggest  constant element        0.0000E+00  (excluding fixed columns,
 Smallest constant element        0.0000E+00   free rows, and RHS)

 No. of objective coefficients             0

 Nonlinear constraints       4     Linear constraints       1
 Nonlinear variables         4     Linear variables         0
 Jacobian  variables         4     Objective variables      4
 Total constraints           5     Total variables          4
1
 

 
 The user has defined      20   out of      20   first  derivatives

 Cheap test of user-supplied problem derivatives...

 The constraint gradients seem to be OK.

 -->  The largest discrepancy was    0.00E+00  in constraint     6
 

 The objective  gradients seem to be OK.

 Gradient projected in one direction   0.00000000000E+00
 Difference approximation              0.00000000000E+00
1
 
 

   Itns Major Minors    Step   nCon Feasible  Optimal  MeritFunction     L+U BSwap     nS  condHz Penalty
      0     0      0              1 (0.0E+00)(0.0E+00) 0.0000000E+00       5                              _  r
1
 
 SNOPTA EXIT   0 -- finished successfully
 SNOPTA INFO   1 -- optimality conditions satisfied

 Problem name                 Default
 No. of iterations                   0   Objective value      0.0000000000E+00
 No. of major iterations             0   Linear objective     0.0000000000E+00
 Penalty parameter           0.000E+00   Nonlinear objective  0.0000000000E+00
 No. of calls to funobj              2   No. of calls to funcon              2
 No. of degenerate steps             0   Percentage                        .00
 Max x                       2 6.2E+01   Max pi                      5 1.0E+00
 Max Primal infeas           0 0.0E+00   Max Dual infeas             0 0.0E+00
 Nonlinear constraint violn    0.0E+00
1
 
 Name           Default                  Objective Value      0.0000000000E+00

 Status         Optimal Soln             Iteration      0    Superbasics     0

 Objective               (Min)
 RHS
 Ranges
 Bounds

 Section 1 - Rows

  Number  ...Row.. State  ...Activity...  Slack Activity  ..Lower Limit.  ..Upper Limit.  .Dual Activity    ..i
 
       5  r      1    BS          .               .                None            None         -1.0          1
       6  r      2 D  BS          .               .               .               .               .           2
       7  r      3 D  BS          .               .               .               .               .           3
       8  r      4 D  BS          .               .               .               .               .           4
       9  r      5 D  BS          .               .               .               .               .           5
1
 
 Section 2 - Columns

  Number  .Column. State  ...Activity...  .Obj Gradient.  ..Lower Limit.  ..Upper Limit.  Reduced Gradnt    m+j
 
       1  x      1 A  FR          .18000          .               .07700          .24000          .           6
       2  x      2 A  FR        62.00000          .             20.00000        63.00000          .           7
       3  x      3 A  FR          .47000          .               .22000          .67000          .           8
       4  x      4 A  FR        52.00000          .             30.00000        90.00000          .           9
 
 Time for MPS input                              .00 seconds
 Time for solving problem                        .00 seconds
 Time for solution output                        .00 seconds
 Time for constraint functions                   .00 seconds
 Time for objective function                     .00 seconds
1
 
 SNMEMA EXIT 100 -- finished successfully
 SNMEMA INFO 104 -- memory requirements estimated

         ==============================
         S N O P T  7.2-11   (Jan 2011)
         ==============================
1
 
 Parameters
 ==========

 Files
 -----
 Solution file..........         0       Old basis file ........         0       Standard input.........         5
 Insert file............         0       New basis file ........         0       (Printer)..............         9
 Punch file.............         0       Backup basis file......         0       (Specs file)...........         0
 Load file..............         0       Dump file..............         0       Standard output........         6

 Frequencies
 -----------
 Print frequency........       100       Check frequency........        60       Save new basis map.....       100
 Summary frequency......       100       Factorization frequency        50       Expand frequency.......     10000

 QP subproblems
 --------------
 QPsolver Cholesky......
 Scale tolerance........      .900       Minor feasibility tol..  1.00E-06       Iteration limit........       200
 Scale option...........         0       Minor optimality  tol..  1.00E-06       Minor print level......         1
 Crash tolerance........      .100       Pivot tolerance........  3.25E-11       Partial price..........         1
 Crash option...........         3       Elastic weight.........  1.00E+04       Prtl price section ( A)         4
                                         New superbasics........        99       Prtl price section (-I)         5

 The SQP Method
 --------------
 Minimize...............                 Cold start.............                 Proximal Point method..         1
 Nonlinear objectiv vars         4       Objective Row..........         1       Function precision.....  1.00E-05
 Unbounded step size....  1.00E+20       Superbasics limit......         4       Difference interval....  3.16E-03
 Unbounded objective....  1.00E+15       Reduced Hessian dim....         4       Central difference int.  2.15E-02
 Major step limit.......  2.00E+00       Derivative linesearch..                 Derivative option......         1
 Major iterations limit.      1000       Linesearch tolerance...    .90000       Verify level...........         0
 Minor iterations limit.       500       Penalty parameter......  0.00E+00       Major Print Level......         1
                                         Major optimality tol...  1.00E-02

 Hessian Approximation
 ---------------------
 Full-Memory Hessian....                 Hessian updates........  99999999       Hessian frequency......  99999999
                                                                                 Hessian flush..........  99999999

 Nonlinear constraints
 ---------------------
 Nonlinear constraints..         4       Major feasibility tol..  1.00E-06       Violation limit........  1.00E+06
 Nonlinear Jacobian vars         4

 Miscellaneous
 -------------
 LU factor tolerance....      3.99       LU singularity tol.....  3.25E-11       Timing level...........         3
 LU update tolerance....      3.99       LU swap tolerance......  1.22E-04       Debug level............         0
 LU partial  pivoting...                 eps (machine precision)  2.22E-16       System information.....        No
                                                                                 Sticky parameters......        No
1
 

 

 Matrix statistics
 -----------------
               Total      Normal        Free       Fixed     Bounded
 Rows              5           0           1           4           0
 Columns           4           0           0           0           4

 No. of matrix elements                   16     Density      80.000
 Biggest  constant element        0.0000E+00  (excluding fixed columns,
 Smallest constant element        0.0000E+00   free rows, and RHS)

 No. of objective coefficients             0

 Nonlinear constraints       4     Linear constraints       1
 Nonlinear variables         4     Linear variables         0
 Jacobian  variables         4     Objective variables      4
 Total constraints           5     Total variables          4
1
 

 
 The user has defined      20   out of      20   first  derivatives

 Cheap test of user-supplied problem derivatives...

 The constraint gradients seem to be OK.

 -->  The largest discrepancy was    0.00E+00  in constraint     6
 

 The objective  gradients seem to be OK.

 Gradient projected in one direction   0.00000000000E+00
 Difference approximation              0.00000000000E+00
1
 
 

   Itns Major Minors    Step   nCon Feasible  Optimal  MeritFunction     L+U BSwap     nS  condHz Penalty
      0     0      0              1 (0.0E+00)(0.0E+00) 0.0000000E+00       5                              _  r
1
 
 SNOPTA EXIT   0 -- finished successfully
 SNOPTA INFO   1 -- optimality conditions satisfied

 Problem name                 Default
 No. of iterations                   0   Objective value      0.0000000000E+00
 No. of major iterations             0   Linear objective     0.0000000000E+00
 Penalty parameter           0.000E+00   Nonlinear objective  0.0000000000E+00
 No. of calls to funobj              2   No. of calls to funcon              2
 No. of degenerate steps             0   Percentage                        .00
 Max x                       2 6.2E+01   Max pi                      5 1.0E+00
 Max Primal infeas           0 0.0E+00   Max Dual infeas             0 0.0E+00
 Nonlinear constraint violn    0.0E+00
1
 
 Name           Default                  Objective Value      0.0000000000E+00

 Status         Optimal Soln             Iteration      0    Superbasics     0

 Objective               (Min)
 RHS
 Ranges
 Bounds

 Section 1 - Rows

  Number  ...Row.. State  ...Activity...  Slack Activity  ..Lower Limit.  ..Upper Limit.  .Dual Activity    ..i
 
       5  r      1    BS          .               .                None            None         -1.0          1
       6  r      2 D  BS          .               .               .               .               .           2
       7  r      3 D  BS          .               .               .               .               .           3
       8  r      4 D  BS          .               .               .               .               .           4
       9  r      5 D  BS          .               .               .               .               .           5
1
 
 Section 2 - Columns

  Number  .Column. State  ...Activity...  .Obj Gradient.  ..Lower Limit.  ..Upper Limit.  Reduced Gradnt    m+j
 
       1  x      1 A  FR          .18000          .               .07700          .24000          .           6
       2  x      2 A  FR        62.00000          .             20.00000        63.00000          .           7
       3  x      3 A  FR          .47000          .               .22000          .67000          .           8
       4  x      4 A  FR        52.00000          .             30.00000        90.00000          .           9
 
 Time for MPS input                              .00 seconds
 Time for solving problem                        .00 seconds
 Time for solution output                        .00 seconds
 Time for constraint functions                   .00 seconds
 Time for objective function                     .00 seconds
1
 
 SNMEMA EXIT 100 -- finished successfully
 SNMEMA INFO 104 -- memory requirements estimated

         ==============================
         S N O P T  7.2-11   (Jan 2011)
         ==============================
1
 
 Parameters
 ==========

 Files
 -----
 Solution file..........         0       Old basis file ........         0       Standard input.........         5
 Insert file............         0       New basis file ........         0       (Printer)..............         9
 Punch file.............         0       Backup basis file......         0       (Specs file)...........         0
 Load file..............         0       Dump file..............         0       Standard output........         6

 Frequencies
 -----------
 Print frequency........       100       Check frequency........        60       Save new basis map.....       100
 Summary frequency......       100       Factorization frequency        50       Expand frequency.......     10000

 QP subproblems
 --------------
 QPsolver Cholesky......
 Scale tolerance........      .900       Minor feasibility tol..  1.00E-06       Iteration limit........       200
 Scale option...........         0       Minor optimality  tol..  1.00E-06       Minor print level......         1
 Crash tolerance........      .100       Pivot tolerance........  3.25E-11       Partial price..........         1
 Crash option...........         3       Elastic weight.........  1.00E+04       Prtl price section ( A)         4
                                         New superbasics........        99       Prtl price section (-I)         5

 The SQP Method
 --------------
 Minimize...............                 Cold start.............                 Proximal Point method..         1
 Nonlinear objectiv vars         4       Objective Row..........         1       Function precision.....  1.00E-05
 Unbounded step size....  1.00E+20       Superbasics limit......         4       Difference interval....  3.16E-03
 Unbounded objective....  1.00E+15       Reduced Hessian dim....         4       Central difference int.  2.15E-02
 Major step limit.......  2.00E+00       Derivative linesearch..                 Derivative option......         1
 Major iterations limit.      1000       Linesearch tolerance...    .90000       Verify level...........         0
 Minor iterations limit.       500       Penalty parameter......  0.00E+00       Major Print Level......         1
                                         Major optimality tol...  1.00E-02

 Hessian Approximation
 ---------------------
 Full-Memory Hessian....                 Hessian updates........  99999999       Hessian frequency......  99999999
                                                                                 Hessian flush..........  99999999

 Nonlinear constraints
 ---------------------
 Nonlinear constraints..         4       Major feasibility tol..  1.00E-06       Violation limit........  1.00E+06
 Nonlinear Jacobian vars         4

 Miscellaneous
 -------------
 LU factor tolerance....      3.99       LU singularity tol.....  3.25E-11       Timing level...........         0
 LU update tolerance....      3.99       LU swap tolerance......  1.22E-04       Debug level............         0
 LU partial  pivoting...                 eps (machine precision)  2.22E-16       System information.....        No
                                                                                 Sticky parameters......        No
1
 

 

 Matrix statistics
 -----------------
               Total      Normal        Free       Fixed     Bounded
 Rows              5           0           1           4           0
 Columns           4           0           0           0           4

 No. of matrix elements                   16     Density      80.000
 Biggest  constant element        0.0000E+00  (excluding fixed columns,
 Smallest constant element        0.0000E+00   free rows, and RHS)

 No. of objective coefficients             0

 Nonlinear constraints       4     Linear constraints       1
 Nonlinear variables         4     Linear variables         0
 Jacobian  variables         4     Objective variables      4
 Total constraints           5     Total variables          4
1
 

 
 The user has defined      20   out of      20   first  derivatives

 Cheap test of user-supplied problem derivatives...

 The constraint gradients seem to be OK.

 -->  The largest discrepancy was    0.00E+00  in constraint     6
 

 The objective  gradients seem to be OK.

 Gradient projected in one direction   0.00000000000E+00
 Difference approximation              0.00000000000E+00
1
 
 

   Itns Major Minors    Step   nCon Feasible  Optimal  MeritFunction     L+U BSwap     nS  condHz Penalty
      0     0      0              1 (0.0E+00)(0.0E+00) 0.0000000E+00       5                              _  r
1
 
 SNOPTA EXIT   0 -- finished successfully
 SNOPTA INFO   1 -- optimality conditions satisfied

 Problem name                 Default
 No. of iterations                   0   Objective value      0.0000000000E+00
 No. of major iterations             0   Linear objective     0.0000000000E+00
 Penalty parameter           0.000E+00   Nonlinear objective  0.0000000000E+00
 No. of calls to funobj              2   No. of calls to funcon              2
 No. of degenerate steps             0   Percentage                        .00
 Max x                       2 6.2E+01   Max pi                      5 1.0E+00
 Max Primal infeas           0 0.0E+00   Max Dual infeas             0 0.0E+00
 Nonlinear constraint violn    0.0E+00
1
 
 Name           Default                  Objective Value      0.0000000000E+00

 Status         Optimal Soln             Iteration      0    Superbasics     0

 Objective               (Min)
 RHS
 Ranges
 Bounds

 Section 1 - Rows

  Number  ...Row.. State  ...Activity...  Slack Activity  ..Lower Limit.  ..Upper Limit.  .Dual Activity    ..i
 
       5  r      1    BS          .               .                None            None         -1.0          1
       6  r      2 D  BS          .               .               .               .               .           2
       7  r      3 D  BS          .               .               .               .               .           3
       8  r      4 D  BS          .               .               .               .               .           4
       9  r      5 D  BS          .               .               .               .               .           5
1
 
 Section 2 - Columns

  Number  .Column. State  ...Activity...  .Obj Gradient.  ..Lower Limit.  ..Upper Limit.  Reduced Gradnt    m+j
 
       1  x      1 A  FR          .18000          .               .07700          .24000          .           6
       2  x      2 A  FR        62.00000          .             20.00000        63.00000          .           7
       3  x      3 A  FR          .47000          .               .22000          .67000          .           8
       4  x      4 A  FR        52.00000          .             30.00000        90.00000          .           9
1
 
 SNMEMA EXIT 100 -- finished successfully
 SNMEMA INFO 104 -- memory requirements estimated

         ==============================
         S N O P T  7.2-11   (Jan 2011)
         ==============================
1
 
 Parameters
 ==========

 Files
 -----
 Solution file..........         0       Old basis file ........         0       Standard input.........         5
 Insert file............         0       New basis file ........         0       (Printer)..............         9
 Punch file.............         0       Backup basis file......         0       (Specs file)...........         0
 Load file..............         0       Dump file..............         0       Standard output........         6

 Frequencies
 -----------
 Print frequency........       100       Check frequency........        60       Save new basis map.....       100
 Summary frequency......       100       Factorization frequency        50       Expand frequency.......     10000

 QP subproblems
 --------------
 QPsolver Cholesky......
 Scale tolerance........      .900       Minor feasibility tol..  1.00E-06       Iteration limit........       200
 Scale option...........         0       Minor optimality  tol..  1.00E-06       Minor print level......         1
 Crash tolerance........      .100       Pivot tolerance........  3.25E-11       Partial price..........         1
 Crash option...........         3       Elastic weight.........  1.00E+04       Prtl price section ( A)         4
                                         New superbasics........        99       Prtl price section (-I)         5

 The SQP Method
 --------------
 Minimize...............                 Cold start.............                 Proximal Point method..         1
 Nonlinear objectiv vars         4       Objective Row..........         1       Function precision.....  1.00E-05
 Unbounded step size....  1.00E+20       Superbasics limit......         4       Difference interval....  3.16E-03
 Unbounded objective....  1.00E+15       Reduced Hessian dim....         4       Central difference int.  2.15E-02
 Major step limit.......  2.00E+00       Derivative linesearch..                 Derivative option......         1
 Major iterations limit.      1000       Linesearch tolerance...    .90000       Verify level...........         0
 Minor iterations limit.       500       Penalty parameter......  0.00E+00       Major Print Level......         1
                                         Major optimality tol...  1.00E-02

 Hessian Approximation
 ---------------------
 Full-Memory Hessian....                 Hessian updates........  99999999       Hessian frequency......  99999999
                                                                                 Hessian flush..........  99999999

 Nonlinear constraints
 ---------------------
 Nonlinear constraints..         4       Major feasibility tol..  1.00E-06       Violation limit........  1.00E+06
 Nonlinear Jacobian vars         4

 Miscellaneous
 -------------
 LU factor tolerance....      3.99       LU singularity tol.....  3.25E-11       Timing level...........         3
 LU update tolerance....      3.99       LU swap tolerance......  1.22E-04       Debug level............         0
 LU partial  pivoting...                 eps (machine precision)  2.22E-16       System information.....        No
                                                                                 Sticky parameters......        No
1
 

 

 Matrix statistics
 -----------------
               Total      Normal        Free       Fixed     Bounded
 Rows              5           0           1           4           0
 Columns           4           0           0           0           4

 No. of matrix elements                   16     Density      80.000
 Biggest  constant element        0.0000E+00  (excluding fixed columns,
 Smallest constant element        0.0000E+00   free rows, and RHS)

 No. of objective coefficients             0

 Nonlinear constraints       4     Linear constraints       1
 Nonlinear variables         4     Linear variables         0
 Jacobian  variables         4     Objective variables      4
 Total constraints           5     Total variables          4
1
 

 
 The user has defined      20   out of      20   first  derivatives

 Cheap test of user-supplied problem derivatives...

 The constraint gradients seem to be OK.

 -->  The largest discrepancy was    0.00E+00  in constraint     6
 

 The objective  gradients seem to be OK.

 Gradient projected in one direction   0.00000000000E+00
 Difference approximation              0.00000000000E+00
1
 
 

   Itns Major Minors    Step   nCon Feasible  Optimal  MeritFunction     L+U BSwap     nS  condHz Penalty
      0     0      0              1 (0.0E+00)(0.0E+00) 0.0000000E+00       5                              _  r
1
 
 SNOPTA EXIT   0 -- finished successfully
 SNOPTA INFO   1 -- optimality conditions satisfied

 Problem name                 Default
 No. of iterations                   0   Objective value      0.0000000000E+00
 No. of major iterations             0   Linear objective     0.0000000000E+00
 Penalty parameter           0.000E+00   Nonlinear objective  0.0000000000E+00
 No. of calls to funobj              2   No. of calls to funcon              2
 No. of degenerate steps             0   Percentage                        .00
 Max x                       2 6.2E+01   Max pi                      5 1.0E+00
 Max Primal infeas           0 0.0E+00   Max Dual infeas             0 0.0E+00
 Nonlinear constraint violn    0.0E+00
1
 
 Name           Default                  Objective Value      0.0000000000E+00

 Status         Optimal Soln             Iteration      0    Superbasics     0

 Objective               (Min)
 RHS
 Ranges
 Bounds

 Section 1 - Rows

  Number  ...Row.. State  ...Activity...  Slack Activity  ..Lower Limit.  ..Upper Limit.  .Dual Activity    ..i
 
       5  r      1    BS          .               .                None            None         -1.0          1
       6  r      2 D  BS          .               .               .               .               .           2
       7  r      3 D  BS          .               .               .               .               .           3
       8  r      4 D  BS          .               .               .               .               .           4
       9  r      5 D  BS          .               .               .               .               .           5
1
 
 Section 2 - Columns

  Number  .Column. State  ...Activity...  .Obj Gradient.  ..Lower Limit.  ..Upper Limit.  Reduced Gradnt    m+j
 
       1  x      1 A  FR          .18000          .               .07700          .24000          .           6
       2  x      2 A  FR        62.00000          .             20.00000        63.00000          .           7
       3  x      3 A  FR          .47000          .               .22000          .67000          .           8
       4  x      4 A  FR        52.00000          .             30.00000        90.00000          .           9
 
 Time for MPS input                              .00 seconds
 Time for solving problem                        .00 seconds
 Time for solution output                        .00 seconds
 Time for constraint functions         ************* seconds
 Time for objective function                     .00 seconds
1
 
 SNMEMA EXIT 100 -- finished successfully
 SNMEMA INFO 104 -- memory requirements estimated

         ==============================
         S N O P T  7.2-11   (Jan 2011)
         ==============================
1
 
 Parameters
 ==========

 Files
 -----
 Solution file..........         0       Old basis file ........         0       Standard input.........         5
 Insert file............         0       New basis file ........         0       (Printer)..............         9
 Punch file.............         0       Backup basis file......         0       (Specs file)...........         0
 Load file..............         0       Dump file..............         0       Standard output........         6

 Frequencies
 -----------
 Print frequency........       100       Check frequency........        60       Save new basis map.....       100
 Summary frequency......       100       Factorization frequency        50       Expand frequency.......     10000

 QP subproblems
 --------------
 QPsolver Cholesky......
 Scale tolerance........      .900       Minor feasibility tol..  1.00E-06       Iteration limit........       200
 Scale option...........         0       Minor optimality  tol..  1.00E-06       Minor print level......         1
 Crash tolerance........      .100       Pivot tolerance........  3.25E-11       Partial price..........         1
 Crash option...........         3       Elastic weight.........  1.00E+04       Prtl price section ( A)         4
                                         New superbasics........        99       Prtl price section (-I)         5

 The SQP Method
 --------------
 Minimize...............                 Cold start.............                 Proximal Point method..         1
 Nonlinear objectiv vars         4       Objective Row..........         1       Function precision.....  1.00E-05
 Unbounded step size....  1.00E+20       Superbasics limit......         4       Difference interval....  3.16E-03
 Unbounded objective....  1.00E+15       Reduced Hessian dim....         4       Central difference int.  2.15E-02
 Major step limit.......  2.00E+00       Derivative linesearch..                 Derivative option......         1
 Major iterations limit.      1000       Linesearch tolerance...    .90000       Verify level...........         0
 Minor iterations limit.       500       Penalty parameter......  0.00E+00       Major Print Level......         1
                                         Major optimality tol...  1.00E-02

 Hessian Approximation
 ---------------------
 Full-Memory Hessian....                 Hessian updates........  99999999       Hessian frequency......  99999999
                                                                                 Hessian flush..........  99999999

 Nonlinear constraints
 ---------------------
 Nonlinear constraints..         4       Major feasibility tol..  1.00E-06       Violation limit........  1.00E+06
 Nonlinear Jacobian vars         4

 Miscellaneous
 -------------
 LU factor tolerance....      3.99       LU singularity tol.....  3.25E-11       Timing level...........         3
 LU update tolerance....      3.99       LU swap tolerance......  1.22E-04       Debug level............         0
 LU partial  pivoting...                 eps (machine precision)  2.22E-16       System information.....        No
                                                                                 Sticky parameters......        No
1
 

 

 Matrix statistics
 -----------------
               Total      Normal        Free       Fixed     Bounded
 Rows              5           0           1           4           0
 Columns           4           0           0           0           4

 No. of matrix elements                   16     Density      80.000
 Biggest  constant element        0.0000E+00  (excluding fixed columns,
 Smallest constant element        0.0000E+00   free rows, and RHS)

 No. of objective coefficients             0

 Nonlinear constraints       4     Linear constraints       1
 Nonlinear variables         4     Linear variables         0
 Jacobian  variables         4     Objective variables      4
 Total constraints           5     Total variables          4
1
 

 
 The user has defined      20   out of      20   first  derivatives

 Cheap test of user-supplied problem derivatives...

 The constraint gradients seem to be OK.

 -->  The largest discrepancy was    0.00E+00  in constraint     6
 

 The objective  gradients seem to be OK.

 Gradient projected in one direction   0.00000000000E+00
 Difference approximation              0.00000000000E+00
1
 
 

   Itns Major Minors    Step   nCon Feasible  Optimal  MeritFunction     L+U BSwap     nS  condHz Penalty
      0     0      0              1 (0.0E+00)(0.0E+00) 0.0000000E+00       5                              _  r
1
 
 SNOPTA EXIT   0 -- finished successfully
 SNOPTA INFO   1 -- optimality conditions satisfied

 Problem name                 Default
 No. of iterations                   0   Objective value      0.0000000000E+00
 No. of major iterations             0   Linear objective     0.0000000000E+00
 Penalty parameter           0.000E+00   Nonlinear objective  0.0000000000E+00
 No. of calls to funobj              2   No. of calls to funcon              2
 No. of degenerate steps             0   Percentage                        .00
 Max x                       2 6.2E+01   Max pi                      5 1.0E+00
 Max Primal infeas           0 0.0E+00   Max Dual infeas             0 0.0E+00
 Nonlinear constraint violn    0.0E+00
1
 
 Name           Default                  Objective Value      0.0000000000E+00

 Status         Optimal Soln             Iteration      0    Superbasics     0

 Objective               (Min)
 RHS
 Ranges
 Bounds

 Section 1 - Rows

  Number  ...Row.. State  ...Activity...  Slack Activity  ..Lower Limit.  ..Upper Limit.  .Dual Activity    ..i
 
       5  r      1    BS          .               .                None            None         -1.0          1
       6  r      2 D  BS          .               .               .               .               .           2
       7  r      3 D  BS          .               .               .               .               .           3
       8  r      4 D  BS          .               .               .               .               .           4
       9  r      5 D  BS          .               .               .               .               .           5
1
 
 Section 2 - Columns

  Number  .Column. State  ...Activity...  .Obj Gradient.  ..Lower Limit.  ..Upper Limit.  Reduced Gradnt    m+j
 
       1  x      1 A  FR          .18000          .               .07700          .24000          .           6
       2  x      2 A  FR        62.00000          .             20.00000        63.00000          .           7
       3  x      3 A  FR          .47000          .               .22000          .67000          .           8
       4  x      4 A  FR        52.00000          .             30.00000        90.00000          .           9
 
 Time for MPS input                              .00 seconds
 Time for solving problem                        .00 seconds
 Time for solution output                        .00 seconds
 Time for constraint functions         ************* seconds
 Time for objective function                     .00 seconds
1
 
 SNMEMA EXIT 100 -- finished successfully
 SNMEMA INFO 104 -- memory requirements estimated

         ==============================
         S N O P T  7.2-11   (Jan 2011)
         ==============================

 Nonzero derivs  Jij         0
 Non-constant    Jij's       0     Constant Jij's           0
1
 
 SNJAC  EXIT 100 -- finished successfully
 SNJAC  INFO 102 -- Jacobian structure estimated

 
 ===>  WARNING - Column      1 of the Jacobian is empty.
 ===>  WARNING - Column      2 of the Jacobian is empty.
 ===>  WARNING - Column      3 of the Jacobian is empty.
 ===>  WARNING - Column      4 of the Jacobian is empty.
 ===>  WARNING - Row         2 of the Jacobian is empty.
 ===>  WARNING - Row         3 of the Jacobian is empty.
 ===>  WARNING - Row         4 of the Jacobian is empty.
 ===>  WARNING - Row         5 of the Jacobian is empty.
1
 
 Parameters
 ==========

 Files
 -----
 Solution file..........         0       Old basis file ........         0       Standard input.........         5
 Insert file............         0       New basis file ........         0       (Printer)..............         9
 Punch file.............         0       Backup basis file......         0       (Specs file)...........         0
 Load file..............         0       Dump file..............         0       Standard output........         6

 Frequencies
 -----------
 Print frequency........       100       Check frequency........        60       Save new basis map.....       100
 Summary frequency......       100       Factorization frequency       100       Expand frequency.......     10000

 QP subproblems
 --------------
 QPsolver Cholesky......
 Scale tolerance........      .900       Minor feasibility tol..  1.00E-06       Iteration limit........       200
 Scale option...........         2       Minor optimality  tol..  1.00E-06       Minor print level......         1
 Crash tolerance........      .100       Pivot tolerance........  3.25E-11       Partial price..........         1
 Crash option...........         3       Elastic weight.........  1.00E+00       Prtl price section ( A)         4
                                         New superbasics........        99       Prtl price section (-I)         5

 The SQP Method
 --------------
 Minimize...............                 Cold start.............                 Proximal Point method..         1
 Nonlinear objectiv vars         0       Objective Row..........         1       Function precision.....  1.00E-05
 Unbounded step size....  1.00E+20       Superbasics limit......         1       Difference interval....  3.16E-03
 Unbounded objective....  1.00E+15       Reduced Hessian dim....         1       Central difference int.  2.15E-02
 Major step limit.......  2.00E+00       Nonderiv.  linesearch..                 Derivative option......         0
 Major iterations limit.      1000       Linesearch tolerance...    .90000       Verify level...........         0
 Minor iterations limit.       500       Penalty parameter......  0.00E+00       Major Print Level......         1
                                         Major optimality tol...  1.00E-02

 Miscellaneous
 -------------
 LU factor tolerance....    100.00       LU singularity tol.....  3.25E-11       Timing level...........         3
 LU update tolerance....     10.00       LU swap tolerance......  1.22E-04       Debug level............         0
 LU partial  pivoting...                 eps (machine precision)  2.22E-16       System information.....        No
                                                                                 Sticky parameters......        No

 

 Matrix statistics
 -----------------
               Total      Normal        Free       Fixed     Bounded
 Rows              5           0           1           4           0
 Columns           4           0           0           0           4

 No. of matrix elements                    1     Density       5.000
 Biggest                          0.0000E+00  (excluding fixed columns,
 Smallest                         0.0000E+00   free rows, and RHS)

 No. of objective coefficients             0

 Nonlinear constraints       0     Linear constraints       5
 Nonlinear variables         0     Linear variables         4
 Jacobian  variables         0     Objective variables      0
 Total constraints           5     Total variables          4
1
 

 Itn      0: Feasible linear constraints
1
 
 SNOPTA EXIT   0 -- finished successfully
 SNOPTA INFO   1 -- optimality conditions satisfied

 Problem name                 Default
 No. of iterations                   4   Objective value      0.0000000000E+00
 No. of degenerate steps             0   Percentage                        .00
 Max x       (scaled)        4 3.0E+01   Max pi      (scaled)        1 1.0E+00
 Max x                       4 3.0E+01   Max pi                      1 1.0E+00
 Max Prim inf(scaled)        0 0.0E+00   Max Dual inf(scaled)        0 0.0E+00
 Max Primal infeas           0 0.0E+00   Max Dual infeas             0 0.0E+00
1
 
 Name           Default                  Objective Value      0.0000000000E+00

 Status         Optimal Soln             Iteration      4    Superbasics     0

 Objective               (Min)
 RHS
 Ranges
 Bounds

 Section 1 - Rows

  Number  ...Row.. State  ...Activity...  Slack Activity  ..Lower Limit.  ..Upper Limit.  .Dual Activity    ..i
 
       5  r      1    BS          .               .                None            None         -1.0          1
       6  r      2 D  BS          .               .               .               .               .           2
       7  r      3 D  BS          .               .               .               .               .           3
       8  r      4 D  BS          .               .               .               .               .           4
       9  r      5 D  BS          .               .               .               .               .           5
1
 
 Section 2 - Columns

  Number  .Column. State  ...Activity...  .Obj Gradient.  ..Lower Limit.  ..Upper Limit.  Reduced Gradnt    m+j
 
       1  x      1 A  LL          .07700          .               .07700          .24000          .           6
       2  x      2 A  LL        20.00000          .             20.00000        63.00000          .           7
       3  x      3 A  LL          .22000          .               .22000          .67000          .           8
       4  x      4 A  LL        30.00000          .             30.00000        90.00000          .           9
 
 Time for MPS input                              .00 seconds
 Time for solving problem                        .00 seconds
 Time for solution output                        .00 seconds
 Time for constraint functions                   .00 seconds
 Time for objective function                     .00 seconds
1
 
 SNMEMA EXIT 100 -- finished successfully
 SNMEMA INFO 104 -- memory requirements estimated

         ==============================
         S N O P T  7.2-11   (Jan 2011)
         ==============================
1
 
 Parameters
 ==========

 Files
 -----
 Solution file..........         0       Old basis file ........         0       Standard input.........         5
 Insert file............         0       New basis file ........         0       (Printer)..............         9
 Punch file.............         0       Backup basis file......         0       (Specs file)...........         0
 Load file..............         0       Dump file..............         0       Standard output........         6

 Frequencies
 -----------
 Print frequency........       100       Check frequency........        60       Save new basis map.....       100
 Summary frequency......       100       Factorization frequency        50       Expand frequency.......     10000

 QP subproblems
 --------------
 QPsolver Cholesky......
 Scale tolerance........      .900       Minor feasibility tol..  1.00E-06       Iteration limit........       200
 Scale option...........         0       Minor optimality  tol..  1.00E-06       Minor print level......         1
 Crash tolerance........      .100       Pivot tolerance........  3.25E-11       Partial price..........         1
 Crash option...........         3       Elastic weight.........  1.00E+04       Prtl price section ( A)         4
                                         New superbasics........        99       Prtl price section (-I)         5

 The SQP Method
 --------------
 Minimize...............                 Cold start.............                 Proximal Point method..         1
 Nonlinear objectiv vars         4       Objective Row..........         1       Function precision.....  1.00E-05
 Unbounded step size....  1.00E+20       Superbasics limit......         4       Difference interval....  3.16E-03
 Unbounded objective....  1.00E+15       Reduced Hessian dim....         4       Central difference int.  2.15E-02
 Major step limit.......  2.00E+00       Derivative linesearch..                 Derivative option......         1
 Major iterations limit.      1000       Linesearch tolerance...    .90000       Verify level...........         0
 Minor iterations limit.       500       Penalty parameter......  0.00E+00       Major Print Level......         1
                                         Major optimality tol...  1.00E-02

 Hessian Approximation
 ---------------------
 Full-Memory Hessian....                 Hessian updates........  99999999       Hessian frequency......  99999999
                                                                                 Hessian flush..........  99999999

 Nonlinear constraints
 ---------------------
 Nonlinear constraints..         4       Major feasibility tol..  1.00E-06       Violation limit........  1.00E+06
 Nonlinear Jacobian vars         4

 Miscellaneous
 -------------
 LU factor tolerance....      3.99       LU singularity tol.....  3.25E-11       Timing level...........         3
 LU update tolerance....      3.99       LU swap tolerance......  1.22E-04       Debug level............         0
 LU partial  pivoting...                 eps (machine precision)  2.22E-16       System information.....        No
                                                                                 Sticky parameters......        No
1
 

 

 Matrix statistics
 -----------------
               Total      Normal        Free       Fixed     Bounded
 Rows              5           0           1           4           0
 Columns           4           0           0           0           4

 No. of matrix elements                   16     Density      80.000
 Biggest  constant element        0.0000E+00  (excluding fixed columns,
 Smallest constant element        0.0000E+00   free rows, and RHS)

 No. of objective coefficients             0

 Nonlinear constraints       4     Linear constraints       1
 Nonlinear variables         4     Linear variables         0
 Jacobian  variables         4     Objective variables      4
 Total constraints           5     Total variables          4
1
 

 
 The user has defined      20   out of      20   first  derivatives

 Cheap test of user-supplied problem derivatives...

 The constraint gradients seem to be OK.

 -->  The largest discrepancy was    2.02E-03  in constraint     8
 

 The objective  gradients seem to be OK.

 Gradient projected in one direction   0.00000000000E+00
 Difference approximation              0.00000000000E+00
1
 
 

   Itns Major Minors    Step   nCon Feasible  Optimal  MeritFunction     L+U BSwap     nS  condHz Penalty
      1     0      1              1  3.2E-02 (8.3E-04) 0.0000000E+00       5            1 1.0E+00         _  r
      1     1      0 1.0E+00      2 (0.0E+00)(0.0E+00) 0.0000000E+00       5            1 1.0E+00 1.1E-04 _n r
1
 
 SNOPTA EXIT   0 -- finished successfully
 SNOPTA INFO   1 -- optimality conditions satisfied

 Problem name                 Default
 No. of iterations                   1   Objective value      0.0000000000E+00
 No. of major iterations             1   Linear objective     0.0000000000E+00
 Penalty parameter           1.108E-04   Nonlinear objective  0.0000000000E+00
 No. of calls to funobj              3   No. of calls to funcon              3
 No. of superbasics                  1   No. of basic nonlinears             0
 No. of degenerate steps             0   Percentage                        .00
 Max x                       2 6.2E+01   Max pi                      5 1.0E+00
 Max Primal infeas           0 0.0E+00   Max Dual infeas             0 0.0E+00
 Nonlinear constraint violn    0.0E+00
1
 
 Name           Default                  Objective Value      0.0000000000E+00

 Status         Optimal Soln             Iteration      1    Superbasics     1

 Objective               (Min)
 RHS
 Ranges
 Bounds

 Section 1 - Rows

  Number  ...Row.. State  ...Activity...  Slack Activity  ..Lower Limit.  ..Upper Limit.  .Dual Activity    ..i
 
       5  r      1    BS          .               .                None            None         -1.0          1
       6  r      2 D  BS          .               .               .               .               .           2
       7  r      3 D  BS          .               .               .               .               .           3
       8  r      4 D  BS          .               .               .               .               .           4
       9  r      5 D  BS          .               .               .               .               .           5
1
 
 Section 2 - Columns

  Number  .Column. State  ...Activity...  .Obj Gradient.  ..Lower Limit.  ..Upper Limit.  Reduced Gradnt    m+j
 
       1  x      1 A  FR          .16397          .               .07700          .24000          .           6
       2  x      2 A  FR        62.00000          .             20.00000        63.00000          .           7
       3  x      3   SBS          .47011          .               .22000          .67000          .           8
       4  x      4 A  FR        52.00000          .             30.00000        90.00000          .           9
 
 Time for MPS input                              .00 seconds
 Time for solving problem                      -2.00 seconds
 Time for solution output                        .00 seconds
 Time for constraint functions                 -2.00 seconds
 Time for objective function                     .00 seconds
1
 
 SNMEMA EXIT 100 -- finished successfully
 SNMEMA INFO 104 -- memory requirements estimated

         ==============================
         S N O P T  7.2-11   (Jan 2011)
         ==============================
1
 
 Parameters
 ==========

 Files
 -----
 Solution file..........         0       Old basis file ........         0       Standard input.........         5
 Insert file............         0       New basis file ........         0       (Printer)..............         9
 Punch file.............         0       Backup basis file......         0       (Specs file)...........         0
 Load file..............         0       Dump file..............         0       Standard output........         6

 Frequencies
 -----------
 Print frequency........       100       Check frequency........        60       Save new basis map.....       100
 Summary frequency......       100       Factorization frequency        50       Expand frequency.......     10000

 QP subproblems
 --------------
 QPsolver Cholesky......
 Scale tolerance........      .900       Minor feasibility tol..  1.00E-06       Iteration limit........       200
 Scale option...........         0       Minor optimality  tol..  1.00E-06       Minor print level......         1
 Crash tolerance........      .100       Pivot tolerance........  3.25E-11       Partial price..........         1
 Crash option...........         3       Elastic weight.........  1.00E+04       Prtl price section ( A)         4
                                         New superbasics........        99       Prtl price section (-I)         5

 The SQP Method
 --------------
 Minimize...............                 Cold start.............                 Proximal Point method..         1
 Nonlinear objectiv vars         4       Objective Row..........         1       Function precision.....  1.00E-05
 Unbounded step size....  1.00E+20       Superbasics limit......         4       Difference interval....  3.16E-03
 Unbounded objective....  1.00E+15       Reduced Hessian dim....         4       Central difference int.  2.15E-02
 Major step limit.......  2.00E+00       Derivative linesearch..                 Derivative option......         1
 Major iterations limit.      1000       Linesearch tolerance...    .90000       Verify level...........         0
 Minor iterations limit.       500       Penalty parameter......  0.00E+00       Major Print Level......         1
                                         Major optimality tol...  1.00E-02

 Hessian Approximation
 ---------------------
 Full-Memory Hessian....                 Hessian updates........  99999999       Hessian frequency......  99999999
                                                                                 Hessian flush..........  99999999

 Nonlinear constraints
 ---------------------
 Nonlinear constraints..         4       Major feasibility tol..  1.00E-06       Violation limit........  1.00E+06
 Nonlinear Jacobian vars         4

 Miscellaneous
 -------------
 LU factor tolerance....      3.99       LU singularity tol.....  3.25E-11       Timing level...........         0
 LU update tolerance....      3.99       LU swap tolerance......  1.22E-04       Debug level............         0
 LU partial  pivoting...                 eps (machine precision)  2.22E-16       System information.....        No
                                                                                 Sticky parameters......        No
1
 

 

 Matrix statistics
 -----------------
               Total      Normal        Free       Fixed     Bounded
 Rows              5           0           1           4           0
 Columns           4           0           0           0           4

 No. of matrix elements                   16     Density      80.000
 Biggest  constant element        0.0000E+00  (excluding fixed columns,
 Smallest constant element        0.0000E+00   free rows, and RHS)

 No. of objective coefficients             0

 Nonlinear constraints       4     Linear constraints       1
 Nonlinear variables         4     Linear variables         0
 Jacobian  variables         4     Objective variables      4
 Total constraints           5     Total variables          4
1
 

 
 The user has defined      20   out of      20   first  derivatives

 Cheap test of user-supplied problem derivatives...

 XXX  The constraint gradients seem to be incorrect.

 -->  The largest discrepancy was    9.64E-01  in constraint     9
 

 The objective  gradients seem to be OK.

 Gradient projected in one direction   0.00000000000E+00
 Difference approximation              0.00000000000E+00
1
 
 

   Itns Major Minors    Step   nCon Feasible  Optimal  MeritFunction     L+U BSwap     nS  condHz Penalty
      1     0      1              1  5.4E-02 (1.6E-03) 0.0000000E+00       5            1 1.0E+00         _  r
      1     1      0 1.0E+00      2 (0.0E+00)(0.0E+00) 0.0000000E+00       5            1 1.0E+00 1.4E-04 _n r
1
 
 SNOPTA EXIT   0 -- finished successfully
 SNOPTA INFO   1 -- optimality conditions satisfied

 Problem name                 Default
 No. of iterations                   1   Objective value      0.0000000000E+00
 No. of major iterations             1   Linear objective     0.0000000000E+00
 Penalty parameter           1.371E-04   Nonlinear objective  0.0000000000E+00
 No. of calls to funobj              3   No. of calls to funcon              3
 No. of superbasics                  1   No. of basic nonlinears             0
 No. of degenerate steps             0   Percentage                        .00
 Max x                       2 6.3E+01   Max pi                      5 1.0E+00
 Max Primal infeas           0 0.0E+00   Max Dual infeas             0 0.0E+00
 Nonlinear constraint violn    0.0E+00
1
 
 Name           Default                  Objective Value      0.0000000000E+00

 Status         Optimal Soln             Iteration      1    Superbasics     1

 Objective               (Min)
 RHS
 Ranges
 Bounds

 Section 1 - Rows

  Number  ...Row.. State  ...Activity...  Slack Activity  ..Lower Limit.  ..Upper Limit.  .Dual Activity    ..i
 
       5  r      1    BS          .               .                None            None         -1.0          1
       6  r      2 D  BS          .               .               .               .               .           2
       7  r      3 D  BS          .               .               .               .               .           3
       8  r      4 D  BS          .               .               .               .               .           4
       9  r      5 D  BS          .               .               .               .               .           5
1
 
 Section 2 - Columns

  Number  .Column. State  ...Activity...  .Obj Gradient.  ..Lower Limit.  ..Upper Limit.  Reduced Gradnt    m+j
 
       1  x      1 A  FR          .16198          .               .07700          .24000          .           6
       2  x      2 A  UL        63.00000          .             20.00000        63.00000          .           7
       3  x      3   SBS          .52024          .               .22000          .67000          .           8
       4  x      4 A  FR        42.00000          .             30.00000        90.00000          .           9
1
 
 SNMEMA EXIT 100 -- finished successfully
 SNMEMA INFO 104 -- memory requirements estimated

         ==============================
         S N O P T  7.2-11   (Jan 2011)
         ==============================
1
 
 Parameters
 ==========

 Files
 -----
 Solution file..........         0       Old basis file ........         0       Standard input.........         5
 Insert file............         0       New basis file ........         0       (Printer)..............         9
 Punch file.............         0       Backup basis file......         0       (Specs file)...........         0
 Load file..............         0       Dump file..............         0       Standard output........         6

 Frequencies
 -----------
 Print frequency........       100       Check frequency........        60       Save new basis map.....       100
 Summary frequency......       100       Factorization frequency        50       Expand frequency.......     10000

 QP subproblems
 --------------
 QPsolver Cholesky......
 Scale tolerance........      .900       Minor feasibility tol..  1.00E-06       Iteration limit........       200
 Scale option...........         0       Minor optimality  tol..  1.00E-06       Minor print level......         1
 Crash tolerance........      .100       Pivot tolerance........  3.25E-11       Partial price..........         1
 Crash option...........         3       Elastic weight.........  1.00E+04       Prtl price section ( A)         4
                                         New superbasics........        99       Prtl price section (-I)         5

 The SQP Method
 --------------
 Minimize...............                 Cold start.............                 Proximal Point method..         1
 Nonlinear objectiv vars         4       Objective Row..........         1       Function precision.....  1.00E-05
 Unbounded step size....  1.00E+20       Superbasics limit......         4       Difference interval....  3.16E-03
 Unbounded objective....  1.00E+15       Reduced Hessian dim....         4       Central difference int.  2.15E-02
 Major step limit.......  2.00E+00       Derivative linesearch..                 Derivative option......         1
 Major iterations limit.      1000       Linesearch tolerance...    .90000       Verify level...........         0
 Minor iterations limit.       500       Penalty parameter......  0.00E+00       Major Print Level......         1
                                         Major optimality tol...  1.00E-02

 Hessian Approximation
 ---------------------
 Full-Memory Hessian....                 Hessian updates........  99999999       Hessian frequency......  99999999
                                                                                 Hessian flush..........  99999999

 Nonlinear constraints
 ---------------------
 Nonlinear constraints..         4       Major feasibility tol..  1.00E-06       Violation limit........  1.00E+06
 Nonlinear Jacobian vars         4

 Miscellaneous
 -------------
 LU factor tolerance....      3.99       LU singularity tol.....  3.25E-11       Timing level...........         0
 LU update tolerance....      3.99       LU swap tolerance......  1.22E-04       Debug level............         0
 LU partial  pivoting...                 eps (machine precision)  2.22E-16       System information.....        No
                                                                                 Sticky parameters......        No
1
 

 

 Matrix statistics
 -----------------
               Total      Normal        Free       Fixed     Bounded
 Rows              5           0           1           4           0
 Columns           4           0           0           0           4

 No. of matrix elements                   16     Density      80.000
 Biggest  constant element        0.0000E+00  (excluding fixed columns,
 Smallest constant element        0.0000E+00   free rows, and RHS)

 No. of objective coefficients             0

 Nonlinear constraints       4     Linear constraints       1
 Nonlinear variables         4     Linear variables         0
 Jacobian  variables         4     Objective variables      4
 Total constraints           5     Total variables          4
1
 

 
 The user has defined      20   out of      20   first  derivatives

 Cheap test of user-supplied problem derivatives...

 XXX  The constraint gradients seem to be incorrect.

 -->  The largest discrepancy was    9.64E-01  in constraint     9
 

 The objective  gradients seem to be OK.

 Gradient projected in one direction   0.00000000000E+00
 Difference approximation              0.00000000000E+00
1
 
 

   Itns Major Minors    Step   nCon Feasible  Optimal  MeritFunction     L+U BSwap     nS  condHz Penalty
      0     0      0              1 (0.0E+00)(0.0E+00) 0.0000000E+00       5                              _  r
1
 
 SNOPTA EXIT   0 -- finished successfully
 SNOPTA INFO   1 -- optimality conditions satisfied

 Problem name                 Default
 No. of iterations                   0   Objective value      0.0000000000E+00
 No. of major iterations             0   Linear objective     0.0000000000E+00
 Penalty parameter           0.000E+00   Nonlinear objective  0.0000000000E+00
 No. of calls to funobj              2   No. of calls to funcon              2
 No. of degenerate steps             0   Percentage                        .00
 Max x                       2 6.3E+01   Max pi                      5 1.0E+00
 Max Primal infeas           0 0.0E+00   Max Dual infeas             0 0.0E+00
 Nonlinear constraint violn    0.0E+00
1
 
 Name           Default                  Objective Value      0.0000000000E+00

 Status         Optimal Soln             Iteration      0    Superbasics     0

 Objective               (Min)
 RHS
 Ranges
 Bounds

 Section 1 - Rows

  Number  ...Row.. State  ...Activity...  Slack Activity  ..Lower Limit.  ..Upper Limit.  .Dual Activity    ..i
 
       5  r      1    BS          .               .                None            None         -1.0          1
       6  r      2 D  BS          .               .               .               .               .           2
       7  r      3 D  BS          .               .               .               .               .           3
       8  r      4 D  BS          .               .               .               .               .           4
       9  r      5 D  BS          .               .               .               .               .           5
1
 
 Section 2 - Columns

  Number  .Column. State  ...Activity...  .Obj Gradient.  ..Lower Limit.  ..Upper Limit.  Reduced Gradnt    m+j
 
       1  x      1 A  FR          .19000          .               .07700          .24000          .           6
       2  x      2 A  UL        63.00000          .             20.00000        63.00000          .           7
       3  x      3 A  FR          .52000          .               .22000          .67000          .           8
       4  x      4 A  FR        42.00000          .             30.00000        90.00000          .           9
1
 
 SNMEMA EXIT 100 -- finished successfully
 SNMEMA INFO 104 -- memory requirements estimated

         ==============================
         S N O P T  7.2-11   (Jan 2011)
         ==============================
1
 
 Parameters
 ==========

 Files
 -----
 Solution file..........         0       Old basis file ........         0       Standard input.........         5
 Insert file............         0       New basis file ........         0       (Printer)..............         9
 Punch file.............         0       Backup basis file......         0       (Specs file)...........         0
 Load file..............         0       Dump file..............         0       Standard output........         6

 Frequencies
 -----------
 Print frequency........       100       Check frequency........        60       Save new basis map.....       100
 Summary frequency......       100       Factorization frequency        50       Expand frequency.......     10000

 QP subproblems
 --------------
 QPsolver Cholesky......
 Scale tolerance........      .900       Minor feasibility tol..  1.00E-06       Iteration limit........       200
 Scale option...........         0       Minor optimality  tol..  1.00E-06       Minor print level......         1
 Crash tolerance........      .100       Pivot tolerance........  3.25E-11       Partial price..........         1
 Crash option...........         3       Elastic weight.........  1.00E+04       Prtl price section ( A)         4
                                         New superbasics........        99       Prtl price section (-I)         5

 The SQP Method
 --------------
 Minimize...............                 Cold start.............                 Proximal Point method..         1
 Nonlinear objectiv vars         4       Objective Row..........         1       Function precision.....  1.00E-05
 Unbounded step size....  1.00E+20       Superbasics limit......         4       Difference interval....  3.16E-03
 Unbounded objective....  1.00E+15       Reduced Hessian dim....         4       Central difference int.  2.15E-02
 Major step limit.......  2.00E+00       Derivative linesearch..                 Derivative option......         1
 Major iterations limit.      1000       Linesearch tolerance...    .90000       Verify level...........         0
 Minor iterations limit.       500       Penalty parameter......  0.00E+00       Major Print Level......         1
                                         Major optimality tol...  1.00E-02

 Hessian Approximation
 ---------------------
 Full-Memory Hessian....                 Hessian updates........  99999999       Hessian frequency......  99999999
                                                                                 Hessian flush..........  99999999

 Nonlinear constraints
 ---------------------
 Nonlinear constraints..         4       Major feasibility tol..  1.00E-06       Violation limit........  1.00E+06
 Nonlinear Jacobian vars         4

 Miscellaneous
 -------------
 LU factor tolerance....      3.99       LU singularity tol.....  3.25E-11       Timing level...........         3
 LU update tolerance....      3.99       LU swap tolerance......  1.22E-04       Debug level............         0
 LU partial  pivoting...                 eps (machine precision)  2.22E-16       System information.....        No
                                                                                 Sticky parameters......        No
1
 

 

 Matrix statistics
 -----------------
               Total      Normal        Free       Fixed     Bounded
 Rows              5           0           1           4           0
 Columns           4           0           0           0           4

 No. of matrix elements                   16     Density      80.000
 Biggest  constant element        0.0000E+00  (excluding fixed columns,
 Smallest constant element        0.0000E+00   free rows, and RHS)

 No. of objective coefficients             0

 Nonlinear constraints       4     Linear constraints       1
 Nonlinear variables         4     Linear variables         0
 Jacobian  variables         4     Objective variables      4
 Total constraints           5     Total variables          4
1
 

 
 The user has defined      20   out of      20   first  derivatives

 Cheap test of user-supplied problem derivatives...

 XXX  The constraint gradients seem to be incorrect.

 -->  The largest discrepancy was    9.64E-01  in constraint     9
 

 The objective  gradients seem to be OK.

 Gradient projected in one direction   0.00000000000E+00
 Difference approximation              0.00000000000E+00
1
 
 

   Itns Major Minors    Step   nCon Feasible  Optimal  MeritFunction     L+U BSwap     nS  condHz Penalty
      0     0      0              1 (0.0E+00)(0.0E+00) 0.0000000E+00       5                              _  r
1
 
 SNOPTA EXIT   0 -- finished successfully
 SNOPTA INFO   1 -- optimality conditions satisfied

 Problem name                 Default
 No. of iterations                   0   Objective value      0.0000000000E+00
 No. of major iterations             0   Linear objective     0.0000000000E+00
 Penalty parameter           0.000E+00   Nonlinear objective  0.0000000000E+00
 No. of calls to funobj              2   No. of calls to funcon              2
 No. of degenerate steps             0   Percentage                        .00
 Max x                       2 6.3E+01   Max pi                      5 1.0E+00
 Max Primal infeas           0 0.0E+00   Max Dual infeas             0 0.0E+00
 Nonlinear constraint violn    0.0E+00
1
 
 Name           Default                  Objective Value      0.0000000000E+00

 Status         Optimal Soln             Iteration      0    Superbasics     0

 Objective               (Min)
 RHS
 Ranges
 Bounds

 Section 1 - Rows

  Number  ...Row.. State  ...Activity...  Slack Activity  ..Lower Limit.  ..Upper Limit.  .Dual Activity    ..i
 
       5  r      1    BS          .               .                None            None         -1.0          1
       6  r      2 D  BS          .               .               .               .               .           2
       7  r      3 D  BS          .               .               .               .               .           3
       8  r      4 D  BS          .               .               .               .               .           4
       9  r      5 D  BS          .               .               .               .               .           5
1
 
 Section 2 - Columns

  Number  .Column. State  ...Activity...  .Obj Gradient.  ..Lower Limit.  ..Upper Limit.  Reduced Gradnt    m+j
 
       1  x      1 A  FR          .19000          .               .07700          .24000          .           6
       2  x      2 A  UL        63.00000          .             20.00000        63.00000          .           7
       3  x      3 A  FR          .52000          .               .22000          .67000          .           8
       4  x      4 A  FR        42.00000          .             30.00000        90.00000          .           9
 
 Time for MPS input                              .00 seconds
 Time for solving problem                        .00 seconds
 Time for solution output                        .00 seconds
 Time for constraint functions         ************* seconds
 Time for objective function                     .00 seconds
1
 
 SNMEMA EXIT 100 -- finished successfully
 SNMEMA INFO 104 -- memory requirements estimated

         ==============================
         S N O P T  7.2-11   (Jan 2011)
         ==============================
1
 
 Parameters
 ==========

 Files
 -----
 Solution file..........         0       Old basis file ........         0       Standard input.........         5
 Insert file............         0       New basis file ........         0       (Printer)..............         9
 Punch file.............         0       Backup basis file......         0       (Specs file)...........         0
 Load file..............         0       Dump file..............         0       Standard output........         6

 Frequencies
 -----------
 Print frequency........       100       Check frequency........        60       Save new basis map.....       100
 Summary frequency......       100       Factorization frequency        50       Expand frequency.......     10000

 QP subproblems
 --------------
 QPsolver Cholesky......
 Scale tolerance........      .900       Minor feasibility tol..  1.00E-06       Iteration limit........       200
 Scale option...........         0       Minor optimality  tol..  1.00E-06       Minor print level......         1
 Crash tolerance........      .100       Pivot tolerance........  3.25E-11       Partial price..........         1
 Crash option...........         3       Elastic weight.........  1.00E+04       Prtl price section ( A)         4
                                         New superbasics........        99       Prtl price section (-I)         5

 The SQP Method
 --------------
 Minimize...............                 Cold start.............                 Proximal Point method..         1
 Nonlinear objectiv vars         4       Objective Row..........         1       Function precision.....  1.00E-06
 Unbounded step size....  1.00E+20       Superbasics limit......         4       Difference interval....  1.00E-03
 Unbounded objective....  1.00E+15       Reduced Hessian dim....         4       Central difference int.  1.00E-02
 Major step limit.......  2.00E+00       Derivative linesearch..                 Derivative option......         1
 Major iterations limit.      1000       Linesearch tolerance...    .90000       Verify level...........         0
 Minor iterations limit.       500       Penalty parameter......  0.00E+00       Major Print Level......         1
                                         Major optimality tol...  3.16E-03

 Hessian Approximation
 ---------------------
 Full-Memory Hessian....                 Hessian updates........  99999999       Hessian frequency......  99999999
                                                                                 Hessian flush..........  99999999

 Nonlinear constraints
 ---------------------
 Nonlinear constraints..         4       Major feasibility tol..  1.00E-06       Violation limit........  1.00E+06
 Nonlinear Jacobian vars         4

 Miscellaneous
 -------------
 LU factor tolerance....      3.99       LU singularity tol.....  3.25E-11       Timing level...........         3
 LU update tolerance....      3.99       LU swap tolerance......  1.22E-04       Debug level............         0
 LU partial  pivoting...                 eps (machine precision)  2.22E-16       System information.....        No
                                                                                 Sticky parameters......        No
1
 

 

 Matrix statistics
 -----------------
               Total      Normal        Free       Fixed     Bounded
 Rows              5           0           1           4           0
 Columns           4           0           0           0           4

 No. of matrix elements                   16     Density      80.000
 Biggest  constant element        0.0000E+00  (excluding fixed columns,
 Smallest constant element        0.0000E+00   free rows, and RHS)

 No. of objective coefficients             0

 Nonlinear constraints       4     Linear constraints       1
 Nonlinear variables         4     Linear variables         0
 Jacobian  variables         4     Objective variables      4
 Total constraints           5     Total variables          4
1
 

 
 The user has defined      20   out of      20   first  derivatives

 Cheap test of user-supplied problem derivatives...

 The constraint gradients seem to be OK.

 -->  The largest discrepancy was    5.63E-02  in constraint     8
 

 The objective  gradients seem to be OK.

 Gradient projected in one direction   0.00000000000E+00
 Difference approximation              0.00000000000E+00
1
 
 

   Itns Major Minors    Step   nCon Feasible  Optimal  MeritFunction     L+U BSwap     nS  condHz Penalty
      1     0      1              1  5.4E-02 (1.6E-03) 0.0000000E+00       5            1 1.0E+00         _  r
      1     1      0 1.0E+00      2 (0.0E+00)(0.0E+00) 0.0000000E+00       5            1 1.0E+00 1.4E-04 _n r
1
 
 SNOPTA EXIT   0 -- finished successfully
 SNOPTA INFO   1 -- optimality conditions satisfied

 Problem name                 Default
 No. of iterations                   1   Objective value      0.0000000000E+00
 No. of major iterations             1   Linear objective     0.0000000000E+00
 Penalty parameter           1.371E-04   Nonlinear objective  0.0000000000E+00
 No. of calls to funobj              3   No. of calls to funcon              3
 No. of superbasics                  1   No. of basic nonlinears             0
 No. of degenerate steps             0   Percentage                        .00
 Max x                       2 6.3E+01   Max pi                      5 1.0E+00
 Max Primal infeas           0 0.0E+00   Max Dual infeas             0 0.0E+00
 Nonlinear constraint violn    0.0E+00
1
 
 Name           Default                  Objective Value      0.0000000000E+00

 Status         Optimal Soln             Iteration      1    Superbasics     1

 Objective               (Min)
 RHS
 Ranges
 Bounds

 Section 1 - Rows

  Number  ...Row.. State  ...Activity...  Slack Activity  ..Lower Limit.  ..Upper Limit.  .Dual Activity    ..i
 
       5  r      1    BS          .               .                None            None         -1.0          1
       6  r      2 D  BS          .               .               .               .               .           2
       7  r      3 D  BS          .               .               .               .               .           3
       8  r      4 D  BS          .               .               .               .               .           4
       9  r      5 D  BS          .               .               .               .               .           5
1
 
 Section 2 - Columns

  Number  .Column. State  ...Activity...  .Obj Gradient.  ..Lower Limit.  ..Upper Limit.  Reduced Gradnt    m+j
 
       1  x      1 A  FR          .16198          .               .07700          .24000          .           6
       2  x      2 A  UL        63.00000          .             20.00000        63.00000          .           7
       3  x      3   SBS          .52024          .               .22000          .67000          .           8
       4  x      4 A  FR        42.00000          .             30.00000        90.00000          .           9
 
 Time for MPS input                              .00 seconds
 Time for solving problem              ************* seconds
 Time for solution output                        .00 seconds
 Time for constraint functions                  2.00 seconds
 Time for objective function                     .00 seconds
1
 
 SNMEMA EXIT 100 -- finished successfully
 SNMEMA INFO 104 -- memory requirements estimated

         ==============================
         S N O P T  7.2-11   (Jan 2011)
         ==============================
1
 
 Parameters
 ==========

 Files
 -----
 Solution file..........         0       Old basis file ........         0       Standard input.........         5
 Insert file............         0       New basis file ........         0       (Printer)..............         9
 Punch file.............         0       Backup basis file......         0       (Specs file)...........         0
 Load file..............         0       Dump file..............         0       Standard output........         6

 Frequencies
 -----------
 Print frequency........       100       Check frequency........        60       Save new basis map.....       100
 Summary frequency......       100       Factorization frequency        50       Expand frequency.......     10000

 QP subproblems
 --------------
 QPsolver Cholesky......
 Scale tolerance........      .900       Minor feasibility tol..  1.00E-06       Iteration limit........       200
 Scale option...........         0       Minor optimality  tol..  1.00E-06       Minor print level......         1
 Crash tolerance........      .100       Pivot tolerance........  3.25E-11       Partial price..........         1
 Crash option...........         3       Elastic weight.........  1.00E+04       Prtl price section ( A)         4
                                         New superbasics........        99       Prtl price section (-I)         5

 The SQP Method
 --------------
 Minimize...............                 Cold start.............                 Proximal Point method..         1
 Nonlinear objectiv vars         4       Objective Row..........         1       Function precision.....  1.00E-06
 Unbounded step size....  1.00E+20       Superbasics limit......         4       Difference interval....  1.00E-03
 Unbounded objective....  1.00E+15       Reduced Hessian dim....         4       Central difference int.  1.00E-02
 Major step limit.......  2.00E+00       Derivative linesearch..                 Derivative option......         1
 Major iterations limit.      1000       Linesearch tolerance...    .90000       Verify level...........         0
 Minor iterations limit.       500       Penalty parameter......  0.00E+00       Major Print Level......         1
                                         Major optimality tol...  3.16E-03

 Hessian Approximation
 ---------------------
 Full-Memory Hessian....                 Hessian updates........  99999999       Hessian frequency......  99999999
                                                                                 Hessian flush..........  99999999

 Nonlinear constraints
 ---------------------
 Nonlinear constraints..         4       Major feasibility tol..  1.00E-06       Violation limit........  1.00E+06
 Nonlinear Jacobian vars         4

 Miscellaneous
 -------------
 LU factor tolerance....      3.99       LU singularity tol.....  3.25E-11       Timing level...........         0
 LU update tolerance....      3.99       LU swap tolerance......  1.22E-04       Debug level............         0
 LU partial  pivoting...                 eps (machine precision)  2.22E-16       System information.....        No
                                                                                 Sticky parameters......        No
1
 

 

 Matrix statistics
 -----------------
               Total      Normal        Free       Fixed     Bounded
 Rows              5           0           1           4           0
 Columns           4           0           0           0           4

 No. of matrix elements                   16     Density      80.000
 Biggest  constant element        0.0000E+00  (excluding fixed columns,
 Smallest constant element        0.0000E+00   free rows, and RHS)

 No. of objective coefficients             0

 Nonlinear constraints       4     Linear constraints       1
 Nonlinear variables         4     Linear variables         0
 Jacobian  variables         4     Objective variables      4
 Total constraints           5     Total variables          4
1
 

 
 The user has defined      20   out of      20   first  derivatives

 Cheap test of user-supplied problem derivatives...

 The constraint gradients seem to be OK.

 -->  The largest discrepancy was    6.01E-02  in constraint     8
 

 The objective  gradients seem to be OK.

 Gradient projected in one direction   0.00000000000E+00
 Difference approximation              0.00000000000E+00
1
 
 

   Itns Major Minors    Step   nCon Feasible  Optimal  MeritFunction     L+U BSwap     nS  condHz Penalty
      1     0      1              1  1.5E-01 (2.5E-03) 0.0000000E+00       5            1 1.0E+00         _  r
      2     1      1 1.0E+00      2  8.2E-03 (1.8E-06) 1.1094197E-04       5            1 5.1E+01 4.5E-05 _n r
      3     2      1 1.0E+00      3  7.9E-04 (7.0E-08) 5.4836588E-08       5            1 1.7E+02 4.5E-05 _s
      4     3      1 1.0E+00      4  1.0E-04 (4.7E-09) 7.8605933E-10       5            1 1.7E+02 4.5E-05 _
      5     4      1 1.0E+00      5  1.6E-05 (4.6E-10) 1.8829675E-11       5            1 1.7E+02 4.5E-05 _
      6     5      1 1.0E+00      6  3.1E-06 (6.5E-11) 6.7130101E-13       5            1 1.7E+02 4.5E-05 _
      7     6      1 1.0E+00      7 (6.6E-07)(1.1E-11) 3.0983928E-14       5            1 1.7E+02 4.5E-05 _
1
 
 SNOPTA EXIT   0 -- finished successfully
 SNOPTA INFO   1 -- optimality conditions satisfied

 Problem name                 Default
 No. of iterations                   7   Objective value      0.0000000000E+00
 No. of major iterations             6   Linear objective     0.0000000000E+00
 Penalty parameter           4.469E-05   Nonlinear objective  0.0000000000E+00
 No. of calls to funobj              8   No. of calls to funcon              8
 No. of superbasics                  1   No. of basic nonlinears             1
 No. of degenerate steps             0   Percentage                        .00
 Max x                       2 6.3E+01   Max pi                      5 1.0E+00
 Max Primal infeas           0 0.0E+00   Max Dual infeas             1 3.3E-10
 Nonlinear constraint violn    3.6E-05
1
 
 Name           Default                  Objective Value      0.0000000000E+00

 Status         Optimal Soln             Iteration      7    Superbasics     1

 Objective               (Min)
 RHS
 Ranges
 Bounds

 Section 1 - Rows

  Number  ...Row.. State  ...Activity...  Slack Activity  ..Lower Limit.  ..Upper Limit.  .Dual Activity    ..i
 
       5  r      1    BS          .               .                None            None         -1.0          1
       6  r      2 D  BS          .               .               .               .               .           2
       7  r      3 D  BS          .               .               .               .               .           3
       8  r      4 A  EQ         -.00004         -.00004          .               .               .00000      4
       9  r      5 D  BS          .               .               .               .               .           5
1
 
 Section 2 - Columns

  Number  .Column. State  ...Activity...  .Obj Gradient.  ..Lower Limit.  ..Upper Limit.  Reduced Gradnt    m+j
 
       1  x      1    BS          .14231          .               .07700          .24000          .00000      6
       2  x      2 A  UL        63.00000          .             20.00000        63.00000          .           7
       3  x      3   SBS          .52049          .               .22000          .67000          .00000      8
       4  x      4 A  FR        42.00000          .             30.00000        90.00000          .           9
1
 
 SNMEMA EXIT 100 -- finished successfully
 SNMEMA INFO 104 -- memory requirements estimated

         ==============================
         S N O P T  7.2-11   (Jan 2011)
         ==============================
1
 
 Parameters
 ==========

 Files
 -----
 Solution file..........         0       Old basis file ........         0       Standard input.........         5
 Insert file............         0       New basis file ........         0       (Printer)..............         9
 Punch file.............         0       Backup basis file......         0       (Specs file)...........         0
 Load file..............         0       Dump file..............         0       Standard output........         6

 Frequencies
 -----------
 Print frequency........       100       Check frequency........        60       Save new basis map.....       100
 Summary frequency......       100       Factorization frequency        50       Expand frequency.......     10000

 QP subproblems
 --------------
 QPsolver Cholesky......
 Scale tolerance........      .900       Minor feasibility tol..  1.00E-06       Iteration limit........       200
 Scale option...........         0       Minor optimality  tol..  1.00E-06       Minor print level......         1
 Crash tolerance........      .100       Pivot tolerance........  3.25E-11       Partial price..........         1
 Crash option...........         3       Elastic weight.........  1.00E+04       Prtl price section ( A)         4
                                         New superbasics........        99       Prtl price section (-I)         5

 The SQP Method
 --------------
 Minimize...............                 Cold start.............                 Proximal Point method..         1
 Nonlinear objectiv vars         4       Objective Row..........         1       Function precision.....  1.00E-06
 Unbounded step size....  1.00E+20       Superbasics limit......         4       Difference interval....  1.00E-03
 Unbounded objective....  1.00E+15       Reduced Hessian dim....         4       Central difference int.  1.00E-02
 Major step limit.......  2.00E+00       Derivative linesearch..                 Derivative option......         1
 Major iterations limit.      1000       Linesearch tolerance...    .90000       Verify level...........         0
 Minor iterations limit.       500       Penalty parameter......  0.00E+00       Major Print Level......         1
                                         Major optimality tol...  3.16E-03

 Hessian Approximation
 ---------------------
 Full-Memory Hessian....                 Hessian updates........  99999999       Hessian frequency......  99999999
                                                                                 Hessian flush..........  99999999

 Nonlinear constraints
 ---------------------
 Nonlinear constraints..         4       Major feasibility tol..  1.00E-06       Violation limit........  1.00E+06
 Nonlinear Jacobian vars         4

 Miscellaneous
 -------------
 LU factor tolerance....      3.99       LU singularity tol.....  3.25E-11       Timing level...........         0
 LU update tolerance....      3.99       LU swap tolerance......  1.22E-04       Debug level............         0
 LU partial  pivoting...                 eps (machine precision)  2.22E-16       System information.....        No
                                                                                 Sticky parameters......        No
1
 

 

 Matrix statistics
 -----------------
               Total      Normal        Free       Fixed     Bounded
 Rows              5           0           1           4           0
 Columns           4           0           0           0           4

 No. of matrix elements                   16     Density      80.000
 Biggest  constant element        0.0000E+00  (excluding fixed columns,
 Smallest constant element        0.0000E+00   free rows, and RHS)

 No. of objective coefficients             0

 Nonlinear constraints       4     Linear constraints       1
 Nonlinear variables         4     Linear variables         0
 Jacobian  variables         4     Objective variables      4
 Total constraints           5     Total variables          4
1
 

 
 The user has defined      20   out of      20   first  derivatives

 Cheap test of user-supplied problem derivatives...

 XXX  The constraint gradients seem to be incorrect.

 -->  The largest discrepancy was    9.08E-01  in constraint     8
 

 The objective  gradients seem to be OK.

 Gradient projected in one direction   0.00000000000E+00
 Difference approximation              0.00000000000E+00
1
 
 

   Itns Major Minors    Step   nCon Feasible  Optimal  MeritFunction     L+U BSwap     nS  condHz Penalty
      0     0      0              1 (0.0E+00)(0.0E+00) 0.0000000E+00       5                              _  r
1
 
 SNOPTA EXIT   0 -- finished successfully
 SNOPTA INFO   1 -- optimality conditions satisfied

 Problem name                 Default
 No. of iterations                   0   Objective value      0.0000000000E+00
 No. of major iterations             0   Linear objective     0.0000000000E+00
 Penalty parameter           0.000E+00   Nonlinear objective  0.0000000000E+00
 No. of calls to funobj              2   No. of calls to funcon              2
 No. of degenerate steps             0   Percentage                        .00
 Max x                       2 6.3E+01   Max pi                      5 1.0E+00
 Max Primal infeas           0 0.0E+00   Max Dual infeas             0 0.0E+00
 Nonlinear constraint violn    0.0E+00
1
 
 Name           Default                  Objective Value      0.0000000000E+00

 Status         Optimal Soln             Iteration      0    Superbasics     0

 Objective               (Min)
 RHS
 Ranges
 Bounds

 Section 1 - Rows

  Number  ...Row.. State  ...Activity...  Slack Activity  ..Lower Limit.  ..Upper Limit.  .Dual Activity    ..i
 
       5  r      1    BS          .               .                None            None         -1.0          1
       6  r      2 D  BS          .               .               .               .               .           2
       7  r      3 D  BS          .               .               .               .               .           3
       8  r      4 D  BS          .               .               .               .               .           4
       9  r      5 D  BS          .               .               .               .               .           5
1
 
 Section 2 - Columns

  Number  .Column. State  ...Activity...  .Obj Gradient.  ..Lower Limit.  ..Upper Limit.  Reduced Gradnt    m+j
 
       1  x      1 A  FR          .19000          .               .07700          .24000          .           6
       2  x      2 A  UL        63.00000          .             20.00000        63.00000          .           7
       3  x      3 A  FR          .52000          .               .22000          .67000          .           8
       4  x      4 A  FR        42.00000          .             30.00000        90.00000          .           9
1
 
 SNMEMA EXIT 100 -- finished successfully
 SNMEMA INFO 104 -- memory requirements estimated

         ==============================
         S N O P T  7.2-11   (Jan 2011)
         ==============================

 Nonzero derivs  Jij         5
 Non-constant    Jij's       5     Constant Jij's           0
1
 
 SNJAC  EXIT 100 -- finished successfully
 SNJAC  INFO 102 -- Jacobian structure estimated

 
 ===>  WARNING - Row         2 of the Jacobian is empty.
 ===>  WARNING - Row         3 of the Jacobian is empty.
1
 
 Parameters
 ==========

 Files
 -----
 Solution file..........         0       Old basis file ........         0       Standard input.........         5
 Insert file............         0       New basis file ........         0       (Printer)..............         9
 Punch file.............         0       Backup basis file......         0       (Specs file)...........         0
 Load file..............         0       Dump file..............         0       Standard output........         6

 Frequencies
 -----------
 Print frequency........       100       Check frequency........        60       Save new basis map.....       100
 Summary frequency......       100       Factorization frequency        50       Expand frequency.......     10000

 QP subproblems
 --------------
 QPsolver Cholesky......
 Scale tolerance........      .900       Minor feasibility tol..  1.00E-06       Iteration limit........       200
 Scale option...........         0       Minor optimality  tol..  1.00E-06       Minor print level......         1
 Crash tolerance........      .100       Pivot tolerance........  3.25E-11       Partial price..........         1
 Crash option...........         3       Elastic weight.........  1.00E+04       Prtl price section ( A)         4
                                         New superbasics........        99       Prtl price section (-I)         5

 The SQP Method
 --------------
 Minimize...............                 Cold start.............                 Proximal Point method..         1
 Nonlinear objectiv vars         0       Objective Row..........         1       Function precision.....  1.00E-06
 Unbounded step size....  1.00E+20       Superbasics limit......         4       Difference interval....  1.00E-03
 Unbounded objective....  1.00E+15       Reduced Hessian dim....         4       Central difference int.  1.00E-02
 Major step limit.......  2.00E+00       Nonderiv.  linesearch..                 Derivative option......         0
 Major iterations limit.      1000       Linesearch tolerance...    .90000       Verify level...........         0
 Minor iterations limit.       500       Penalty parameter......  0.00E+00       Major Print Level......         1
                                         Major optimality tol...  3.16E-03

 Hessian Approximation
 ---------------------
 Full-Memory Hessian....                 Hessian updates........  99999999       Hessian frequency......  99999999
                                                                                 Hessian flush..........  99999999

 Nonlinear constraints
 ---------------------
 Nonlinear constraints..         2       Major feasibility tol..  1.00E-06       Violation limit........  1.00E+06
 Nonlinear Jacobian vars         4

 Miscellaneous
 -------------
 LU factor tolerance....      3.99       LU singularity tol.....  3.25E-11       Timing level...........         3
 LU update tolerance....      3.99       LU swap tolerance......  1.22E-04       Debug level............         0
 LU partial  pivoting...                 eps (machine precision)  2.22E-16       System information.....        No
                                                                                 Sticky parameters......        No
1
 

 

 Matrix statistics
 -----------------
               Total      Normal        Free       Fixed     Bounded
 Rows              5           0           1           4           0
 Columns           4           0           0           0           4

 No. of matrix elements                    5     Density      25.000
 Biggest  constant element        0.0000E+00  (excluding fixed columns,
 Smallest constant element        0.0000E+00   free rows, and RHS)

 No. of objective coefficients             0

 Nonlinear constraints       2     Linear constraints       3
 Nonlinear variables         4     Linear variables         0
 Jacobian  variables         4     Objective variables      0
 Total constraints           5     Total variables          4
1
 

 
 The user has defined       0   out of       5   first  derivatives
1
 
 

   Itns Major Minors    Step   nCon Feasible  Optimal  MeritFunction     L+U BSwap     nS  condHz Penalty
      1     0      1              1  5.4E-02 (1.6E-03) 0.0000000E+00       5            1 1.0E+00         _  r   c
 

   Itns Major Minors    Step   nCon Feasible  Optimal  MeritFunction     L+U BSwap     nS  condHz Penalty
      2     0      2              1  5.4E-02 (1.9E-03) 0.0000000E+00       5            1 1.0E+00         _  r   c
      3     1      1 8.9E-01      2 (0.0E+00)(0.0E+00) 0.0000000E+00       5            1 1.1E+02 1.9E-04 _n r   c
1
 
 SNOPTA EXIT   0 -- finished successfully
 SNOPTA INFO   1 -- optimality conditions satisfied

 Problem name                 Default
 No. of iterations                   3   Objective value      0.0000000000E+00
 No. of major iterations             1   Linear objective     0.0000000000E+00
 Penalty parameter           1.920E-04   Nonlinear objective  0.0000000000E+00
 No. of calls to funobj             29   No. of calls to funcon             29
 Calls with modes 1,2 (known g)      2   Calls with modes 1,2 (known g)      2
 Calls for forward differencing      4   Calls for forward differencing      4
 Calls for central differencing     16   Calls for central differencing     16
 No. of superbasics                  1   No. of basic nonlinears             1
 No. of degenerate steps             0   Percentage                        .00
 Max x                       2 6.3E+01   Max pi                      3 1.0E+00
 Max Primal infeas           0 0.0E+00   Max Dual infeas             0 0.0E+00
 Nonlinear constraint violn    0.0E+00
1
 
 Name           Default                  Objective Value      0.0000000000E+00

 Status         Optimal Soln             Iteration      3    Superbasics     1

 Objective               (Min)
 RHS
 Ranges
 Bounds

 Section 1 - Rows

  Number  ...Row.. State  ...Activity...  Slack Activity  ..Lower Limit.  ..Upper Limit.  .Dual Activity    ..i
 
       5  r      1    BS          .               .                None            None         -1.0          1
       6  r      2 D  BS          .               .               .               .               .           2
       7  r      3 D  BS          .               .               .               .               .           3
       8  r      4 A  EQ          .               .               .               .               .           4
       9  r      5 D  BS          .               .               .               .               .           5
1
 
 Section 2 - Columns

  Number  .Column. State  ...Activity...  .Obj Gradient.  ..Lower Limit.  ..Upper Limit.  Reduced Gradnt    m+j
 
       1  x      1    BS          .16051          .               .07700          .24000          .           6
       2  x      2 A  UL        63.00000          .             20.00000        63.00000          .           7
       3  x      3   SBS          .52029          .               .22000          .67000          .           8
       4  x      4 A  FR        42.00000          .             30.00000        90.00000          .           9
 
 Time for MPS input                              .00 seconds
 Time for solving problem                        .00 seconds
 Time for solution output                        .00 seconds
 Time for constraint functions         ************* seconds
 Time for objective function                     .00 seconds
1
 
 SNMEMA EXIT 100 -- finished successfully
 SNMEMA INFO 104 -- memory requirements estimated

         ==============================
         S N O P T  7.2-11   (Jan 2011)
         ==============================

 Nonzero derivs  Jij         1
 Non-constant    Jij's       1     Constant Jij's           0
1
 
 SNJAC  EXIT 100 -- finished successfully
 SNJAC  INFO 102 -- Jacobian structure estimated

 
 ===>  WARNING - Column      2 of the Jacobian is empty.
 ===>  WARNING - Column      3 of the Jacobian is empty.
 ===>  WARNING - Column      4 of the Jacobian is empty.
 ===>  WARNING - Row         2 of the Jacobian is empty.
 ===>  WARNING - Row         3 of the Jacobian is empty.
 ===>  WARNING - Row         4 of the Jacobian is empty.
1
 
 Parameters
 ==========

 Files
 -----
 Solution file..........         0       Old basis file ........         0       Standard input.........         5
 Insert file............         0       New basis file ........         0       (Printer)..............         9
 Punch file.............         0       Backup basis file......         0       (Specs file)...........         0
 Load file..............         0       Dump file..............         0       Standard output........         6

 Frequencies
 -----------
 Print frequency........       100       Check frequency........        60       Save new basis map.....       100
 Summary frequency......       100       Factorization frequency        50       Expand frequency.......     10000

 QP subproblems
 --------------
 QPsolver Cholesky......
 Scale tolerance........      .900       Minor feasibility tol..  1.00E-06       Iteration limit........       200
 Scale option...........         1       Minor optimality  tol..  1.00E-06       Minor print level......         1
 Crash tolerance........      .100       Pivot tolerance........  3.25E-11       Partial price..........         1
 Crash option...........         3       Elastic weight.........  1.00E+04       Prtl price section ( A)         4
                                         New superbasics........        99       Prtl price section (-I)         5

 The SQP Method
 --------------
 Minimize...............                 Cold start.............                 Proximal Point method..         1
 Nonlinear objectiv vars         0       Objective Row..........         1       Function precision.....  1.00E-06
 Unbounded step size....  1.00E+20       Superbasics limit......         2       Difference interval....  1.00E-03
 Unbounded objective....  1.00E+15       Reduced Hessian dim....         2       Central difference int.  1.00E-02
 Major step limit.......  2.00E+00       Nonderiv.  linesearch..                 Derivative option......         0
 Major iterations limit.      1000       Linesearch tolerance...    .90000       Verify level...........         0
 Minor iterations limit.       500       Penalty parameter......  0.00E+00       Major Print Level......         1
                                         Major optimality tol...  3.16E-03

 Hessian Approximation
 ---------------------
 Full-Memory Hessian....                 Hessian updates........  99999999       Hessian frequency......  99999999
                                                                                 Hessian flush..........  99999999

 Nonlinear constraints
 ---------------------
 Nonlinear constraints..         1       Major feasibility tol..  1.00E-06       Violation limit........  1.00E+06
 Nonlinear Jacobian vars         1

 Miscellaneous
 -------------
 LU factor tolerance....      3.99       LU singularity tol.....  3.25E-11       Timing level...........         0
 LU update tolerance....      3.99       LU swap tolerance......  1.22E-04       Debug level............         0
 LU partial  pivoting...                 eps (machine precision)  2.22E-16       System information.....        No
                                                                                 Sticky parameters......        No
1
 

 

 Matrix statistics
 -----------------
               Total      Normal        Free       Fixed     Bounded
 Rows              5           0           1           4           0
 Columns           4           0           0           0           4

 No. of matrix elements                    1     Density       5.000
 Biggest  constant element        0.0000E+00  (excluding fixed columns,
 Smallest constant element        0.0000E+00   free rows, and RHS)

 No. of objective coefficients             0

 Nonlinear constraints       1     Linear constraints       4
 Nonlinear variables         1     Linear variables         3
 Jacobian  variables         1     Objective variables      0
 Total constraints           5     Total variables          4
1
 

 
 The user has defined       0   out of       1   first  derivatives
1
 
 

   Itns Major Minors    Step   nCon Feasible  Optimal  MeritFunction     L+U BSwap     nS  condHz Penalty
      0     0      0              1 (0.0E+00)(0.0E+00) 0.0000000E+00       5                              _  r   c
 

   Itns Major Minors    Step   nCon Feasible  Optimal  MeritFunction     L+U BSwap     nS  condHz Penalty
      0     0      0              1 (0.0E+00)(0.0E+00) 0.0000000E+00       5                              _  r   c
1
 
 SNOPTA EXIT   0 -- finished successfully
 SNOPTA INFO   1 -- optimality conditions satisfied

 Problem name                 Default
 No. of iterations                   0   Objective value      0.0000000000E+00
 No. of major iterations             0   Linear objective     0.0000000000E+00
 Penalty parameter           0.000E+00   Nonlinear objective  0.0000000000E+00
 No. of calls to funobj              4   No. of calls to funcon              4
 Calls with modes 1,2 (known g)      1   Calls with modes 1,2 (known g)      1
 Calls for forward differencing      1   Calls for forward differencing      1
 Calls for central differencing      2   Calls for central differencing      2
 No. of degenerate steps             0   Percentage                        .00
 Max x       (scaled)        2 6.3E+01   Max pi      (scaled)        2 1.0E+00
 Max x                       2 6.3E+01   Max pi                      2 1.0E+00
 Max Prim inf(scaled)        0 0.0E+00   Max Dual inf(scaled)        0 0.0E+00
 Max Primal infeas           0 0.0E+00   Max Dual infeas             0 0.0E+00
 Nonlinear constraint violn    0.0E+00
1
 
 Name           Default                  Objective Value      0.0000000000E+00

 Status         Optimal Soln             Iteration      0    Superbasics     0

 Objective               (Min)
 RHS
 Ranges
 Bounds

 Section 1 - Rows

  Number  ...Row.. State  ...Activity...  Slack Activity  ..Lower Limit.  ..Upper Limit.  .Dual Activity    ..i
 
       5  r      1    BS          .               .                None            None         -1.0          1
       6  r      2 D  BS          .               .               .               .               .           2
       7  r      3 D  BS          .               .               .               .               .           3
       8  r      4 D  BS          .               .               .               .               .           4
       9  r      5 D  BS          .               .               .               .               .           5
1
 
 Section 2 - Columns

  Number  .Column. State  ...Activity...  .Obj Gradient.  ..Lower Limit.  ..Upper Limit.  Reduced Gradnt    m+j
 
       1  x      1 A  FR          .19000          .               .07700          .24000          .           6
       2  x      2 A  UL        63.00000          .             20.00000        63.00000          .           7
       3  x      3 A  FR          .52000          .               .22000          .67000          .           8
       4  x      4 A  FR        42.00000          .             30.00000        90.00000          .           9
1
 
 SNMEMA EXIT 100 -- finished successfully
 SNMEMA INFO 104 -- memory requirements estimated

         ==============================
         S N O P T  7.2-11   (Jan 2011)
         ==============================

 Nonzero derivs  Jij         5
 Non-constant    Jij's       5     Constant Jij's           0
1
 
 SNJAC  EXIT 100 -- finished successfully
 SNJAC  INFO 102 -- Jacobian structure estimated

 
 ===>  WARNING - Row         2 of the Jacobian is empty.
 ===>  WARNING - Row         3 of the Jacobian is empty.
1
 
 Parameters
 ==========

 Files
 -----
 Solution file..........         0       Old basis file ........         0       Standard input.........         5
 Insert file............         0       New basis file ........         0       (Printer)..............         9
 Punch file.............         0       Backup basis file......         0       (Specs file)...........         0
 Load file..............         0       Dump file..............         0       Standard output........         6

 Frequencies
 -----------
 Print frequency........       100       Check frequency........        60       Save new basis map.....       100
 Summary frequency......       100       Factorization frequency        50       Expand frequency.......     10000

 QP subproblems
 --------------
 QPsolver Cholesky......
 Scale tolerance........      .900       Minor feasibility tol..  1.00E-06       Iteration limit........       200
 Scale option...........         0       Minor optimality  tol..  1.00E-06       Minor print level......         1
 Crash tolerance........      .100       Pivot tolerance........  3.25E-11       Partial price..........         1
 Crash option...........         3       Elastic weight.........  1.00E+04       Prtl price section ( A)         4
                                         New superbasics........        99       Prtl price section (-I)         5

 The SQP Method
 --------------
 Minimize...............                 Cold start.............                 Proximal Point method..         1
 Nonlinear objectiv vars         0       Objective Row..........         1       Function precision.....  1.00E-06
 Unbounded step size....  1.00E+20       Superbasics limit......         4       Difference interval....  1.00E-03
 Unbounded objective....  1.00E+15       Reduced Hessian dim....         4       Central difference int.  1.00E-02
 Major step limit.......  2.00E+00       Nonderiv.  linesearch..                 Derivative option......         0
 Major iterations limit.      1000       Linesearch tolerance...    .90000       Verify level...........         0
 Minor iterations limit.       500       Penalty parameter......  0.00E+00       Major Print Level......         1
                                         Major optimality tol...  3.16E-03

 Hessian Approximation
 ---------------------
 Full-Memory Hessian....                 Hessian updates........  99999999       Hessian frequency......  99999999
                                                                                 Hessian flush..........  99999999

 Nonlinear constraints
 ---------------------
 Nonlinear constraints..         2       Major feasibility tol..  1.00E-06       Violation limit........  1.00E+06
 Nonlinear Jacobian vars         4

 Miscellaneous
 -------------
 LU factor tolerance....      3.99       LU singularity tol.....  3.25E-11       Timing level...........         3
 LU update tolerance....      3.99       LU swap tolerance......  1.22E-04       Debug level............         0
 LU partial  pivoting...                 eps (machine precision)  2.22E-16       System information.....        No
                                                                                 Sticky parameters......        No
1
 

 

 Matrix statistics
 -----------------
               Total      Normal        Free       Fixed     Bounded
 Rows              5           0           1           4           0
 Columns           4           0           0           0           4

 No. of matrix elements                    5     Density      25.000
 Biggest  constant element        0.0000E+00  (excluding fixed columns,
 Smallest constant element        0.0000E+00   free rows, and RHS)

 No. of objective coefficients             0

 Nonlinear constraints       2     Linear constraints       3
 Nonlinear variables         4     Linear variables         0
 Jacobian  variables         4     Objective variables      0
 Total constraints           5     Total variables          4
1
 

 
 The user has defined       0   out of       5   first  derivatives
1
 
 

   Itns Major Minors    Step   nCon Feasible  Optimal  MeritFunction     L+U BSwap     nS  condHz Penalty
      1     0      1              1  5.4E-02 (1.6E-03) 0.0000000E+00       5            1 1.0E+00         _  r   c
 

   Itns Major Minors    Step   nCon Feasible  Optimal  MeritFunction     L+U BSwap     nS  condHz Penalty
      2     0      2              1  5.4E-02 (1.9E-03) 0.0000000E+00       5            1 1.0E+00         _  r   c
      3     1      1 8.9E-01      2 (0.0E+00)(0.0E+00) 0.0000000E+00       5            1 1.1E+02 1.9E-04 _n r   c
1
 
 SNOPTA EXIT   0 -- finished successfully
 SNOPTA INFO   1 -- optimality conditions satisfied

 Problem name                 Default
 No. of iterations                   3   Objective value      0.0000000000E+00
 No. of major iterations             1   Linear objective     0.0000000000E+00
 Penalty parameter           1.920E-04   Nonlinear objective  0.0000000000E+00
 No. of calls to funobj             29   No. of calls to funcon             29
 Calls with modes 1,2 (known g)      2   Calls with modes 1,2 (known g)      2
 Calls for forward differencing      4   Calls for forward differencing      4
 Calls for central differencing     16   Calls for central differencing     16
 No. of superbasics                  1   No. of basic nonlinears             1
 No. of degenerate steps             0   Percentage                        .00
 Max x                       2 6.3E+01   Max pi                      3 1.0E+00
 Max Primal infeas           0 0.0E+00   Max Dual infeas             0 0.0E+00
 Nonlinear constraint violn    0.0E+00
1
 
 Name           Default                  Objective Value      0.0000000000E+00

 Status         Optimal Soln             Iteration      3    Superbasics     1

 Objective               (Min)
 RHS
 Ranges
 Bounds

 Section 1 - Rows

  Number  ...Row.. State  ...Activity...  Slack Activity  ..Lower Limit.  ..Upper Limit.  .Dual Activity    ..i
 
       5  r      1    BS          .               .                None            None         -1.0          1
       6  r      2 D  BS          .               .               .               .               .           2
       7  r      3 D  BS          .               .               .               .               .           3
       8  r      4 A  EQ          .               .               .               .               .           4
       9  r      5 D  BS          .               .               .               .               .           5
1
 
 Section 2 - Columns

  Number  .Column. State  ...Activity...  .Obj Gradient.  ..Lower Limit.  ..Upper Limit.  Reduced Gradnt    m+j
 
       1  x      1    BS          .16051          .               .07700          .24000          .           6
       2  x      2 A  UL        63.00000          .             20.00000        63.00000          .           7
       3  x      3   SBS          .52029          .               .22000          .67000          .           8
       4  x      4 A  FR        42.00000          .             30.00000        90.00000          .           9
 
 Time for MPS input                              .00 seconds
 Time for solving problem                       2.00 seconds
 Time for solution output                        .00 seconds
 Time for constraint functions         ************* seconds
 Time for objective function                     .00 seconds
1
 
 SNMEMA EXIT 100 -- finished successfully
 SNMEMA INFO 104 -- memory requirements estimated

         ==============================
         S N O P T  7.2-11   (Jan 2011)
         ==============================
1
 
 Parameters
 ==========

 Files
 -----
 Solution file..........         0       Old basis file ........         0       Standard input.........         5
 Insert file............         0       New basis file ........         0       (Printer)..............         9
 Punch file.............         0       Backup basis file......         0       (Specs file)...........         0
 Load file..............         0       Dump file..............         0       Standard output........         6

 Frequencies
 -----------
 Print frequency........       100       Check frequency........        60       Save new basis map.....       100
 Summary frequency......       100       Factorization frequency        50       Expand frequency.......     10000

 QP subproblems
 --------------
 QPsolver Cholesky......
 Scale tolerance........      .900       Minor feasibility tol..  1.00E-06       Iteration limit........       200
 Scale option...........         0       Minor optimality  tol..  1.00E-06       Minor print level......         1
 Crash tolerance........      .100       Pivot tolerance........  3.25E-11       Partial price..........         1
 Crash option...........         3       Elastic weight.........  1.00E+04       Prtl price section ( A)         4
                                         New superbasics........        99       Prtl price section (-I)         5

 The SQP Method
 --------------
 Minimize...............                 Cold start.............                 Proximal Point method..         1
 Nonlinear objectiv vars         4       Objective Row..........         1       Function precision.....  1.00E-06
 Unbounded step size....  1.00E+20       Superbasics limit......         4       Difference interval....  1.00E-03
 Unbounded objective....  1.00E+15       Reduced Hessian dim....         4       Central difference int.  1.00E-02
 Major step limit.......  2.00E+00       Derivative linesearch..                 Derivative option......         1
 Major iterations limit.      1000       Linesearch tolerance...    .90000       Verify level...........         0
 Minor iterations limit.       500       Penalty parameter......  0.00E+00       Major Print Level......         1
                                         Major optimality tol...  3.16E-03

 Hessian Approximation
 ---------------------
 Full-Memory Hessian....                 Hessian updates........  99999999       Hessian frequency......  99999999
                                                                                 Hessian flush..........  99999999

 Nonlinear constraints
 ---------------------
 Nonlinear constraints..         4       Major feasibility tol..  1.00E-06       Violation limit........  1.00E+06
 Nonlinear Jacobian vars         4

 Miscellaneous
 -------------
 LU factor tolerance....      3.99       LU singularity tol.....  3.25E-11       Timing level...........         3
 LU update tolerance....      3.99       LU swap tolerance......  1.22E-04       Debug level............         0
 LU partial  pivoting...                 eps (machine precision)  2.22E-16       System information.....        No
                                                                                 Sticky parameters......        No
1
 

 

 Matrix statistics
 -----------------
               Total      Normal        Free       Fixed     Bounded
 Rows              5           0           1           4           0
 Columns           4           0           0           0           4

 No. of matrix elements                   16     Density      80.000
 Biggest  constant element        0.0000E+00  (excluding fixed columns,
 Smallest constant element        0.0000E+00   free rows, and RHS)

 No. of objective coefficients             0

 Nonlinear constraints       4     Linear constraints       1
 Nonlinear variables         4     Linear variables         0
 Jacobian  variables         4     Objective variables      4
 Total constraints           5     Total variables          4
1
 

 
 The user has defined      20   out of      20   first  derivatives

 Cheap test of user-supplied problem derivatives...

 The constraint gradients seem to be OK.

 -->  The largest discrepancy was    5.63E-02  in constraint     8
 

 The objective  gradients seem to be OK.

 Gradient projected in one direction   0.00000000000E+00
 Difference approximation              0.00000000000E+00
1
 
 

   Itns Major Minors    Step   nCon Feasible  Optimal  MeritFunction     L+U BSwap     nS  condHz Penalty
      1     0      1              1  5.4E-02 (1.6E-03) 0.0000000E+00       5            1 1.0E+00         _  r
      1     1      0 1.0E+00      2 (0.0E+00)(0.0E+00) 0.0000000E+00       5            1 1.0E+00 1.4E-04 _n r
1
 
 SNOPTA EXIT   0 -- finished successfully
 SNOPTA INFO   1 -- optimality conditions satisfied

 Problem name                 Default
 No. of iterations                   1   Objective value      0.0000000000E+00
 No. of major iterations             1   Linear objective     0.0000000000E+00
 Penalty parameter           1.371E-04   Nonlinear objective  0.0000000000E+00
 No. of calls to funobj              3   No. of calls to funcon              3
 No. of superbasics                  1   No. of basic nonlinears             0
 No. of degenerate steps             0   Percentage                        .00
 Max x                       2 6.3E+01   Max pi                      5 1.0E+00
 Max Primal infeas           0 0.0E+00   Max Dual infeas             0 0.0E+00
 Nonlinear constraint violn    0.0E+00
1
 
 Name           Default                  Objective Value      0.0000000000E+00

 Status         Optimal Soln             Iteration      1    Superbasics     1

 Objective               (Min)
 RHS
 Ranges
 Bounds

 Section 1 - Rows

  Number  ...Row.. State  ...Activity...  Slack Activity  ..Lower Limit.  ..Upper Limit.  .Dual Activity    ..i
 
       5  r      1    BS          .               .                None            None         -1.0          1
       6  r      2 D  BS          .               .               .               .               .           2
       7  r      3 D  BS          .               .               .               .               .           3
       8  r      4 D  BS          .               .               .               .               .           4
       9  r      5 D  BS          .               .               .               .               .           5
1
 
 Section 2 - Columns

  Number  .Column. State  ...Activity...  .Obj Gradient.  ..Lower Limit.  ..Upper Limit.  Reduced Gradnt    m+j
 
       1  x      1 A  FR          .16198          .               .07700          .24000          .           6
       2  x      2 A  UL        63.00000          .             20.00000        63.00000          .           7
       3  x      3   SBS          .52024          .               .22000          .67000          .           8
       4  x      4 A  FR        42.00000          .             30.00000        90.00000          .           9
 
 Time for MPS input                              .00 seconds
 Time for solving problem              ************* seconds
 Time for solution output                        .00 seconds
 Time for constraint functions         ************* seconds
 Time for objective function                     .00 seconds
1
 
 SNMEMA EXIT 100 -- finished successfully
 SNMEMA INFO 104 -- memory requirements estimated

         ==============================
         S N O P T  7.2-11   (Jan 2011)
         ==============================
1
 
 Parameters
 ==========

 Files
 -----
 Solution file..........         0       Old basis file ........         0       Standard input.........         5
 Insert file............         0       New basis file ........         0       (Printer)..............         9
 Punch file.............         0       Backup basis file......         0       (Specs file)...........         0
 Load file..............         0       Dump file..............         0       Standard output........         6

 Frequencies
 -----------
 Print frequency........       100       Check frequency........        60       Save new basis map.....       100
 Summary frequency......       100       Factorization frequency        50       Expand frequency.......     10000

 QP subproblems
 --------------
 QPsolver Cholesky......
 Scale tolerance........      .900       Minor feasibility tol..  1.00E-06       Iteration limit........       200
 Scale option...........         0       Minor optimality  tol..  1.00E-06       Minor print level......         1
 Crash tolerance........      .100       Pivot tolerance........  3.25E-11       Partial price..........         1
 Crash option...........         3       Elastic weight.........  1.00E+04       Prtl price section ( A)         4
                                         New superbasics........        99       Prtl price section (-I)         5

 The SQP Method
 --------------
 Minimize...............                 Cold start.............                 Proximal Point method..         1
 Nonlinear objectiv vars         4       Objective Row..........         1       Function precision.....  1.00E-06
 Unbounded step size....  1.00E+20       Superbasics limit......         4       Difference interval....  1.00E-03
 Unbounded objective....  1.00E+15       Reduced Hessian dim....         4       Central difference int.  1.00E-02
 Major step limit.......  2.00E+00       Derivative linesearch..                 Derivative option......         1
 Major iterations limit.      1000       Linesearch tolerance...    .90000       Verify level...........         0
 Minor iterations limit.       500       Penalty parameter......  0.00E+00       Major Print Level......         1
                                         Major optimality tol...  3.16E-03

 Hessian Approximation
 ---------------------
 Full-Memory Hessian....                 Hessian updates........  99999999       Hessian frequency......  99999999
                                                                                 Hessian flush..........  99999999

 Nonlinear constraints
 ---------------------
 Nonlinear constraints..         4       Major feasibility tol..  1.00E-06       Violation limit........  1.00E+06
 Nonlinear Jacobian vars         4

 Miscellaneous
 -------------
 LU factor tolerance....      3.99       LU singularity tol.....  3.25E-11       Timing level...........         0
 LU update tolerance....      3.99       LU swap tolerance......  1.22E-04       Debug level............         0
 LU partial  pivoting...                 eps (machine precision)  2.22E-16       System information.....        No
                                                                                 Sticky parameters......        No
1
 

 

 Matrix statistics
 -----------------
               Total      Normal        Free       Fixed     Bounded
 Rows              5           0           1           4           0
 Columns           4           0           0           0           4

 No. of matrix elements                   16     Density      80.000
 Biggest  constant element        0.0000E+00  (excluding fixed columns,
 Smallest constant element        0.0000E+00   free rows, and RHS)

 No. of objective coefficients             0

 Nonlinear constraints       4     Linear constraints       1
 Nonlinear variables         4     Linear variables         0
 Jacobian  variables         4     Objective variables      4
 Total constraints           5     Total variables          4
1
 

 
 The user has defined      20   out of      20   first  derivatives

 Cheap test of user-supplied problem derivatives...

 XXX  The constraint gradients seem to be incorrect.

 -->  The largest discrepancy was    9.08E-01  in constraint     8
 

 The objective  gradients seem to be OK.

 Gradient projected in one direction   0.00000000000E+00
 Difference approximation              0.00000000000E+00
1
 
 

   Itns Major Minors    Step   nCon Feasible  Optimal  MeritFunction     L+U BSwap     nS  condHz Penalty
      0     0      0              1 (0.0E+00)(0.0E+00) 0.0000000E+00       5                              _  r
1
 
 SNOPTA EXIT   0 -- finished successfully
 SNOPTA INFO   1 -- optimality conditions satisfied

 Problem name                 Default
 No. of iterations                   0   Objective value      0.0000000000E+00
 No. of major iterations             0   Linear objective     0.0000000000E+00
 Penalty parameter           0.000E+00   Nonlinear objective  0.0000000000E+00
 No. of calls to funobj              2   No. of calls to funcon              2
 No. of degenerate steps             0   Percentage                        .00
 Max x                       2 6.3E+01   Max pi                      5 1.0E+00
 Max Primal infeas           0 0.0E+00   Max Dual infeas             0 0.0E+00
 Nonlinear constraint violn    0.0E+00
1
 
 Name           Default                  Objective Value      0.0000000000E+00

 Status         Optimal Soln             Iteration      0    Superbasics     0

 Objective               (Min)
 RHS
 Ranges
 Bounds

 Section 1 - Rows

  Number  ...Row.. State  ...Activity...  Slack Activity  ..Lower Limit.  ..Upper Limit.  .Dual Activity    ..i
 
       5  r      1    BS          .               .                None            None         -1.0          1
       6  r      2 D  BS          .               .               .               .               .           2
       7  r      3 D  BS          .               .               .               .               .           3
       8  r      4 D  BS          .               .               .               .               .           4
       9  r      5 D  BS          .               .               .               .               .           5
1
 
 Section 2 - Columns

  Number  .Column. State  ...Activity...  .Obj Gradient.  ..Lower Limit.  ..Upper Limit.  Reduced Gradnt    m+j
 
       1  x      1 A  FR          .19000          .               .07700          .24000          .           6
       2  x      2 A  UL        63.00000          .             20.00000        63.00000          .           7
       3  x      3 A  FR          .52000          .               .22000          .67000          .           8
       4  x      4 A  FR        42.00000          .             30.00000        90.00000          .           9
1
 
 SNMEMA EXIT 100 -- finished successfully
 SNMEMA INFO 104 -- memory requirements estimated

         ==============================
         S N O P T  7.2-11   (Jan 2011)
         ==============================
1
 
 Parameters
 ==========

 Files
 -----
 Solution file..........         0       Old basis file ........         0       Standard input.........         5
 Insert file............         0       New basis file ........         0       (Printer)..............         9
 Punch file.............         0       Backup basis file......         0       (Specs file)...........         0
 Load file..............         0       Dump file..............         0       Standard output........         6

 Frequencies
 -----------
 Print frequency........       100       Check frequency........        60       Save new basis map.....       100
 Summary frequency......       100       Factorization frequency        50       Expand frequency.......     10000

 QP subproblems
 --------------
 QPsolver Cholesky......
 Scale tolerance........      .900       Minor feasibility tol..  1.00E-06       Iteration limit........       200
 Scale option...........         0       Minor optimality  tol..  1.00E-06       Minor print level......         1
 Crash tolerance........      .100       Pivot tolerance........  3.25E-11       Partial price..........         1
 Crash option...........         3       Elastic weight.........  1.00E+04       Prtl price section ( A)         4
                                         New superbasics........        99       Prtl price section (-I)         5

 The SQP Method
 --------------
 Minimize...............                 Cold start.............                 Proximal Point method..         1
 Nonlinear objectiv vars         4       Objective Row..........         1       Function precision.....  1.00E-06
 Unbounded step size....  1.00E+20       Superbasics limit......         4       Difference interval....  1.00E-03
 Unbounded objective....  1.00E+15       Reduced Hessian dim....         4       Central difference int.  1.00E-02
 Major step limit.......  2.00E+00       Derivative linesearch..                 Derivative option......         1
 Major iterations limit.      1000       Linesearch tolerance...    .90000       Verify level...........         0
 Minor iterations limit.       500       Penalty parameter......  0.00E+00       Major Print Level......         1
                                         Major optimality tol...  3.16E-03

 Hessian Approximation
 ---------------------
 Full-Memory Hessian....                 Hessian updates........  99999999       Hessian frequency......  99999999
                                                                                 Hessian flush..........  99999999

 Nonlinear constraints
 ---------------------
 Nonlinear constraints..         4       Major feasibility tol..  1.00E-06       Violation limit........  1.00E+06
 Nonlinear Jacobian vars         4

 Miscellaneous
 -------------
 LU factor tolerance....      3.99       LU singularity tol.....  3.25E-11       Timing level...........         0
 LU update tolerance....      3.99       LU swap tolerance......  1.22E-04       Debug level............         0
 LU partial  pivoting...                 eps (machine precision)  2.22E-16       System information.....        No
                                                                                 Sticky parameters......        No
1
 

 

 Matrix statistics
 -----------------
               Total      Normal        Free       Fixed     Bounded
 Rows              5           0           1           4           0
 Columns           4           0           0           0           4

 No. of matrix elements                   16     Density      80.000
 Biggest  constant element        0.0000E+00  (excluding fixed columns,
 Smallest constant element        0.0000E+00   free rows, and RHS)

 No. of objective coefficients             0

 Nonlinear constraints       4     Linear constraints       1
 Nonlinear variables         4     Linear variables         0
 Jacobian  variables         4     Objective variables      4
 Total constraints           5     Total variables          4
1
 

 
 The user has defined      20   out of      20   first  derivatives

 Cheap test of user-supplied problem derivatives...

 The constraint gradients seem to be OK.

 -->  The largest discrepancy was    5.63E-02  in constraint     8
 

 The objective  gradients seem to be OK.

 Gradient projected in one direction   0.00000000000E+00
 Difference approximation              0.00000000000E+00
1
 
 

   Itns Major Minors    Step   nCon Feasible  Optimal  MeritFunction     L+U BSwap     nS  condHz Penalty
      1     0      1              1  5.4E-02 (1.6E-03) 0.0000000E+00       5            1 1.0E+00         _  r
      1     1      0 1.0E+00      2 (0.0E+00)(0.0E+00) 0.0000000E+00       5            1 1.0E+00 1.4E-04 _n r
1
 
 SNOPTA EXIT   0 -- finished successfully
 SNOPTA INFO   1 -- optimality conditions satisfied

 Problem name                 Default
 No. of iterations                   1   Objective value      0.0000000000E+00
 No. of major iterations             1   Linear objective     0.0000000000E+00
 Penalty parameter           1.371E-04   Nonlinear objective  0.0000000000E+00
 No. of calls to funobj              3   No. of calls to funcon              3
 No. of superbasics                  1   No. of basic nonlinears             0
 No. of degenerate steps             0   Percentage                        .00
 Max x                       2 6.3E+01   Max pi                      5 1.0E+00
 Max Primal infeas           0 0.0E+00   Max Dual infeas             0 0.0E+00
 Nonlinear constraint violn    0.0E+00
1
 
 Name           Default                  Objective Value      0.0000000000E+00

 Status         Optimal Soln             Iteration      1    Superbasics     1

 Objective               (Min)
 RHS
 Ranges
 Bounds

 Section 1 - Rows

  Number  ...Row.. State  ...Activity...  Slack Activity  ..Lower Limit.  ..Upper Limit.  .Dual Activity    ..i
 
       5  r      1    BS          .               .                None            None         -1.0          1
       6  r      2 D  BS          .               .               .               .               .           2
       7  r      3 D  BS          .               .               .               .               .           3
       8  r      4 D  BS          .               .               .               .               .           4
       9  r      5 D  BS          .               .               .               .               .           5
1
 
 Section 2 - Columns

  Number  .Column. State  ...Activity...  .Obj Gradient.  ..Lower Limit.  ..Upper Limit.  Reduced Gradnt    m+j
 
       1  x      1 A  FR          .16198          .               .07700          .24000          .           6
       2  x      2 A  UL        63.00000          .             20.00000        63.00000          .           7
       3  x      3   SBS          .52024          .               .22000          .67000          .           8
       4  x      4 A  FR        42.00000          .             30.00000        90.00000          .           9
1
 
 SNMEMA EXIT 100 -- finished successfully
 SNMEMA INFO 104 -- memory requirements estimated

         ==============================
         S N O P T  7.2-11   (Jan 2011)
         ==============================
1
 
 Parameters
 ==========

 Files
 -----
 Solution file..........         0       Old basis file ........         0       Standard input.........         5
 Insert file............         0       New basis file ........         0       (Printer)..............         9
 Punch file.............         0       Backup basis file......         0       (Specs file)...........         0
 Load file..............         0       Dump file..............         0       Standard output........         6

 Frequencies
 -----------
 Print frequency........       100       Check frequency........        60       Save new basis map.....       100
 Summary frequency......       100       Factorization frequency        50       Expand frequency.......     10000

 QP subproblems
 --------------
 QPsolver Cholesky......
 Scale tolerance........      .900       Minor feasibility tol..  1.00E-06       Iteration limit........       200
 Scale option...........         0       Minor optimality  tol..  1.00E-06       Minor print level......         1
 Crash tolerance........      .100       Pivot tolerance........  3.25E-11       Partial price..........         1
 Crash option...........         3       Elastic weight.........  1.00E+04       Prtl price section ( A)         4
                                         New superbasics........        99       Prtl price section (-I)         5

 The SQP Method
 --------------
 Minimize...............                 Cold start.............                 Proximal Point method..         1
 Nonlinear objectiv vars         4       Objective Row..........         1       Function precision.....  1.00E-06
 Unbounded step size....  1.00E+20       Superbasics limit......         4       Difference interval....  1.00E-03
 Unbounded objective....  1.00E+15       Reduced Hessian dim....         4       Central difference int.  1.00E-02
 Major step limit.......  2.00E+00       Derivative linesearch..                 Derivative option......         1
 Major iterations limit.      1000       Linesearch tolerance...    .90000       Verify level...........         0
 Minor iterations limit.       500       Penalty parameter......  0.00E+00       Major Print Level......         1
                                         Major optimality tol...  3.16E-03

 Hessian Approximation
 ---------------------
 Full-Memory Hessian....                 Hessian updates........  99999999       Hessian frequency......  99999999
                                                                                 Hessian flush..........  99999999

 Nonlinear constraints
 ---------------------
 Nonlinear constraints..         4       Major feasibility tol..  1.00E-06       Violation limit........  1.00E+06
 Nonlinear Jacobian vars         4

 Miscellaneous
 -------------
 LU factor tolerance....      3.99       LU singularity tol.....  3.25E-11       Timing level...........         3
 LU update tolerance....      3.99       LU swap tolerance......  1.22E-04       Debug level............         0
 LU partial  pivoting...                 eps (machine precision)  2.22E-16       System information.....        No
                                                                                 Sticky parameters......        No
1
 

 

 Matrix statistics
 -----------------
               Total      Normal        Free       Fixed     Bounded
 Rows              5           0           1           4           0
 Columns           4           0           0           0           4

 No. of matrix elements                   16     Density      80.000
 Biggest  constant element        0.0000E+00  (excluding fixed columns,
 Smallest constant element        0.0000E+00   free rows, and RHS)

 No. of objective coefficients             0

 Nonlinear constraints       4     Linear constraints       1
 Nonlinear variables         4     Linear variables         0
 Jacobian  variables         4     Objective variables      4
 Total constraints           5     Total variables          4
1
 

 
 The user has defined      20   out of      20   first  derivatives

 Cheap test of user-supplied problem derivatives...

 The constraint gradients seem to be OK.

 -->  The largest discrepancy was    5.63E-02  in constraint     8
 

 The objective  gradients seem to be OK.

 Gradient projected in one direction   0.00000000000E+00
 Difference approximation              0.00000000000E+00
1
 
 

   Itns Major Minors    Step   nCon Feasible  Optimal  MeritFunction     L+U BSwap     nS  condHz Penalty
      1     0      1              1  5.4E-02 (1.6E-03) 0.0000000E+00       5            1 1.0E+00         _  r
      1     1      0 1.0E+00      2 (0.0E+00)(0.0E+00) 0.0000000E+00       5            1 1.0E+00 1.4E-04 _n r
1
 
 SNOPTA EXIT   0 -- finished successfully
 SNOPTA INFO   1 -- optimality conditions satisfied

 Problem name                 Default
 No. of iterations                   1   Objective value      0.0000000000E+00
 No. of major iterations             1   Linear objective     0.0000000000E+00
 Penalty parameter           1.371E-04   Nonlinear objective  0.0000000000E+00
 No. of calls to funobj              3   No. of calls to funcon              3
 No. of superbasics                  1   No. of basic nonlinears             0
 No. of degenerate steps             0   Percentage                        .00
 Max x                       2 6.3E+01   Max pi                      5 1.0E+00
 Max Primal infeas           0 0.0E+00   Max Dual infeas             0 0.0E+00
 Nonlinear constraint violn    0.0E+00
1
 
 Name           Default                  Objective Value      0.0000000000E+00

 Status         Optimal Soln             Iteration      1    Superbasics     1

 Objective               (Min)
 RHS
 Ranges
 Bounds

 Section 1 - Rows

  Number  ...Row.. State  ...Activity...  Slack Activity  ..Lower Limit.  ..Upper Limit.  .Dual Activity    ..i
 
       5  r      1    BS          .               .                None            None         -1.0          1
       6  r      2 D  BS          .               .               .               .               .           2
       7  r      3 D  BS          .               .               .               .               .           3
       8  r      4 D  BS          .               .               .               .               .           4
       9  r      5 D  BS          .               .               .               .               .           5
1
 
 Section 2 - Columns

  Number  .Column. State  ...Activity...  .Obj Gradient.  ..Lower Limit.  ..Upper Limit.  Reduced Gradnt    m+j
 
       1  x      1 A  FR          .16198          .               .07700          .24000          .           6
       2  x      2 A  UL        63.00000          .             20.00000        63.00000          .           7
       3  x      3   SBS          .52024          .               .22000          .67000          .           8
       4  x      4 A  FR        42.00000          .             30.00000        90.00000          .           9
 
 Time for MPS input                              .00 seconds
 Time for solving problem              ************* seconds
 Time for solution output                        .00 seconds
 Time for constraint functions         ************* seconds
 Time for objective function                     .00 seconds
1
 
 SNMEMA EXIT 100 -- finished successfully
 SNMEMA INFO 104 -- memory requirements estimated

         ==============================
         S N O P T  7.2-11   (Jan 2011)
         ==============================
1
 
 Parameters
 ==========

 Files
 -----
 Solution file..........         0       Old basis file ........         0       Standard input.........         5
 Insert file............         0       New basis file ........         0       (Printer)..............         9
 Punch file.............         0       Backup basis file......         0       (Specs file)...........         0
 Load file..............         0       Dump file..............         0       Standard output........         6

 Frequencies
 -----------
 Print frequency........       100       Check frequency........        60       Save new basis map.....       100
 Summary frequency......       100       Factorization frequency        50       Expand frequency.......     10000

 QP subproblems
 --------------
 QPsolver Cholesky......
 Scale tolerance........      .900       Minor feasibility tol..  1.00E-06       Iteration limit........       200
 Scale option...........         0       Minor optimality  tol..  1.00E-06       Minor print level......         1
 Crash tolerance........      .100       Pivot tolerance........  3.25E-11       Partial price..........         1
 Crash option...........         3       Elastic weight.........  1.00E+04       Prtl price section ( A)         4
                                         New superbasics........        99       Prtl price section (-I)         5

 The SQP Method
 --------------
 Minimize...............                 Cold start.............                 Proximal Point method..         1
 Nonlinear objectiv vars         4       Objective Row..........         1       Function precision.....  1.00E-05
 Unbounded step size....  1.00E+20       Superbasics limit......         4       Difference interval....  3.16E-03
 Unbounded objective....  1.00E+15       Reduced Hessian dim....         4       Central difference int.  2.15E-02
 Major step limit.......  2.00E+00       Derivative linesearch..                 Derivative option......         1
 Major iterations limit.      1000       Linesearch tolerance...    .90000       Verify level...........         0
 Minor iterations limit.       500       Penalty parameter......  0.00E+00       Major Print Level......         1
                                         Major optimality tol...  1.00E-02

 Hessian Approximation
 ---------------------
 Full-Memory Hessian....                 Hessian updates........  99999999       Hessian frequency......  99999999
                                                                                 Hessian flush..........  99999999

 Nonlinear constraints
 ---------------------
 Nonlinear constraints..         4       Major feasibility tol..  1.00E-06       Violation limit........  1.00E+06
 Nonlinear Jacobian vars         4

 Miscellaneous
 -------------
 LU factor tolerance....      3.99       LU singularity tol.....  3.25E-11       Timing level...........         0
 LU update tolerance....      3.99       LU swap tolerance......  1.22E-04       Debug level............         0
 LU partial  pivoting...                 eps (machine precision)  2.22E-16       System information.....        No
                                                                                 Sticky parameters......        No
1
 

 

 Matrix statistics
 -----------------
               Total      Normal        Free       Fixed     Bounded
 Rows              5           0           1           4           0
 Columns           4           0           0           0           4

 No. of matrix elements                   16     Density      80.000
 Biggest  constant element        0.0000E+00  (excluding fixed columns,
 Smallest constant element        0.0000E+00   free rows, and RHS)

 No. of objective coefficients             0

 Nonlinear constraints       4     Linear constraints       1
 Nonlinear variables         4     Linear variables         0
 Jacobian  variables         4     Objective variables      4
 Total constraints           5     Total variables          4
1
 

 
 The user has defined      20   out of      20   first  derivatives

 Cheap test of user-supplied problem derivatives...

 XXX  The constraint gradients seem to be incorrect.

 -->  The largest discrepancy was    9.64E-01  in constraint     7
 

 The objective  gradients seem to be OK.

 Gradient projected in one direction   0.00000000000E+00
 Difference approximation              0.00000000000E+00
1
 
 

   Itns Major Minors    Step   nCon Feasible  Optimal  MeritFunction     L+U BSwap     nS  condHz Penalty
      1     0      1              1  5.4E-02 (1.6E-03) 0.0000000E+00       5            1 1.0E+00         _  r
      1     1      0 1.0E+00      2 (0.0E+00)(0.0E+00) 0.0000000E+00       5            1 1.0E+00 1.4E-04 _n r
1
 
 SNOPTA EXIT   0 -- finished successfully
 SNOPTA INFO   1 -- optimality conditions satisfied

 Problem name                 Default
 No. of iterations                   1   Objective value      0.0000000000E+00
 No. of major iterations             1   Linear objective     0.0000000000E+00
 Penalty parameter           1.371E-04   Nonlinear objective  0.0000000000E+00
 No. of calls to funobj              3   No. of calls to funcon              3
 No. of superbasics                  1   No. of basic nonlinears             0
 No. of degenerate steps             0   Percentage                        .00
 Max x                       2 6.3E+01   Max pi                      5 1.0E+00
 Max Primal infeas           0 0.0E+00   Max Dual infeas             0 0.0E+00
 Nonlinear constraint violn    0.0E+00
1
 
 Name           Default                  Objective Value      0.0000000000E+00

 Status         Optimal Soln             Iteration      1    Superbasics     1

 Objective               (Min)
 RHS
 Ranges
 Bounds

 Section 1 - Rows

  Number  ...Row.. State  ...Activity...  Slack Activity  ..Lower Limit.  ..Upper Limit.  .Dual Activity    ..i
 
       5  r      1    BS          .               .                None            None         -1.0          1
       6  r      2 D  BS          .               .               .               .               .           2
       7  r      3 D  BS          .               .               .               .               .           3
       8  r      4 D  BS          .               .               .               .               .           4
       9  r      5 D  BS          .               .               .               .               .           5
1
 
 Section 2 - Columns

  Number  .Column. State  ...Activity...  .Obj Gradient.  ..Lower Limit.  ..Upper Limit.  Reduced Gradnt    m+j
 
       1  x      1 A  FR          .16198          .               .07700          .24000          .           6
       2  x      2 A  UL        63.00000          .             20.00000        63.00000          .           7
       3  x      3   SBS          .52024          .               .22000          .67000          .           8
       4  x      4 A  FR        42.00000          .             30.00000        90.00000          .           9
1
 
 SNMEMA EXIT 100 -- finished successfully
 SNMEMA INFO 104 -- memory requirements estimated

         ==============================
         S N O P T  7.2-11   (Jan 2011)
         ==============================
1
 
 Parameters
 ==========

 Files
 -----
 Solution file..........         0       Old basis file ........         0       Standard input.........         5
 Insert file............         0       New basis file ........         0       (Printer)..............         9
 Punch file.............         0       Backup basis file......         0       (Specs file)...........         0
 Load file..............         0       Dump file..............         0       Standard output........         6

 Frequencies
 -----------
 Print frequency........       100       Check frequency........        60       Save new basis map.....       100
 Summary frequency......       100       Factorization frequency        50       Expand frequency.......     10000

 QP subproblems
 --------------
 QPsolver Cholesky......
 Scale tolerance........      .900       Minor feasibility tol..  1.00E-06       Iteration limit........       200
 Scale option...........         0       Minor optimality  tol..  1.00E-06       Minor print level......         1
 Crash tolerance........      .100       Pivot tolerance........  3.25E-11       Partial price..........         1
 Crash option...........         3       Elastic weight.........  1.00E+04       Prtl price section ( A)         4
                                         New superbasics........        99       Prtl price section (-I)         5

 The SQP Method
 --------------
 Minimize...............                 Cold start.............                 Proximal Point method..         1
 Nonlinear objectiv vars         4       Objective Row..........         1       Function precision.....  1.00E-05
 Unbounded step size....  1.00E+20       Superbasics limit......         4       Difference interval....  3.16E-03
 Unbounded objective....  1.00E+15       Reduced Hessian dim....         4       Central difference int.  2.15E-02
 Major step limit.......  2.00E+00       Derivative linesearch..                 Derivative option......         1
 Major iterations limit.      1000       Linesearch tolerance...    .90000       Verify level...........         0
 Minor iterations limit.       500       Penalty parameter......  0.00E+00       Major Print Level......         1
                                         Major optimality tol...  1.00E-02

 Hessian Approximation
 ---------------------
 Full-Memory Hessian....                 Hessian updates........  99999999       Hessian frequency......  99999999
                                                                                 Hessian flush..........  99999999

 Nonlinear constraints
 ---------------------
 Nonlinear constraints..         4       Major feasibility tol..  1.00E-06       Violation limit........  1.00E+06
 Nonlinear Jacobian vars         4

 Miscellaneous
 -------------
 LU factor tolerance....      3.99       LU singularity tol.....  3.25E-11       Timing level...........         0
 LU update tolerance....      3.99       LU swap tolerance......  1.22E-04       Debug level............         0
 LU partial  pivoting...                 eps (machine precision)  2.22E-16       System information.....        No
                                                                                 Sticky parameters......        No
1
 

 

 Matrix statistics
 -----------------
               Total      Normal        Free       Fixed     Bounded
 Rows              5           0           1           4           0
 Columns           4           0           0           0           4

 No. of matrix elements                   16     Density      80.000
 Biggest  constant element        0.0000E+00  (excluding fixed columns,
 Smallest constant element        0.0000E+00   free rows, and RHS)

 No. of objective coefficients             0

 Nonlinear constraints       4     Linear constraints       1
 Nonlinear variables         4     Linear variables         0
 Jacobian  variables         4     Objective variables      4
 Total constraints           5     Total variables          4
1
 

 
 The user has defined      20   out of      20   first  derivatives

 Cheap test of user-supplied problem derivatives...

 XXX  The constraint gradients seem to be incorrect.

 -->  The largest discrepancy was    9.64E-01  in constraint     7
 

 The objective  gradients seem to be OK.

 Gradient projected in one direction   0.00000000000E+00
 Difference approximation              0.00000000000E+00
1
 
 

   Itns Major Minors    Step   nCon Feasible  Optimal  MeritFunction     L+U BSwap     nS  condHz Penalty
      0     0      0              1 (0.0E+00)(0.0E+00) 0.0000000E+00       5                              _  r
1
 
 SNOPTA EXIT   0 -- finished successfully
 SNOPTA INFO   1 -- optimality conditions satisfied

 Problem name                 Default
 No. of iterations                   0   Objective value      0.0000000000E+00
 No. of major iterations             0   Linear objective     0.0000000000E+00
 Penalty parameter           0.000E+00   Nonlinear objective  0.0000000000E+00
 No. of calls to funobj              2   No. of calls to funcon              2
 No. of degenerate steps             0   Percentage                        .00
 Max x                       2 6.3E+01   Max pi                      5 1.0E+00
 Max Primal infeas           0 0.0E+00   Max Dual infeas             0 0.0E+00
 Nonlinear constraint violn    0.0E+00
1
 
 Name           Default                  Objective Value      0.0000000000E+00

 Status         Optimal Soln             Iteration      0    Superbasics     0

 Objective               (Min)
 RHS
 Ranges
 Bounds

 Section 1 - Rows

  Number  ...Row.. State  ...Activity...  Slack Activity  ..Lower Limit.  ..Upper Limit.  .Dual Activity    ..i
 
       5  r      1    BS          .               .                None            None         -1.0          1
       6  r      2 D  BS          .               .               .               .               .           2
       7  r      3 D  BS          .               .               .               .               .           3
       8  r      4 D  BS          .               .               .               .               .           4
       9  r      5 D  BS          .               .               .               .               .           5
1
 
 Section 2 - Columns

  Number  .Column. State  ...Activity...  .Obj Gradient.  ..Lower Limit.  ..Upper Limit.  Reduced Gradnt    m+j
 
       1  x      1 A  FR          .19000          .               .07700          .24000          .           6
       2  x      2 A  UL        63.00000          .             20.00000        63.00000          .           7
       3  x      3 A  FR          .52000          .               .22000          .67000          .           8
       4  x      4 A  FR        42.00000          .             30.00000        90.00000          .           9
1
 
 SNMEMA EXIT 100 -- finished successfully
 SNMEMA INFO 104 -- memory requirements estimated

         ==============================
         S N O P T  7.2-11   (Jan 2011)
         ==============================
1
 
 Parameters
 ==========

 Files
 -----
 Solution file..........         0       Old basis file ........         0       Standard input.........         5
 Insert file............         0       New basis file ........         0       (Printer)..............         9
 Punch file.............         0       Backup basis file......         0       (Specs file)...........         0
 Load file..............         0       Dump file..............         0       Standard output........         6

 Frequencies
 -----------
 Print frequency........       100       Check frequency........        60       Save new basis map.....       100
 Summary frequency......       100       Factorization frequency        50       Expand frequency.......     10000

 QP subproblems
 --------------
 QPsolver Cholesky......
 Scale tolerance........      .900       Minor feasibility tol..  1.00E-06       Iteration limit........       200
 Scale option...........         0       Minor optimality  tol..  1.00E-06       Minor print level......         1
 Crash tolerance........      .100       Pivot tolerance........  3.25E-11       Partial price..........         1
 Crash option...........         3       Elastic weight.........  1.00E+04       Prtl price section ( A)         4
                                         New superbasics........        99       Prtl price section (-I)         5

 The SQP Method
 --------------
 Minimize...............                 Cold start.............                 Proximal Point method..         1
 Nonlinear objectiv vars         4       Objective Row..........         1       Function precision.....  1.00E-05
 Unbounded step size....  1.00E+20       Superbasics limit......         4       Difference interval....  3.16E-03
 Unbounded objective....  1.00E+15       Reduced Hessian dim....         4       Central difference int.  2.15E-02
 Major step limit.......  2.00E+00       Derivative linesearch..                 Derivative option......         1
 Major iterations limit.      1000       Linesearch tolerance...    .90000       Verify level...........         0
 Minor iterations limit.       500       Penalty parameter......  0.00E+00       Major Print Level......         1
                                         Major optimality tol...  1.00E-02

 Hessian Approximation
 ---------------------
 Full-Memory Hessian....                 Hessian updates........  99999999       Hessian frequency......  99999999
                                                                                 Hessian flush..........  99999999

 Nonlinear constraints
 ---------------------
 Nonlinear constraints..         4       Major feasibility tol..  1.00E-06       Violation limit........  1.00E+06
 Nonlinear Jacobian vars         4

 Miscellaneous
 -------------
 LU factor tolerance....      3.99       LU singularity tol.....  3.25E-11       Timing level...........         0
 LU update tolerance....      3.99       LU swap tolerance......  1.22E-04       Debug level............         0
 LU partial  pivoting...                 eps (machine precision)  2.22E-16       System information.....        No
                                                                                 Sticky parameters......        No
1
 

 

 Matrix statistics
 -----------------
               Total      Normal        Free       Fixed     Bounded
 Rows              5           0           1           4           0
 Columns           4           0           0           0           4

 No. of matrix elements                   16     Density      80.000
 Biggest  constant element        0.0000E+00  (excluding fixed columns,
 Smallest constant element        0.0000E+00   free rows, and RHS)

 No. of objective coefficients             0

 Nonlinear constraints       4     Linear constraints       1
 Nonlinear variables         4     Linear variables         0
 Jacobian  variables         4     Objective variables      4
 Total constraints           5     Total variables          4
1
 

 
 The user has defined      20   out of      20   first  derivatives

 Cheap test of user-supplied problem derivatives...

 XXX  The constraint gradients seem to be incorrect.

 -->  The largest discrepancy was    9.95E-01  in constraint     7
 

 The objective  gradients seem to be OK.

 Gradient projected in one direction   0.00000000000E+00
 Difference approximation              0.00000000000E+00
1
 
 

   Itns Major Minors    Step   nCon Feasible  Optimal  MeritFunction     L+U BSwap     nS  condHz Penalty
      1     0      1              1  3.8E-02 (1.6E-03) 0.0000000E+00       5            1 1.0E+00         _  r
      1     1      0 1.0E+00      2 (0.0E+00)(0.0E+00) 0.0000000E+00       5            1 1.0E+00 1.4E-04 _n r
1
 
 SNOPTA EXIT   0 -- finished successfully
 SNOPTA INFO   1 -- optimality conditions satisfied

 Problem name                 Default
 No. of iterations                   1   Objective value      0.0000000000E+00
 No. of major iterations             1   Linear objective     0.0000000000E+00
 Penalty parameter           1.365E-04   Nonlinear objective  0.0000000000E+00
 No. of calls to funobj              3   No. of calls to funcon              3
 No. of superbasics                  1   No. of basic nonlinears             0
 No. of degenerate steps             0   Percentage                        .00
 Max x                       4 9.0E+01   Max pi                      5 1.0E+00
 Max Primal infeas           0 0.0E+00   Max Dual infeas             0 0.0E+00
 Nonlinear constraint violn    0.0E+00
1
 
 Name           Default                  Objective Value      0.0000000000E+00

 Status         Optimal Soln             Iteration      1    Superbasics     1

 Objective               (Min)
 RHS
 Ranges
 Bounds

 Section 1 - Rows

  Number  ...Row.. State  ...Activity...  Slack Activity  ..Lower Limit.  ..Upper Limit.  .Dual Activity    ..i
 
       5  r      1    BS          .               .                None            None         -1.0          1
       6  r      2 D  BS          .               .               .               .               .           2
       7  r      3 D  BS          .               .               .               .               .           3
       8  r      4 D  BS          .               .               .               .               .           4
       9  r      5 D  BS          .               .               .               .               .           5
1
 
 Section 2 - Columns

  Number  .Column. State  ...Activity...  .Obj Gradient.  ..Lower Limit.  ..Upper Limit.  Reduced Gradnt    m+j
 
       1  x      1 A  FR          .16205          .               .07700          .24000          .           6
       2  x      2 A  UL        63.00000          .             20.00000        63.00000          .           7
       3  x      3   SBS          .52024          .               .22000          .67000          .           8
       4  x      4 A  UL        90.00000          .             30.00000        90.00000          .           9
1
 
 SNMEMA EXIT 100 -- finished successfully
 SNMEMA INFO 104 -- memory requirements estimated

         ==============================
         S N O P T  7.2-11   (Jan 2011)
         ==============================
1
 
 Parameters
 ==========

 Files
 -----
 Solution file..........         0       Old basis file ........         0       Standard input.........         5
 Insert file............         0       New basis file ........         0       (Printer)..............         9
 Punch file.............         0       Backup basis file......         0       (Specs file)...........         0
 Load file..............         0       Dump file..............         0       Standard output........         6

 Frequencies
 -----------
 Print frequency........       100       Check frequency........        60       Save new basis map.....       100
 Summary frequency......       100       Factorization frequency        50       Expand frequency.......     10000

 QP subproblems
 --------------
 QPsolver Cholesky......
 Scale tolerance........      .900       Minor feasibility tol..  1.00E-06       Iteration limit........       200
 Scale option...........         0       Minor optimality  tol..  1.00E-06       Minor print level......         1
 Crash tolerance........      .100       Pivot tolerance........  3.25E-11       Partial price..........         1
 Crash option...........         3       Elastic weight.........  1.00E+04       Prtl price section ( A)         4
                                         New superbasics........        99       Prtl price section (-I)         5

 The SQP Method
 --------------
 Minimize...............                 Cold start.............                 Proximal Point method..         1
 Nonlinear objectiv vars         4       Objective Row..........         1       Function precision.....  1.00E-05
 Unbounded step size....  1.00E+20       Superbasics limit......         4       Difference interval....  3.16E-03
 Unbounded objective....  1.00E+15       Reduced Hessian dim....         4       Central difference int.  2.15E-02
 Major step limit.......  2.00E+00       Derivative linesearch..                 Derivative option......         1
 Major iterations limit.      1000       Linesearch tolerance...    .90000       Verify level...........         0
 Minor iterations limit.       500       Penalty parameter......  0.00E+00       Major Print Level......         1
                                         Major optimality tol...  1.00E-02

 Hessian Approximation
 ---------------------
 Full-Memory Hessian....                 Hessian updates........  99999999       Hessian frequency......  99999999
                                                                                 Hessian flush..........  99999999

 Nonlinear constraints
 ---------------------
 Nonlinear constraints..         4       Major feasibility tol..  1.00E-06       Violation limit........  1.00E+06
 Nonlinear Jacobian vars         4

 Miscellaneous
 -------------
 LU factor tolerance....      3.99       LU singularity tol.....  3.25E-11       Timing level...........         0
 LU update tolerance....      3.99       LU swap tolerance......  1.22E-04       Debug level............         0
 LU partial  pivoting...                 eps (machine precision)  2.22E-16       System information.....        No
                                                                                 Sticky parameters......        No
1
 

 

 Matrix statistics
 -----------------
               Total      Normal        Free       Fixed     Bounded
 Rows              5           0           1           4           0
 Columns           4           0           0           0           4

 No. of matrix elements                   16     Density      80.000
 Biggest  constant element        0.0000E+00  (excluding fixed columns,
 Smallest constant element        0.0000E+00   free rows, and RHS)

 No. of objective coefficients             0

 Nonlinear constraints       4     Linear constraints       1
 Nonlinear variables         4     Linear variables         0
 Jacobian  variables         4     Objective variables      4
 Total constraints           5     Total variables          4
1
 

 
 The user has defined      20   out of      20   first  derivatives

 Cheap test of user-supplied problem derivatives...

 XXX  The constraint gradients seem to be incorrect.

 -->  The largest discrepancy was    9.94E-01  in constraint     7
 

 The objective  gradients seem to be OK.

 Gradient projected in one direction   0.00000000000E+00
 Difference approximation              0.00000000000E+00
1
 
 

   Itns Major Minors    Step   nCon Feasible  Optimal  MeritFunction     L+U BSwap     nS  condHz Penalty
      1     0      1              1  3.9E-02 (1.6E-03) 0.0000000E+00       5            1 1.0E+00         _  r
      1     1      0 1.0E+00      2 (0.0E+00)(0.0E+00) 0.0000000E+00       5            1 1.0E+00 1.4E-04 _n r
1
 
 SNOPTA EXIT   0 -- finished successfully
 SNOPTA INFO   1 -- optimality conditions satisfied

 Problem name                 Default
 No. of iterations                   1   Objective value      0.0000000000E+00
 No. of major iterations             1   Linear objective     0.0000000000E+00
 Penalty parameter           1.358E-04   Nonlinear objective  0.0000000000E+00
 No. of calls to funobj              3   No. of calls to funcon              3
 No. of superbasics                  1   No. of basic nonlinears             0
 No. of degenerate steps             0   Percentage                        .00
 Max x                       4 8.5E+01   Max pi                      5 1.0E+00
 Max Primal infeas           0 0.0E+00   Max Dual infeas             0 0.0E+00
 Nonlinear constraint violn    0.0E+00
1
 
 Name           Default                  Objective Value      0.0000000000E+00

 Status         Optimal Soln             Iteration      1    Superbasics     1

 Objective               (Min)
 RHS
 Ranges
 Bounds

 Section 1 - Rows

  Number  ...Row.. State  ...Activity...  Slack Activity  ..Lower Limit.  ..Upper Limit.  .Dual Activity    ..i
 
       5  r      1    BS          .               .                None            None         -1.0          1
       6  r      2 D  BS          .               .               .               .               .           2
       7  r      3 D  BS          .               .               .               .               .           3
       8  r      4 D  BS          .               .               .               .               .           4
       9  r      5 D  BS          .               .               .               .               .           5
1
 
 Section 2 - Columns

  Number  .Column. State  ...Activity...  .Obj Gradient.  ..Lower Limit.  ..Upper Limit.  Reduced Gradnt    m+j
 
       1  x      1 A  FR          .16212          .               .07700          .24000          .           6
       2  x      2 A  UL        63.00000          .             20.00000        63.00000          .           7
       3  x      3   SBS          .52024          .               .22000          .67000          .           8
       4  x      4 A  FR        85.00000          .             30.00000        90.00000          .           9
1
 
 SNMEMA EXIT 100 -- finished successfully
 SNMEMA INFO 104 -- memory requirements estimated

         ==============================
         S N O P T  7.2-11   (Jan 2011)
         ==============================
1
 
 Parameters
 ==========

 Files
 -----
 Solution file..........         0       Old basis file ........         0       Standard input.........         5
 Insert file............         0       New basis file ........         0       (Printer)..............         9
 Punch file.............         0       Backup basis file......         0       (Specs file)...........         0
 Load file..............         0       Dump file..............         0       Standard output........         6

 Frequencies
 -----------
 Print frequency........       100       Check frequency........        60       Save new basis map.....       100
 Summary frequency......       100       Factorization frequency        50       Expand frequency.......     10000

 QP subproblems
 --------------
 QPsolver Cholesky......
 Scale tolerance........      .900       Minor feasibility tol..  1.00E-06       Iteration limit........       200
 Scale option...........         0       Minor optimality  tol..  1.00E-06       Minor print level......         1
 Crash tolerance........      .100       Pivot tolerance........  3.25E-11       Partial price..........         1
 Crash option...........         3       Elastic weight.........  1.00E+04       Prtl price section ( A)         4
                                         New superbasics........        99       Prtl price section (-I)         5

 The SQP Method
 --------------
 Minimize...............                 Cold start.............                 Proximal Point method..         1
 Nonlinear objectiv vars         4       Objective Row..........         1       Function precision.....  1.00E-05
 Unbounded step size....  1.00E+20       Superbasics limit......         4       Difference interval....  3.16E-03
 Unbounded objective....  1.00E+15       Reduced Hessian dim....         4       Central difference int.  2.15E-02
 Major step limit.......  2.00E+00       Derivative linesearch..                 Derivative option......         1
 Major iterations limit.      1000       Linesearch tolerance...    .90000       Verify level...........         0
 Minor iterations limit.       500       Penalty parameter......  0.00E+00       Major Print Level......         1
                                         Major optimality tol...  1.00E-02

 Hessian Approximation
 ---------------------
 Full-Memory Hessian....                 Hessian updates........  99999999       Hessian frequency......  99999999
                                                                                 Hessian flush..........  99999999

 Nonlinear constraints
 ---------------------
 Nonlinear constraints..         4       Major feasibility tol..  1.00E-06       Violation limit........  1.00E+06
 Nonlinear Jacobian vars         4

 Miscellaneous
 -------------
 LU factor tolerance....      3.99       LU singularity tol.....  3.25E-11       Timing level...........         3
 LU update tolerance....      3.99       LU swap tolerance......  1.22E-04       Debug level............         0
 LU partial  pivoting...                 eps (machine precision)  2.22E-16       System information.....        No
                                                                                 Sticky parameters......        No
1
 

 

 Matrix statistics
 -----------------
               Total      Normal        Free       Fixed     Bounded
 Rows              5           0           1           4           0
 Columns           4           0           0           0           4

 No. of matrix elements                   16     Density      80.000
 Biggest  constant element        0.0000E+00  (excluding fixed columns,
 Smallest constant element        0.0000E+00   free rows, and RHS)

 No. of objective coefficients             0

 Nonlinear constraints       4     Linear constraints       1
 Nonlinear variables         4     Linear variables         0
 Jacobian  variables         4     Objective variables      4
 Total constraints           5     Total variables          4
1
 

 
 The user has defined      20   out of      20   first  derivatives

 Cheap test of user-supplied problem derivatives...

 XXX  The constraint gradients seem to be incorrect.

 -->  The largest discrepancy was    9.64E-01  in constraint     7
 

 The objective  gradients seem to be OK.

 Gradient projected in one direction   0.00000000000E+00
 Difference approximation              0.00000000000E+00
1
 
 

   Itns Major Minors    Step   nCon Feasible  Optimal  MeritFunction     L+U BSwap     nS  condHz Penalty
      1     0      1              1  5.4E-02 (1.6E-03) 0.0000000E+00       5            1 1.0E+00         _  r
      1     1      0 1.0E+00      2 (0.0E+00)(0.0E+00) 0.0000000E+00       5            1 1.0E+00 1.4E-04 _n r
1
 
 SNOPTA EXIT   0 -- finished successfully
 SNOPTA INFO   1 -- optimality conditions satisfied

 Problem name                 Default
 No. of iterations                   1   Objective value      0.0000000000E+00
 No. of major iterations             1   Linear objective     0.0000000000E+00
 Penalty parameter           1.371E-04   Nonlinear objective  0.0000000000E+00
 No. of calls to funobj              3   No. of calls to funcon              3
 No. of superbasics                  1   No. of basic nonlinears             0
 No. of degenerate steps             0   Percentage                        .00
 Max x                       2 6.3E+01   Max pi                      5 1.0E+00
 Max Primal infeas           0 0.0E+00   Max Dual infeas             0 0.0E+00
 Nonlinear constraint violn    0.0E+00
1
 
 Name           Default                  Objective Value      0.0000000000E+00

 Status         Optimal Soln             Iteration      1    Superbasics     1

 Objective               (Min)
 RHS
 Ranges
 Bounds

 Section 1 - Rows

  Number  ...Row.. State  ...Activity...  Slack Activity  ..Lower Limit.  ..Upper Limit.  .Dual Activity    ..i
 
       5  r      1    BS          .               .                None            None         -1.0          1
       6  r      2 D  BS          .               .               .               .               .           2
       7  r      3 D  BS          .               .               .               .               .           3
       8  r      4 D  BS          .               .               .               .               .           4
       9  r      5 D  BS          .               .               .               .               .           5
1
 
 Section 2 - Columns

  Number  .Column. State  ...Activity...  .Obj Gradient.  ..Lower Limit.  ..Upper Limit.  Reduced Gradnt    m+j
 
       1  x      1 A  FR          .16198          .               .07700          .24000          .           6
       2  x      2 A  UL        63.00000          .             20.00000        63.00000          .           7
       3  x      3   SBS          .52024          .               .22000          .67000          .           8
       4  x      4 A  FR        42.00000          .             30.00000        90.00000          .           9
 
 Time for MPS input                              .00 seconds
 Time for solving problem                      -2.00 seconds
 Time for solution output                        .00 seconds
 Time for constraint functions                 -2.00 seconds
 Time for objective function                     .00 seconds
1
 
 SNMEMA EXIT 100 -- finished successfully
 SNMEMA INFO 104 -- memory requirements estimated

         ==============================
         S N O P T  7.2-11   (Jan 2011)
         ==============================
1
 
 Parameters
 ==========

 Files
 -----
 Solution file..........         0       Old basis file ........         0       Standard input.........         5
 Insert file............         0       New basis file ........         0       (Printer)..............         9
 Punch file.............         0       Backup basis file......         0       (Specs file)...........         0
 Load file..............         0       Dump file..............         0       Standard output........         6

 Frequencies
 -----------
 Print frequency........       100       Check frequency........        60       Save new basis map.....       100
 Summary frequency......       100       Factorization frequency        50       Expand frequency.......     10000

 QP subproblems
 --------------
 QPsolver Cholesky......
 Scale tolerance........      .900       Minor feasibility tol..  1.00E-06       Iteration limit........       200
 Scale option...........         0       Minor optimality  tol..  1.00E-06       Minor print level......         1
 Crash tolerance........      .100       Pivot tolerance........  3.25E-11       Partial price..........         1
 Crash option...........         3       Elastic weight.........  1.00E+04       Prtl price section ( A)         4
                                         New superbasics........        99       Prtl price section (-I)         5

 The SQP Method
 --------------
 Minimize...............                 Cold start.............                 Proximal Point method..         1
 Nonlinear objectiv vars         4       Objective Row..........         1       Function precision.....  1.00E-05
 Unbounded step size....  1.00E+20       Superbasics limit......         4       Difference interval....  3.16E-03
 Unbounded objective....  1.00E+15       Reduced Hessian dim....         4       Central difference int.  2.15E-02
 Major step limit.......  2.00E+00       Derivative linesearch..                 Derivative option......         1
 Major iterations limit.      1000       Linesearch tolerance...    .90000       Verify level...........         0
 Minor iterations limit.       500       Penalty parameter......  0.00E+00       Major Print Level......         1
                                         Major optimality tol...  1.00E-02

 Hessian Approximation
 ---------------------
 Full-Memory Hessian....                 Hessian updates........  99999999       Hessian frequency......  99999999
                                                                                 Hessian flush..........  99999999

 Nonlinear constraints
 ---------------------
 Nonlinear constraints..         4       Major feasibility tol..  1.00E-06       Violation limit........  1.00E+06
 Nonlinear Jacobian vars         4

 Miscellaneous
 -------------
 LU factor tolerance....      3.99       LU singularity tol.....  3.25E-11       Timing level...........         3
 LU update tolerance....      3.99       LU swap tolerance......  1.22E-04       Debug level............         0
 LU partial  pivoting...                 eps (machine precision)  2.22E-16       System information.....        No
                                                                                 Sticky parameters......        No
1
 

 

 Matrix statistics
 -----------------
               Total      Normal        Free       Fixed     Bounded
 Rows              5           0           1           4           0
 Columns           4           0           0           0           4

 No. of matrix elements                   16     Density      80.000
 Biggest  constant element        0.0000E+00  (excluding fixed columns,
 Smallest constant element        0.0000E+00   free rows, and RHS)

 No. of objective coefficients             0

 Nonlinear constraints       4     Linear constraints       1
 Nonlinear variables         4     Linear variables         0
 Jacobian  variables         4     Objective variables      4
 Total constraints           5     Total variables          4
1
 

 
 The user has defined      20   out of      20   first  derivatives

 Cheap test of user-supplied problem derivatives...

 XXX  The constraint gradients seem to be incorrect.

 -->  The largest discrepancy was    9.64E-01  in constraint     7
 

 XXX  The objective  gradients seem to be incorrect.

 Gradient projected in one direction  -1.19307538069E+02
 Difference approximation              3.11639076846E+02
1
 
 

   Itns Major Minors    Step   nCon Feasible  Optimal  MeritFunction     L+U BSwap     nS  condHz Penalty
      2     0      2              1  5.4E-02  7.5E-01  2.7221669E+01       5            2 1.0E+00         _  r
      4     1      2 1.0E+00      2 (0.0E+00) 7.6E+00  1.6595182E+01       5            2 1.0E+00         _n r
      7     2      3 1.0E-01      5 (0.0E+00) 2.8E+00  1.6125973E+01       5            3 1.7E+00         _s
      8     3      1 1.0E+00      6 (0.0E+00) 1.9E+00  1.5940729E+01       5            3 2.0E+00         _
      9     4      1 1.0E+00      7 (0.0E+00) 1.9E+00  1.5934048E+01       5            3 2.0E+00         _
     10     5      1 1.0E+00      8 (0.0E+00) 1.9E+00  1.5909153E+01       5            3 5.9E+00         _
     11     5      2             13 (0.0E+00) 1.9E+00  1.5909153E+01       5            3 1.0E+00         _  r
     13     6      2 3.5E-10     18 (0.0E+00) 1.9E+00  1.5908387E+01       5            3 2.5E+00         _s
     14     7      1 1.9E-01     24 (0.0E+00) 1.9E+00  1.5892162E+01       5            3 2.5E+00         _sM
     15     7      2             29 (0.0E+00) 1.9E+00  1.5892162E+01       5            3 1.0E+00         _sMr
1
 
 SNOPTA EXIT  40 -- terminated after numerical difficulties
 SNOPTA INFO  41 -- current point cannot be improved

 Problem name                 Default
 No. of iterations                  15   Objective value      1.5892162107E+01
 No. of major iterations             7   Linear objective     0.0000000000E+00
 Penalty parameter           0.000E+00   Nonlinear objective  1.5892162107E+01
 No. of calls to funobj             35   No. of calls to funcon             35
 No. of superbasics                  3   No. of basic nonlinears             0
 No. of degenerate steps             0   Percentage                        .00
 Max x                       2 6.3E+01   Max pi                      5 1.0E+00
 Max Primal infeas           0 0.0E+00   Max Dual infeas             1 4.9E+00
 Nonlinear constraint violn    0.0E+00
1
 
 Name           Default                  Objective Value      1.5892162107E+01

 Status         Optimal Soln             Iteration     15    Superbasics     3

 Objective               (Min)
 RHS
 Ranges
 Bounds

 Section 1 - Rows

  Number  ...Row.. State  ...Activity...  Slack Activity  ..Lower Limit.  ..Upper Limit.  .Dual Activity    ..i
 
       5  r      1    BS          .               .                None            None         -1.0          1
       6  r      2 D  BS          .               .               .               .               .           2
       7  r      3 D  BS          .               .               .               .               .           3
       8  r      4 D  BS          .               .               .               .               .           4
       9  r      5 D  BS          .               .               .               .               .           5
1
 
 Section 2 - Columns

  Number  .Column. State  ...Activity...  .Obj Gradient.  ..Lower Limit.  ..Upper Limit.  Reduced Gradnt    m+j
 
       1  x      1 N SBS          .15549        -4.88535          .07700          .24000        -4.88535      6
       2  x      2    UL        63.00000        -1.21939        20.00000        63.00000        -1.21939      7
       3  x      3 N SBS          .58180          .38277          .22000          .67000          .38277      8
       4  x      4 N SBS        42.04551        -3.85349        30.00000        90.00000        -3.85349      9
 
 Time for MPS input                              .00 seconds
 Time for solving problem                      -2.00 seconds
 Time for solution output                        .00 seconds
 Time for constraint functions                   .00 seconds
 Time for objective function                     .00 seconds
1
 
 SNMEMA EXIT 100 -- finished successfully
 SNMEMA INFO 104 -- memory requirements estimated

         ==============================
         S N O P T  7.2-11   (Jan 2011)
         ==============================
1
 
 Parameters
 ==========

 Files
 -----
 Solution file..........         0       Old basis file ........         0       Standard input.........         5
 Insert file............         0       New basis file ........         0       (Printer)..............         9
 Punch file.............         0       Backup basis file......         0       (Specs file)...........         0
 Load file..............         0       Dump file..............         0       Standard output........         6

 Frequencies
 -----------
 Print frequency........       100       Check frequency........        60       Save new basis map.....       100
 Summary frequency......       100       Factorization frequency        50       Expand frequency.......     10000

 QP subproblems
 --------------
 QPsolver Cholesky......
 Scale tolerance........      .900       Minor feasibility tol..  1.00E-06       Iteration limit........       200
 Scale option...........         0       Minor optimality  tol..  1.00E-06       Minor print level......         1
 Crash tolerance........      .100       Pivot tolerance........  3.25E-11       Partial price..........         1
 Crash option...........         3       Elastic weight.........  1.00E+04       Prtl price section ( A)         4
                                         New superbasics........        99       Prtl price section (-I)         5

 The SQP Method
 --------------
 Minimize...............                 Cold start.............                 Proximal Point method..         1
 Nonlinear objectiv vars         4       Objective Row..........         1       Function precision.....  1.00E-05
 Unbounded step size....  1.00E+20       Superbasics limit......         4       Difference interval....  3.16E-03
 Unbounded objective....  1.00E+15       Reduced Hessian dim....         4       Central difference int.  2.15E-02
 Major step limit.......  2.00E+00       Derivative linesearch..                 Derivative option......         1
 Major iterations limit.      1000       Linesearch tolerance...    .90000       Verify level...........         0
 Minor iterations limit.       500       Penalty parameter......  0.00E+00       Major Print Level......         1
                                         Major optimality tol...  1.00E-02

 Hessian Approximation
 ---------------------
 Full-Memory Hessian....                 Hessian updates........  99999999       Hessian frequency......  99999999
                                                                                 Hessian flush..........  99999999

 Nonlinear constraints
 ---------------------
 Nonlinear constraints..         4       Major feasibility tol..  1.00E-06       Violation limit........  1.00E+06
 Nonlinear Jacobian vars         4

 Miscellaneous
 -------------
 LU factor tolerance....      3.99       LU singularity tol.....  3.25E-11       Timing level...........         3
 LU update tolerance....      3.99       LU swap tolerance......  1.22E-04       Debug level............         0
 LU partial  pivoting...                 eps (machine precision)  2.22E-16       System information.....        No
                                                                                 Sticky parameters......        No
1
 

 

 Matrix statistics
 -----------------
               Total      Normal        Free       Fixed     Bounded
 Rows              5           0           1           4           0
 Columns           4           0           0           0           4

 No. of matrix elements                   16     Density      80.000
 Biggest  constant element        0.0000E+00  (excluding fixed columns,
 Smallest constant element        0.0000E+00   free rows, and RHS)

 No. of objective coefficients             0

 Nonlinear constraints       4     Linear constraints       1
 Nonlinear variables         4     Linear variables         0
 Jacobian  variables         4     Objective variables      4
 Total constraints           5     Total variables          4
1
 

 
 The user has defined      20   out of      20   first  derivatives

 Cheap test of user-supplied problem derivatives...

 XXX  The constraint gradients seem to be incorrect.

 -->  The largest discrepancy was    9.64E-01  in constraint     7
 

 XXX  The objective  gradients seem to be incorrect.

 Gradient projected in one direction  -1.19307538069E+02
 Difference approximation              3.11639076846E+02
1
 
 

   Itns Major Minors    Step   nCon Feasible  Optimal  MeritFunction     L+U BSwap     nS  condHz Penalty
      3     0      3              1 (0.0E+00) 2.7E+01  2.7221669E+01       5            2 1.0E+00         _  r
      4     1      1 3.0E-01      4 (0.0E+00) 2.0E+00  1.6069119E+01       5            2 1.0E+00         _n r
      5     2      1 7.0E-11     11 (0.0E+00) 2.0E+00  1.6045362E+01       5            2 1.0E+00         _n r
      5     2      1             18 (0.0E+00) 2.0E+00  1.6045362E+01       5            2 1.0E+00         _n r
      5     2      1             25 (0.0E+00) 2.0E+00  1.6045362E+01       5            2 1.0E+00         _n r
1
 
 SNOPTA EXIT  40 -- terminated after numerical difficulties
 SNOPTA INFO  41 -- current point cannot be improved

 Problem name                 Default
 No. of iterations                   5   Objective value      1.6045362122E+01
 No. of major iterations             2   Linear objective     0.0000000000E+00
 Penalty parameter           0.000E+00   Nonlinear objective  1.6045362122E+01
 No. of calls to funobj             33   No. of calls to funcon             33
 No. of superbasics                  2   No. of basic nonlinears             0
 No. of degenerate steps             0   Percentage                        .00
 Max x                       2 6.3E+01   Max pi                      5 1.0E+00
 Max Primal infeas           0 0.0E+00   Max Dual infeas             1 2.7E+01
 Nonlinear constraint violn    0.0E+00
1
 
 Name           Default                  Objective Value      1.6045362122E+01

 Status         Optimal Soln             Iteration      5    Superbasics     2

 Objective               (Min)
 RHS
 Ranges
 Bounds

 Section 1 - Rows

  Number  ...Row.. State  ...Activity...  Slack Activity  ..Lower Limit.  ..Upper Limit.  .Dual Activity    ..i
 
       5  r      1    BS          .               .                None            None         -1.0          1
       6  r      2 D  BS          .               .               .               .               .           2
       7  r      3 D  BS          .               .               .               .               .           3
       8  r      4 D  BS          .               .               .               .               .           4
       9  r      5 D  BS          .               .               .               .               .           5
1
 
 Section 2 - Columns

  Number  .Column. State  ...Activity...  .Obj Gradient.  ..Lower Limit.  ..Upper Limit.  Reduced Gradnt    m+j
 
       1  x      1 N  FR          .15620        27.28859          .07700          .24000        27.28859      6
       2  x      2    UL        63.00000        -1.23224        20.00000        63.00000        -1.23224      7
       3  x      3 N SBS          .54978        -1.35139          .22000          .67000        -1.35139      8
       4  x      4 N SBS        42.01230        -3.91944        30.00000        90.00000        -3.91944      9
 
 Time for MPS input                              .00 seconds
 Time for solving problem              ************* seconds
 Time for solution output                        .00 seconds
 Time for constraint functions         ************* seconds
 Time for objective function                     .00 seconds
1
 
 SNMEMA EXIT 100 -- finished successfully
 SNMEMA INFO 104 -- memory requirements estimated

         ==============================
         S N O P T  7.2-11   (Jan 2011)
         ==============================
1
 
 Parameters
 ==========

 Files
 -----
 Solution file..........         0       Old basis file ........         0       Standard input.........         5
 Insert file............         0       New basis file ........         0       (Printer)..............         9
 Punch file.............         0       Backup basis file......         0       (Specs file)...........         0
 Load file..............         0       Dump file..............         0       Standard output........         6

 Frequencies
 -----------
 Print frequency........       100       Check frequency........        60       Save new basis map.....       100
 Summary frequency......       100       Factorization frequency        50       Expand frequency.......     10000

 QP subproblems
 --------------
 QPsolver Cholesky......
 Scale tolerance........      .900       Minor feasibility tol..  1.00E-06       Iteration limit........       200
 Scale option...........         0       Minor optimality  tol..  1.00E-06       Minor print level......         1
 Crash tolerance........      .100       Pivot tolerance........  3.25E-11       Partial price..........         1
 Crash option...........         3       Elastic weight.........  1.00E+04       Prtl price section ( A)         4
                                         New superbasics........        99       Prtl price section (-I)         5

 The SQP Method
 --------------
 Minimize...............                 Cold start.............                 Proximal Point method..         1
 Nonlinear objectiv vars         4       Objective Row..........         1       Function precision.....  1.00E-05
 Unbounded step size....  1.00E+20       Superbasics limit......         4       Difference interval....  3.16E-03
 Unbounded objective....  1.00E+15       Reduced Hessian dim....         4       Central difference int.  2.15E-02
 Major step limit.......  2.00E+00       Derivative linesearch..                 Derivative option......         1
 Major iterations limit.      1000       Linesearch tolerance...    .90000       Verify level...........         0
 Minor iterations limit.       500       Penalty parameter......  0.00E+00       Major Print Level......         1
                                         Major optimality tol...  1.00E-02

 Hessian Approximation
 ---------------------
 Full-Memory Hessian....                 Hessian updates........  99999999       Hessian frequency......  99999999
                                                                                 Hessian flush..........  99999999

 Nonlinear constraints
 ---------------------
 Nonlinear constraints..         4       Major feasibility tol..  1.00E-06       Violation limit........  1.00E+06
 Nonlinear Jacobian vars         4

 Miscellaneous
 -------------
 LU factor tolerance....      3.99       LU singularity tol.....  3.25E-11       Timing level...........         0
 LU update tolerance....      3.99       LU swap tolerance......  1.22E-04       Debug level............         0
 LU partial  pivoting...                 eps (machine precision)  2.22E-16       System information.....        No
                                                                                 Sticky parameters......        No
1
 

 

 Matrix statistics
 -----------------
               Total      Normal        Free       Fixed     Bounded
 Rows              5           0           1           4           0
 Columns           4           0           0           0           4

 No. of matrix elements                   16     Density      80.000
 Biggest  constant element        0.0000E+00  (excluding fixed columns,
 Smallest constant element        0.0000E+00   free rows, and RHS)

 No. of objective coefficients             0

 Nonlinear constraints       4     Linear constraints       1
 Nonlinear variables         4     Linear variables         0
 Jacobian  variables         4     Objective variables      4
 Total constraints           5     Total variables          4
1
 

 
 The user has defined      20   out of      20   first  derivatives

 Cheap test of user-supplied problem derivatives...

 XXX  The constraint gradients seem to be incorrect.

 -->  The largest discrepancy was    9.64E-01  in constraint     7
 

 XXX  The objective  gradients seem to be incorrect.

 Gradient projected in one direction   0.00000000000E+00
 Difference approximation             -1.48369455575E+02
1
 
 

   Itns Major Minors    Step   nCon Feasible  Optimal  MeritFunction     L+U BSwap     nS  condHz Penalty
      1     0      1              1  5.4E-02 (1.6E-03) 5.0066776E+01       5            1 1.0E+00         _  r
      1     1      0 1.0E+00      2 (0.0E+00)(0.0E+00) 0.0000000E+00       5            1 1.0E+00 1.4E-04 _n r
1
 
 SNOPTA EXIT   0 -- finished successfully
 SNOPTA INFO   1 -- optimality conditions satisfied

 Problem name                 Default
 No. of iterations                   1   Objective value      0.0000000000E+00
 No. of major iterations             1   Linear objective     0.0000000000E+00
 Penalty parameter           1.371E-04   Nonlinear objective  0.0000000000E+00
 No. of calls to funobj              3   No. of calls to funcon              3
 No. of superbasics                  1   No. of basic nonlinears             0
 No. of degenerate steps             0   Percentage                        .00
 Max x                       2 6.3E+01   Max pi                      5 1.0E+00
 Max Primal infeas           0 0.0E+00   Max Dual infeas             0 0.0E+00
 Nonlinear constraint violn    0.0E+00
1
 
 Name           Default                  Objective Value      0.0000000000E+00

 Status         Optimal Soln             Iteration      1    Superbasics     1

 Objective               (Min)
 RHS
 Ranges
 Bounds

 Section 1 - Rows

  Number  ...Row.. State  ...Activity...  Slack Activity  ..Lower Limit.  ..Upper Limit.  .Dual Activity    ..i
 
       5  r      1    BS          .               .                None            None         -1.0          1
       6  r      2 D  BS          .               .               .               .               .           2
       7  r      3 D  BS          .               .               .               .               .           3
       8  r      4 D  BS          .               .               .               .               .           4
       9  r      5 D  BS          .               .               .               .               .           5
1
 
 Section 2 - Columns

  Number  .Column. State  ...Activity...  .Obj Gradient.  ..Lower Limit.  ..Upper Limit.  Reduced Gradnt    m+j
 
       1  x      1 A  FR          .16198          .               .07700          .24000          .           6
       2  x      2 A  UL        63.00000          .             20.00000        63.00000          .           7
       3  x      3   SBS          .52024          .               .22000          .67000          .           8
       4  x      4 A  FR        42.00000          .             30.00000        90.00000          .           9
1
 
 SNMEMA EXIT 100 -- finished successfully
 SNMEMA INFO 104 -- memory requirements estimated

         ==============================
         S N O P T  7.2-11   (Jan 2011)
         ==============================
1
 
 Parameters
 ==========

 Files
 -----
 Solution file..........         0       Old basis file ........         0       Standard input.........         5
 Insert file............         0       New basis file ........         0       (Printer)..............         9
 Punch file.............         0       Backup basis file......         0       (Specs file)...........         0
 Load file..............         0       Dump file..............         0       Standard output........         6

 Frequencies
 -----------
 Print frequency........       100       Check frequency........        60       Save new basis map.....       100
 Summary frequency......       100       Factorization frequency        50       Expand frequency.......     10000

 QP subproblems
 --------------
 QPsolver Cholesky......
 Scale tolerance........      .900       Minor feasibility tol..  1.00E-06       Iteration limit........       200
 Scale option...........         0       Minor optimality  tol..  1.00E-06       Minor print level......         1
 Crash tolerance........      .100       Pivot tolerance........  3.25E-11       Partial price..........         1
 Crash option...........         3       Elastic weight.........  1.00E+04       Prtl price section ( A)         4
                                         New superbasics........        99       Prtl price section (-I)         5

 The SQP Method
 --------------
 Minimize...............                 Cold start.............                 Proximal Point method..         1
 Nonlinear objectiv vars         4       Objective Row..........         1       Function precision.....  1.00E-05
 Unbounded step size....  1.00E+20       Superbasics limit......         4       Difference interval....  3.16E-03
 Unbounded objective....  1.00E+15       Reduced Hessian dim....         4       Central difference int.  2.15E-02
 Major step limit.......  2.00E+00       Derivative linesearch..                 Derivative option......         1
 Major iterations limit.      1000       Linesearch tolerance...    .90000       Verify level...........         0
 Minor iterations limit.       500       Penalty parameter......  0.00E+00       Major Print Level......         1
                                         Major optimality tol...  1.00E-02

 Hessian Approximation
 ---------------------
 Full-Memory Hessian....                 Hessian updates........  99999999       Hessian frequency......  99999999
                                                                                 Hessian flush..........  99999999

 Nonlinear constraints
 ---------------------
 Nonlinear constraints..         4       Major feasibility tol..  1.00E-06       Violation limit........  1.00E+06
 Nonlinear Jacobian vars         4

 Miscellaneous
 -------------
 LU factor tolerance....      3.99       LU singularity tol.....  3.25E-11       Timing level...........         3
 LU update tolerance....      3.99       LU swap tolerance......  1.22E-04       Debug level............         0
 LU partial  pivoting...                 eps (machine precision)  2.22E-16       System information.....        No
                                                                                 Sticky parameters......        No
1
 

 

 Matrix statistics
 -----------------
               Total      Normal        Free       Fixed     Bounded
 Rows              5           0           1           4           0
 Columns           4           0           0           0           4

 No. of matrix elements                   16     Density      80.000
 Biggest  constant element        0.0000E+00  (excluding fixed columns,
 Smallest constant element        0.0000E+00   free rows, and RHS)

 No. of objective coefficients             0

 Nonlinear constraints       4     Linear constraints       1
 Nonlinear variables         4     Linear variables         0
 Jacobian  variables         4     Objective variables      4
 Total constraints           5     Total variables          4
1
 

 
 The user has defined      20   out of      20   first  derivatives

 Cheap test of user-supplied problem derivatives...

 XXX  The constraint gradients seem to be incorrect.

 -->  The largest discrepancy was    9.64E-01  in constraint     7
 

 XXX  The objective  gradients seem to be incorrect.

 Gradient projected in one direction   0.00000000000E+00
 Difference approximation             -1.48369455575E+02
1
 
 

   Itns Major Minors    Step   nCon Feasible  Optimal  MeritFunction     L+U BSwap     nS  condHz Penalty
      0     0      0              1 (0.0E+00)(0.0E+00) 5.0066776E+01       5                              _  r
1
 
 SNOPTA EXIT   0 -- finished successfully
 SNOPTA INFO   1 -- optimality conditions satisfied

 Problem name                 Default
 No. of iterations                   0   Objective value      5.0066775615E+01
 No. of major iterations             0   Linear objective     0.0000000000E+00
 Penalty parameter           0.000E+00   Nonlinear objective  5.0066775615E+01
 No. of calls to funobj              2   No. of calls to funcon              2
 No. of degenerate steps             0   Percentage                        .00
 Max x                       2 6.3E+01   Max pi                      5 1.0E+00
 Max Primal infeas           0 0.0E+00   Max Dual infeas             0 0.0E+00
 Nonlinear constraint violn    0.0E+00
1
 
 Name           Default                  Objective Value      5.0066775615E+01

 Status         Optimal Soln             Iteration      0    Superbasics     0

 Objective               (Min)
 RHS
 Ranges
 Bounds

 Section 1 - Rows

  Number  ...Row.. State  ...Activity...  Slack Activity  ..Lower Limit.  ..Upper Limit.  .Dual Activity    ..i
 
       5  r      1    BS          .               .                None            None         -1.0          1
       6  r      2 D  BS          .               .               .               .               .           2
       7  r      3 D  BS          .               .               .               .               .           3
       8  r      4 D  BS          .               .               .               .               .           4
       9  r      5 D  BS          .               .               .               .               .           5
1
 
 Section 2 - Columns

  Number  .Column. State  ...Activity...  .Obj Gradient.  ..Lower Limit.  ..Upper Limit.  Reduced Gradnt    m+j
 
       1  x      1 A  FR          .19000          .               .07700          .24000          .           6
       2  x      2 A  UL        63.00000          .             20.00000        63.00000          .           7
       3  x      3 A  FR          .52000          .               .22000          .67000          .           8
       4  x      4 A  FR        42.00000          .             30.00000        90.00000          .           9
 
 Time for MPS input                              .00 seconds
 Time for solving problem                        .00 seconds
 Time for solution output                        .00 seconds
 Time for constraint functions                   .00 seconds
 Time for objective function                     .00 seconds
1
 
 SNMEMA EXIT 100 -- finished successfully
 SNMEMA INFO 104 -- memory requirements estimated

         ==============================
         S N O P T  7.2-11   (Jan 2011)
         ==============================
1
 
 Parameters
 ==========

 Files
 -----
 Solution file..........         0       Old basis file ........         0       Standard input.........         5
 Insert file............         0       New basis file ........         0       (Printer)..............         9
 Punch file.............         0       Backup basis file......         0       (Specs file)...........         0
 Load file..............         0       Dump file..............         0       Standard output........         6

 Frequencies
 -----------
 Print frequency........       100       Check frequency........        60       Save new basis map.....       100
 Summary frequency......       100       Factorization frequency        50       Expand frequency.......     10000

 QP subproblems
 --------------
 QPsolver Cholesky......
 Scale tolerance........      .900       Minor feasibility tol..  1.00E-06       Iteration limit........       200
 Scale option...........         0       Minor optimality  tol..  1.00E-06       Minor print level......         1
 Crash tolerance........      .100       Pivot tolerance........  3.25E-11       Partial price..........         1
 Crash option...........         3       Elastic weight.........  1.00E+04       Prtl price section ( A)         4
                                         New superbasics........        99       Prtl price section (-I)         5

 The SQP Method
 --------------
 Minimize...............                 Cold start.............                 Proximal Point method..         1
 Nonlinear objectiv vars         4       Objective Row..........         1       Function precision.....  1.00E-05
 Unbounded step size....  1.00E+20       Superbasics limit......         4       Difference interval....  3.16E-03
 Unbounded objective....  1.00E+15       Reduced Hessian dim....         4       Central difference int.  2.15E-02
 Major step limit.......  2.00E+00       Derivative linesearch..                 Derivative option......         1
 Major iterations limit.      1000       Linesearch tolerance...    .90000       Verify level...........         0
 Minor iterations limit.       500       Penalty parameter......  0.00E+00       Major Print Level......         1
                                         Major optimality tol...  1.00E-02

 Hessian Approximation
 ---------------------
 Full-Memory Hessian....                 Hessian updates........  99999999       Hessian frequency......  99999999
                                                                                 Hessian flush..........  99999999

 Nonlinear constraints
 ---------------------
 Nonlinear constraints..         4       Major feasibility tol..  1.00E-06       Violation limit........  1.00E+06
 Nonlinear Jacobian vars         4

 Miscellaneous
 -------------
 LU factor tolerance....      3.99       LU singularity tol.....  3.25E-11       Timing level...........         3
 LU update tolerance....      3.99       LU swap tolerance......  1.22E-04       Debug level............         0
 LU partial  pivoting...                 eps (machine precision)  2.22E-16       System information.....        No
                                                                                 Sticky parameters......        No
1
 

 

 Matrix statistics
 -----------------
               Total      Normal        Free       Fixed     Bounded
 Rows              5           0           1           4           0
 Columns           4           0           0           0           4

 No. of matrix elements                   16     Density      80.000
 Biggest  constant element        0.0000E+00  (excluding fixed columns,
 Smallest constant element        0.0000E+00   free rows, and RHS)

 No. of objective coefficients             0

 Nonlinear constraints       4     Linear constraints       1
 Nonlinear variables         4     Linear variables         0
 Jacobian  variables         4     Objective variables      4
 Total constraints           5     Total variables          4
1
 

 
 The user has defined      20   out of      20   first  derivatives

 Cheap test of user-supplied problem derivatives...

 XXX  The constraint gradients seem to be incorrect.

 -->  The largest discrepancy was    9.53E-01  in constraint     6
 

 XXX  The objective  gradients seem to be incorrect.

 Gradient projected in one direction   0.00000000000E+00
 Difference approximation             -1.48740440958E+02
1
 
 

   Itns Major Minors    Step   nCon Feasible  Optimal  MeritFunction     L+U BSwap     nS  condHz Penalty
      5     0      5              1  1.3E-01 (0.0E+00) 1.3612187E+11       5            2 1.0E+00         _  r i
1
 
 SNOPTA EXIT  10 -- the problem appears to be infeasible
 SNOPTA INFO  13 -- nonlinear infeasibilities minimized

 Problem name                 Default
 No. of iterations                   5   Objective value      5.0193094162E+01
 No. of infeasibilities              1   Sum of infeas        6.8060933432E+00
 Elastic weight                2.0E+10   Scaled Merit         6.8060933457E+00
 No. of major iterations             0   Linear objective     0.0000000000E+00
 Penalty parameter           0.000E+00   Nonlinear objective  5.0193094162E+01
 No. of calls to funobj              2   No. of calls to funcon              2
 No. of superbasics                  2   No. of basic nonlinears             0
 No. of degenerate steps             0   Percentage                        .00
 Max x                       2 6.3E+01   Max pi                      1 2.0E+10
 Max Primal infeas           6 6.8E+00   Max Dual infeas             0 0.0E+00
 Nonlinear constraint violn    6.8E+00
1
 
 Name           Default                  Infeasibilities      1      6.8061E+00

 Status         Optimal Soln             Iteration      5    Superbasics     2

 Objective               (Min)
 RHS
 Ranges
 Bounds

 Section 1 - Rows

  Number  ...Row.. State  ...Activity...  Slack Activity  ..Lower Limit.  ..Upper Limit.  .Dual Activity    ..i
 
       5  r      1    BS          .               .                None            None         -1.0          1
       6  r      2 I  BS        -6.80609        -6.80609          .               .         2.000000E+10      2
       7  r      3 I  BS          .               .               .               .               .           3
       8  r      4 D  BS          .               .               .               .               .           4
       9  r      5 D  BS          .               .               .               .               .           5
1
 
 Section 2 - Columns

  Number  .Column. State  ...Activity...  .Obj Gradient.  ..Lower Limit.  ..Upper Limit.  Reduced Gradnt    m+j
 
       1  x      1 A  FR          .19000          .               .07700          .24000          .           6
       2  x      2 A  UL        63.00000          .             20.00000        63.00000          .           7
       3  x      3   SBS          .52000          .               .22000          .67000          .           8
       4  x      4   SBS        42.00000          .             30.00000        90.00000          .           9
 
 Time for MPS input                              .00 seconds
 Time for solving problem                        .00 seconds
 Time for solution output                        .00 seconds
 Time for constraint functions                   .00 seconds
 Time for objective function                     .00 seconds
1
 
 SNMEMA EXIT 100 -- finished successfully
 SNMEMA INFO 104 -- memory requirements estimated

         ==============================
         S N O P T  7.2-11   (Jan 2011)
         ==============================
1
 
 Parameters
 ==========

 Files
 -----
 Solution file..........         0       Old basis file ........         0       Standard input.........         5
 Insert file............         0       New basis file ........         0       (Printer)..............         9
 Punch file.............         0       Backup basis file......         0       (Specs file)...........         0
 Load file..............         0       Dump file..............         0       Standard output........         6

 Frequencies
 -----------
 Print frequency........       100       Check frequency........        60       Save new basis map.....       100
 Summary frequency......       100       Factorization frequency        50       Expand frequency.......     10000

 QP subproblems
 --------------
 QPsolver Cholesky......
 Scale tolerance........      .900       Minor feasibility tol..  1.00E-06       Iteration limit........       200
 Scale option...........         0       Minor optimality  tol..  1.00E-06       Minor print level......         1
 Crash tolerance........      .100       Pivot tolerance........  3.25E-11       Partial price..........         1
 Crash option...........         3       Elastic weight.........  1.00E+04       Prtl price section ( A)         4
                                         New superbasics........        99       Prtl price section (-I)         5

 The SQP Method
 --------------
 Minimize...............                 Cold start.............                 Proximal Point method..         1
 Nonlinear objectiv vars         4       Objective Row..........         1       Function precision.....  1.00E-05
 Unbounded step size....  1.00E+20       Superbasics limit......         4       Difference interval....  3.16E-03
 Unbounded objective....  1.00E+15       Reduced Hessian dim....         4       Central difference int.  2.15E-02
 Major step limit.......  2.00E+00       Derivative linesearch..                 Derivative option......         1
 Major iterations limit.      1000       Linesearch tolerance...    .90000       Verify level...........         0
 Minor iterations limit.       500       Penalty parameter......  0.00E+00       Major Print Level......         1
                                         Major optimality tol...  1.00E-02

 Hessian Approximation
 ---------------------
 Full-Memory Hessian....                 Hessian updates........  99999999       Hessian frequency......  99999999
                                                                                 Hessian flush..........  99999999

 Nonlinear constraints
 ---------------------
 Nonlinear constraints..         4       Major feasibility tol..  1.00E-06       Violation limit........  1.00E+06
 Nonlinear Jacobian vars         4

 Miscellaneous
 -------------
 LU factor tolerance....      3.99       LU singularity tol.....  3.25E-11       Timing level...........         0
 LU update tolerance....      3.99       LU swap tolerance......  1.22E-04       Debug level............         0
 LU partial  pivoting...                 eps (machine precision)  2.22E-16       System information.....        No
                                                                                 Sticky parameters......        No
1
 

 

 Matrix statistics
 -----------------
               Total      Normal        Free       Fixed     Bounded
 Rows              5           0           1           4           0
 Columns           4           0           0           0           4

 No. of matrix elements                   16     Density      80.000
 Biggest  constant element        0.0000E+00  (excluding fixed columns,
 Smallest constant element        0.0000E+00   free rows, and RHS)

 No. of objective coefficients             0

 Nonlinear constraints       4     Linear constraints       1
 Nonlinear variables         4     Linear variables         0
 Jacobian  variables         4     Objective variables      4
 Total constraints           5     Total variables          4
1
 

 
 The user has defined      20   out of      20   first  derivatives

 Cheap test of user-supplied problem derivatives...

 The constraint gradients seem to be OK.

 -->  The largest discrepancy was    0.00E+00  in constraint     6
 

 The objective  gradients seem to be OK.

 Gradient projected in one direction   0.00000000000E+00
 Difference approximation              0.00000000000E+00
1
 
 

   Itns Major Minors    Step   nCon Feasible  Optimal  MeritFunction     L+U BSwap     nS  condHz Penalty
      0     0      0              1 (0.0E+00)(0.0E+00) 0.0000000E+00       5                              _  r
1
 
 SNOPTA EXIT   0 -- finished successfully
 SNOPTA INFO   1 -- optimality conditions satisfied

 Problem name                 Default
 No. of iterations                   0   Objective value      0.0000000000E+00
 No. of major iterations             0   Linear objective     0.0000000000E+00
 Penalty parameter           0.000E+00   Nonlinear objective  0.0000000000E+00
 No. of calls to funobj              2   No. of calls to funcon              2
 No. of degenerate steps             0   Percentage                        .00
 Max x                       2 6.3E+01   Max pi                      5 1.0E+00
 Max Primal infeas           0 0.0E+00   Max Dual infeas             0 0.0E+00
 Nonlinear constraint violn    0.0E+00
1
 
 Name           Default                  Objective Value      0.0000000000E+00

 Status         Optimal Soln             Iteration      0    Superbasics     0

 Objective               (Min)
 RHS
 Ranges
 Bounds

 Section 1 - Rows

  Number  ...Row.. State  ...Activity...  Slack Activity  ..Lower Limit.  ..Upper Limit.  .Dual Activity    ..i
 
       5  r      1    BS          .               .                None            None         -1.0          1
       6  r      2 D  BS          .               .               .               .               .           2
       7  r      3 D  BS          .               .               .               .               .           3
       8  r      4 D  BS          .               .               .               .               .           4
       9  r      5 D  BS          .               .               .               .               .           5
1
 
 Section 2 - Columns

  Number  .Column. State  ...Activity...  .Obj Gradient.  ..Lower Limit.  ..Upper Limit.  Reduced Gradnt    m+j
 
       1  x      1 A  FR          .19000          .               .07700          .24000          .           6
       2  x      2 A  UL        63.00000          .             20.00000        63.00000          .           7
       3  x      3 A  FR          .52000          .               .22000          .67000          .           8
       4  x      4 A  FR        42.00000          .             30.00000        90.00000          .           9
1
 
 SNMEMA EXIT 100 -- finished successfully
 SNMEMA INFO 104 -- memory requirements estimated

         ==============================
         S N O P T  7.2-11   (Jan 2011)
         ==============================
1
 
 Parameters
 ==========

 Files
 -----
 Solution file..........         0       Old basis file ........         0       Standard input.........         5
 Insert file............         0       New basis file ........         0       (Printer)..............         9
 Punch file.............         0       Backup basis file......         0       (Specs file)...........         0
 Load file..............         0       Dump file..............         0       Standard output........         6

 Frequencies
 -----------
 Print frequency........       100       Check frequency........        60       Save new basis map.....       100
 Summary frequency......       100       Factorization frequency        50       Expand frequency.......     10000

 QP subproblems
 --------------
 QPsolver Cholesky......
 Scale tolerance........      .900       Minor feasibility tol..  1.00E-06       Iteration limit........       200
 Scale option...........         0       Minor optimality  tol..  1.00E-06       Minor print level......         1
 Crash tolerance........      .100       Pivot tolerance........  3.25E-11       Partial price..........         1
 Crash option...........         3       Elastic weight.........  1.00E+04       Prtl price section ( A)         4
                                         New superbasics........        99       Prtl price section (-I)         5

 The SQP Method
 --------------
 Minimize...............                 Cold start.............                 Proximal Point method..         1
 Nonlinear objectiv vars         4       Objective Row..........         1       Function precision.....  1.00E-05
 Unbounded step size....  1.00E+20       Superbasics limit......         4       Difference interval....  3.16E-03
 Unbounded objective....  1.00E+15       Reduced Hessian dim....         4       Central difference int.  2.15E-02
 Major step limit.......  2.00E+00       Derivative linesearch..                 Derivative option......         1
 Major iterations limit.      1000       Linesearch tolerance...    .90000       Verify level...........         0
 Minor iterations limit.       500       Penalty parameter......  0.00E+00       Major Print Level......         1
                                         Major optimality tol...  1.00E-02

 Hessian Approximation
 ---------------------
 Full-Memory Hessian....                 Hessian updates........  99999999       Hessian frequency......  99999999
                                                                                 Hessian flush..........  99999999

 Nonlinear constraints
 ---------------------
 Nonlinear constraints..         4       Major feasibility tol..  1.00E-06       Violation limit........  1.00E+06
 Nonlinear Jacobian vars         4

 Miscellaneous
 -------------
 LU factor tolerance....      3.99       LU singularity tol.....  3.25E-11       Timing level...........         3
 LU update tolerance....      3.99       LU swap tolerance......  1.22E-04       Debug level............         0
 LU partial  pivoting...                 eps (machine precision)  2.22E-16       System information.....        No
                                                                                 Sticky parameters......        No
1
 

 

 Matrix statistics
 -----------------
               Total      Normal        Free       Fixed     Bounded
 Rows              5           0           1           4           0
 Columns           4           0           0           0           4

 No. of matrix elements                   16     Density      80.000
 Biggest  constant element        0.0000E+00  (excluding fixed columns,
 Smallest constant element        0.0000E+00   free rows, and RHS)

 No. of objective coefficients             0

 Nonlinear constraints       4     Linear constraints       1
 Nonlinear variables         4     Linear variables         0
 Jacobian  variables         4     Objective variables      4
 Total constraints           5     Total variables          4
1
 

 
 The user has defined      20   out of      20   first  derivatives

 Cheap test of user-supplied problem derivatives...

 The constraint gradients seem to be OK.

 -->  The largest discrepancy was    0.00E+00  in constraint     6
 

 The objective  gradients seem to be OK.

 Gradient projected in one direction   0.00000000000E+00
 Difference approximation              0.00000000000E+00
1
 
 

   Itns Major Minors    Step   nCon Feasible  Optimal  MeritFunction     L+U BSwap     nS  condHz Penalty
      0     0      0              1 (0.0E+00)(0.0E+00) 0.0000000E+00       5                              _  r
1
 
 SNOPTA EXIT   0 -- finished successfully
 SNOPTA INFO   1 -- optimality conditions satisfied

 Problem name                 Default
 No. of iterations                   0   Objective value      0.0000000000E+00
 No. of major iterations             0   Linear objective     0.0000000000E+00
 Penalty parameter           0.000E+00   Nonlinear objective  0.0000000000E+00
 No. of calls to funobj              2   No. of calls to funcon              2
 No. of degenerate steps             0   Percentage                        .00
 Max x                       2 6.3E+01   Max pi                      5 1.0E+00
 Max Primal infeas           0 0.0E+00   Max Dual infeas             0 0.0E+00
 Nonlinear constraint violn    0.0E+00
1
 
 Name           Default                  Objective Value      0.0000000000E+00

 Status         Optimal Soln             Iteration      0    Superbasics     0

 Objective               (Min)
 RHS
 Ranges
 Bounds

 Section 1 - Rows

  Number  ...Row.. State  ...Activity...  Slack Activity  ..Lower Limit.  ..Upper Limit.  .Dual Activity    ..i
 
       5  r      1    BS          .               .                None            None         -1.0          1
       6  r      2 D  BS          .               .               .               .               .           2
       7  r      3 D  BS          .               .               .               .               .           3
       8  r      4 D  BS          .               .               .               .               .           4
       9  r      5 D  BS          .               .               .               .               .           5
1
 
 Section 2 - Columns

  Number  .Column. State  ...Activity...  .Obj Gradient.  ..Lower Limit.  ..Upper Limit.  Reduced Gradnt    m+j
 
       1  x      1 A  FR          .19000          .               .07700          .24000          .           6
       2  x      2 A  UL        63.00000          .             20.00000        63.00000          .           7
       3  x      3 A  FR          .52000          .               .22000          .67000          .           8
       4  x      4 A  FR        42.00000          .             30.00000        90.00000          .           9
 
 Time for MPS input                              .00 seconds
 Time for solving problem                        .00 seconds
 Time for solution output                        .00 seconds
 Time for constraint functions         ************* seconds
 Time for objective function                     .00 seconds
1
 
 SNMEMA EXIT 100 -- finished successfully
 SNMEMA INFO 104 -- memory requirements estimated

         ==============================
         S N O P T  7.2-11   (Jan 2011)
         ==============================
1
 
 Parameters
 ==========

 Files
 -----
 Solution file..........         0       Old basis file ........         0       Standard input.........         5
 Insert file............         0       New basis file ........         0       (Printer)..............         9
 Punch file.............         0       Backup basis file......         0       (Specs file)...........         0
 Load file..............         0       Dump file..............         0       Standard output........         6

 Frequencies
 -----------
 Print frequency........       100       Check frequency........        60       Save new basis map.....       100
 Summary frequency......       100       Factorization frequency        50       Expand frequency.......     10000

 QP subproblems
 --------------
 QPsolver Cholesky......
 Scale tolerance........      .900       Minor feasibility tol..  1.00E-06       Iteration limit........       200
 Scale option...........         0       Minor optimality  tol..  1.00E-06       Minor print level......         1
 Crash tolerance........      .100       Pivot tolerance........  3.25E-11       Partial price..........         1
 Crash option...........         3       Elastic weight.........  1.00E+04       Prtl price section ( A)         4
                                         New superbasics........        99       Prtl price section (-I)         5

 The SQP Method
 --------------
 Minimize...............                 Cold start.............                 Proximal Point method..         1
 Nonlinear objectiv vars         4       Objective Row..........         1       Function precision.....  1.00E-05
 Unbounded step size....  1.00E+20       Superbasics limit......         4       Difference interval....  3.16E-03
 Unbounded objective....  1.00E+15       Reduced Hessian dim....         4       Central difference int.  2.15E-02
 Major step limit.......  2.00E+00       Derivative linesearch..                 Derivative option......         1
 Major iterations limit.      1000       Linesearch tolerance...    .90000       Verify level...........         0
 Minor iterations limit.       500       Penalty parameter......  0.00E+00       Major Print Level......         1
                                         Major optimality tol...  1.00E-02

 Hessian Approximation
 ---------------------
 Full-Memory Hessian....                 Hessian updates........  99999999       Hessian frequency......  99999999
                                                                                 Hessian flush..........  99999999

 Nonlinear constraints
 ---------------------
 Nonlinear constraints..         4       Major feasibility tol..  1.00E-06       Violation limit........  1.00E+06
 Nonlinear Jacobian vars         4

 Miscellaneous
 -------------
 LU factor tolerance....      3.99       LU singularity tol.....  3.25E-11       Timing level...........         0
 LU update tolerance....      3.99       LU swap tolerance......  1.22E-04       Debug level............         0
 LU partial  pivoting...                 eps (machine precision)  2.22E-16       System information.....        No
                                                                                 Sticky parameters......        No
1
 

 

 Matrix statistics
 -----------------
               Total      Normal        Free       Fixed     Bounded
 Rows              5           0           1           4           0
 Columns           4           0           0           0           4

 No. of matrix elements                   16     Density      80.000
 Biggest  constant element        0.0000E+00  (excluding fixed columns,
 Smallest constant element        0.0000E+00   free rows, and RHS)

 No. of objective coefficients             0

 Nonlinear constraints       4     Linear constraints       1
 Nonlinear variables         4     Linear variables         0
 Jacobian  variables         4     Objective variables      4
 Total constraints           5     Total variables          4
1
 

 
 The user has defined      20   out of      20   first  derivatives

 Cheap test of user-supplied problem derivatives...

 The constraint gradients seem to be OK.

 -->  The largest discrepancy was    0.00E+00  in constraint     6
 

 The objective  gradients seem to be OK.

 Gradient projected in one direction   0.00000000000E+00
 Difference approximation              0.00000000000E+00
1
 
 

   Itns Major Minors    Step   nCon Feasible  Optimal  MeritFunction     L+U BSwap     nS  condHz Penalty
      0     0      0              1 (0.0E+00)(0.0E+00) 0.0000000E+00       5                              _  r
1
 
 SNOPTA EXIT   0 -- finished successfully
 SNOPTA INFO   1 -- optimality conditions satisfied

 Problem name                 Default
 No. of iterations                   0   Objective value      0.0000000000E+00
 No. of major iterations             0   Linear objective     0.0000000000E+00
 Penalty parameter           0.000E+00   Nonlinear objective  0.0000000000E+00
 No. of calls to funobj              2   No. of calls to funcon              2
 No. of degenerate steps             0   Percentage                        .00
 Max x                       2 6.3E+01   Max pi                      5 1.0E+00
 Max Primal infeas           0 0.0E+00   Max Dual infeas             0 0.0E+00
 Nonlinear constraint violn    0.0E+00
1
 
 Name           Default                  Objective Value      0.0000000000E+00

 Status         Optimal Soln             Iteration      0    Superbasics     0

 Objective               (Min)
 RHS
 Ranges
 Bounds

 Section 1 - Rows

  Number  ...Row.. State  ...Activity...  Slack Activity  ..Lower Limit.  ..Upper Limit.  .Dual Activity    ..i
 
       5  r      1    BS          .               .                None            None         -1.0          1
       6  r      2 D  BS          .               .               .               .               .           2
       7  r      3 D  BS          .               .               .               .               .           3
       8  r      4 D  BS          .               .               .               .               .           4
       9  r      5 D  BS          .               .               .               .               .           5
1
 
 Section 2 - Columns

  Number  .Column. State  ...Activity...  .Obj Gradient.  ..Lower Limit.  ..Upper Limit.  Reduced Gradnt    m+j
 
       1  x      1 A  FR          .19000          .               .07700          .24000          .           6
       2  x      2 A  UL        63.00000          .             20.00000        63.00000          .           7
       3  x      3 A  FR          .52000          .               .22000          .67000          .           8
       4  x      4 A  FR        42.00000          .             30.00000        90.00000          .           9
1
 
 SNMEMA EXIT 100 -- finished successfully
 SNMEMA INFO 104 -- memory requirements estimated

         ==============================
         S N O P T  7.2-11   (Jan 2011)
         ==============================
1
 
 Parameters
 ==========

 Files
 -----
 Solution file..........         0       Old basis file ........         0       Standard input.........         5
 Insert file............         0       New basis file ........         0       (Printer)..............         9
 Punch file.............         0       Backup basis file......         0       (Specs file)...........         0
 Load file..............         0       Dump file..............         0       Standard output........         6

 Frequencies
 -----------
 Print frequency........       100       Check frequency........        60       Save new basis map.....       100
 Summary frequency......       100       Factorization frequency        50       Expand frequency.......     10000

 QP subproblems
 --------------
 QPsolver Cholesky......
 Scale tolerance........      .900       Minor feasibility tol..  1.00E-06       Iteration limit........       200
 Scale option...........         0       Minor optimality  tol..  1.00E-06       Minor print level......         1
 Crash tolerance........      .100       Pivot tolerance........  3.25E-11       Partial price..........         1
 Crash option...........         3       Elastic weight.........  1.00E+04       Prtl price section ( A)         4
                                         New superbasics........        99       Prtl price section (-I)         5

 The SQP Method
 --------------
 Minimize...............                 Cold start.............                 Proximal Point method..         1
 Nonlinear objectiv vars         4       Objective Row..........         1       Function precision.....  1.00E-05
 Unbounded step size....  1.00E+20       Superbasics limit......         4       Difference interval....  3.16E-03
 Unbounded objective....  1.00E+15       Reduced Hessian dim....         4       Central difference int.  2.15E-02
 Major step limit.......  2.00E+00       Derivative linesearch..                 Derivative option......         1
 Major iterations limit.      1000       Linesearch tolerance...    .90000       Verify level...........         0
 Minor iterations limit.       500       Penalty parameter......  0.00E+00       Major Print Level......         1
                                         Major optimality tol...  1.00E-02

 Hessian Approximation
 ---------------------
 Full-Memory Hessian....                 Hessian updates........  99999999       Hessian frequency......  99999999
                                                                                 Hessian flush..........  99999999

 Nonlinear constraints
 ---------------------
 Nonlinear constraints..         4       Major feasibility tol..  1.00E-06       Violation limit........  1.00E+06
 Nonlinear Jacobian vars         4

 Miscellaneous
 -------------
 LU factor tolerance....      3.99       LU singularity tol.....  3.25E-11       Timing level...........         3
 LU update tolerance....      3.99       LU swap tolerance......  1.22E-04       Debug level............         0
 LU partial  pivoting...                 eps (machine precision)  2.22E-16       System information.....        No
                                                                                 Sticky parameters......        No
1
 

 

 Matrix statistics
 -----------------
               Total      Normal        Free       Fixed     Bounded
 Rows              5           0           1           4           0
 Columns           4           0           0           0           4

 No. of matrix elements                   16     Density      80.000
 Biggest  constant element        0.0000E+00  (excluding fixed columns,
 Smallest constant element        0.0000E+00   free rows, and RHS)

 No. of objective coefficients             0

 Nonlinear constraints       4     Linear constraints       1
 Nonlinear variables         4     Linear variables         0
 Jacobian  variables         4     Objective variables      4
 Total constraints           5     Total variables          4
1
 

 
 The user has defined      20   out of      20   first  derivatives

 Cheap test of user-supplied problem derivatives...

 The constraint gradients seem to be OK.

 -->  The largest discrepancy was    0.00E+00  in constraint     6
 

 The objective  gradients seem to be OK.

 Gradient projected in one direction   0.00000000000E+00
 Difference approximation              0.00000000000E+00
1
 
 

   Itns Major Minors    Step   nCon Feasible  Optimal  MeritFunction     L+U BSwap     nS  condHz Penalty
      0     0      0              1 (0.0E+00)(0.0E+00) 0.0000000E+00       5                              _  r
1
 
 SNOPTA EXIT   0 -- finished successfully
 SNOPTA INFO   1 -- optimality conditions satisfied

 Problem name                 Default
 No. of iterations                   0   Objective value      0.0000000000E+00
 No. of major iterations             0   Linear objective     0.0000000000E+00
 Penalty parameter           0.000E+00   Nonlinear objective  0.0000000000E+00
 No. of calls to funobj              2   No. of calls to funcon              2
 No. of degenerate steps             0   Percentage                        .00
 Max x                       2 6.3E+01   Max pi                      5 1.0E+00
 Max Primal infeas           0 0.0E+00   Max Dual infeas             0 0.0E+00
 Nonlinear constraint violn    0.0E+00
1
 
 Name           Default                  Objective Value      0.0000000000E+00

 Status         Optimal Soln             Iteration      0    Superbasics     0

 Objective               (Min)
 RHS
 Ranges
 Bounds

 Section 1 - Rows

  Number  ...Row.. State  ...Activity...  Slack Activity  ..Lower Limit.  ..Upper Limit.  .Dual Activity    ..i
 
       5  r      1    BS          .               .                None            None         -1.0          1
       6  r      2 D  BS          .               .               .               .               .           2
       7  r      3 D  BS          .               .               .               .               .           3
       8  r      4 D  BS          .               .               .               .               .           4
       9  r      5 D  BS          .               .               .               .               .           5
1
 
 Section 2 - Columns

  Number  .Column. State  ...Activity...  .Obj Gradient.  ..Lower Limit.  ..Upper Limit.  Reduced Gradnt    m+j
 
       1  x      1 A  FR          .19000          .               .07700          .24000          .           6
       2  x      2 A  UL        63.00000          .             20.00000        63.00000          .           7
       3  x      3 A  FR          .52000          .               .22000          .67000          .           8
       4  x      4 A  FR        42.00000          .             30.00000        90.00000          .           9
 
 Time for MPS input                              .00 seconds
 Time for solving problem                        .00 seconds
 Time for solution output                        .00 seconds
 Time for constraint functions                   .00 seconds
 Time for objective function                     .00 seconds
1
 
 SNMEMA EXIT 100 -- finished successfully
 SNMEMA INFO 104 -- memory requirements estimated

         ==============================
         S N O P T  7.2-11   (Jan 2011)
         ==============================
1
 
 Parameters
 ==========

 Files
 -----
 Solution file..........         0       Old basis file ........         0       Standard input.........         5
 Insert file............         0       New basis file ........         0       (Printer)..............         9
 Punch file.............         0       Backup basis file......         0       (Specs file)...........         0
 Load file..............         0       Dump file..............         0       Standard output........         6

 Frequencies
 -----------
 Print frequency........       100       Check frequency........        60       Save new basis map.....       100
 Summary frequency......       100       Factorization frequency        50       Expand frequency.......     10000

 QP subproblems
 --------------
 QPsolver Cholesky......
 Scale tolerance........      .900       Minor feasibility tol..  1.00E-06       Iteration limit........       200
 Scale option...........         0       Minor optimality  tol..  1.00E-06       Minor print level......         1
 Crash tolerance........      .100       Pivot tolerance........  3.25E-11       Partial price..........         1
 Crash option...........         3       Elastic weight.........  1.00E+04       Prtl price section ( A)         4
                                         New superbasics........        99       Prtl price section (-I)         5

 The SQP Method
 --------------
 Minimize...............                 Cold start.............                 Proximal Point method..         1
 Nonlinear objectiv vars         4       Objective Row..........         1       Function precision.....  1.00E-05
 Unbounded step size....  1.00E+20       Superbasics limit......         4       Difference interval....  3.16E-03
 Unbounded objective....  1.00E+15       Reduced Hessian dim....         4       Central difference int.  2.15E-02
 Major step limit.......  2.00E+00       Derivative linesearch..                 Derivative option......         1
 Major iterations limit.      1000       Linesearch tolerance...    .90000       Verify level...........         0
 Minor iterations limit.       500       Penalty parameter......  0.00E+00       Major Print Level......         1
                                         Major optimality tol...  1.00E-02

 Hessian Approximation
 ---------------------
 Full-Memory Hessian....                 Hessian updates........  99999999       Hessian frequency......  99999999
                                                                                 Hessian flush..........  99999999

 Nonlinear constraints
 ---------------------
 Nonlinear constraints..         4       Major feasibility tol..  1.00E-06       Violation limit........  1.00E+06
 Nonlinear Jacobian vars         4

 Miscellaneous
 -------------
 LU factor tolerance....      3.99       LU singularity tol.....  3.25E-11       Timing level...........         0
 LU update tolerance....      3.99       LU swap tolerance......  1.22E-04       Debug level............         0
 LU partial  pivoting...                 eps (machine precision)  2.22E-16       System information.....        No
                                                                                 Sticky parameters......        No
1
 

 

 Matrix statistics
 -----------------
               Total      Normal        Free       Fixed     Bounded
 Rows              5           0           1           4           0
 Columns           4           0           0           0           4

 No. of matrix elements                   16     Density      80.000
 Biggest  constant element        0.0000E+00  (excluding fixed columns,
 Smallest constant element        0.0000E+00   free rows, and RHS)

 No. of objective coefficients             0

 Nonlinear constraints       4     Linear constraints       1
 Nonlinear variables         4     Linear variables         0
 Jacobian  variables         4     Objective variables      4
 Total constraints           5     Total variables          4
1
 

 
 The user has defined      20   out of      20   first  derivatives

 Cheap test of user-supplied problem derivatives...

 The constraint gradients seem to be OK.

 -->  The largest discrepancy was    0.00E+00  in constraint     6
 

 The objective  gradients seem to be OK.

 Gradient projected in one direction   0.00000000000E+00
 Difference approximation              0.00000000000E+00
1
 
 

   Itns Major Minors    Step   nCon Feasible  Optimal  MeritFunction     L+U BSwap     nS  condHz Penalty
      0     0      0              1 (0.0E+00)(0.0E+00) 0.0000000E+00       5                              _  r
1
 
 SNOPTA EXIT   0 -- finished successfully
 SNOPTA INFO   1 -- optimality conditions satisfied

 Problem name                 Default
 No. of iterations                   0   Objective value      0.0000000000E+00
 No. of major iterations             0   Linear objective     0.0000000000E+00
 Penalty parameter           0.000E+00   Nonlinear objective  0.0000000000E+00
 No. of calls to funobj              2   No. of calls to funcon              2
 No. of degenerate steps             0   Percentage                        .00
 Max x                       2 6.3E+01   Max pi                      5 1.0E+00
 Max Primal infeas           0 0.0E+00   Max Dual infeas             0 0.0E+00
 Nonlinear constraint violn    0.0E+00
1
 
 Name           Default                  Objective Value      0.0000000000E+00

 Status         Optimal Soln             Iteration      0    Superbasics     0

 Objective               (Min)
 RHS
 Ranges
 Bounds

 Section 1 - Rows

  Number  ...Row.. State  ...Activity...  Slack Activity  ..Lower Limit.  ..Upper Limit.  .Dual Activity    ..i
 
       5  r      1    BS          .               .                None            None         -1.0          1
       6  r      2 D  BS          .               .               .               .               .           2
       7  r      3 D  BS          .               .               .               .               .           3
       8  r      4 D  BS          .               .               .               .               .           4
       9  r      5 D  BS          .               .               .               .               .           5
1
 
 Section 2 - Columns

  Number  .Column. State  ...Activity...  .Obj Gradient.  ..Lower Limit.  ..Upper Limit.  Reduced Gradnt    m+j
 
       1  x      1 A  FR          .19000          .               .07700          .24000          .           6
       2  x      2 A  UL        63.00000          .             20.00000        63.00000          .           7
       3  x      3 A  FR          .52000          .               .22000          .67000          .           8
       4  x      4 A  FR        42.00000          .             30.00000        90.00000          .           9
1
 
 SNMEMA EXIT 100 -- finished successfully
 SNMEMA INFO 104 -- memory requirements estimated

         ==============================
         S N O P T  7.2-11   (Jan 2011)
         ==============================
1
 
 Parameters
 ==========

 Files
 -----
 Solution file..........         0       Old basis file ........         0       Standard input.........         5
 Insert file............         0       New basis file ........         0       (Printer)..............         9
 Punch file.............         0       Backup basis file......         0       (Specs file)...........         0
 Load file..............         0       Dump file..............         0       Standard output........         6

 Frequencies
 -----------
 Print frequency........       100       Check frequency........        60       Save new basis map.....       100
 Summary frequency......       100       Factorization frequency        50       Expand frequency.......     10000

 QP subproblems
 --------------
 QPsolver Cholesky......
 Scale tolerance........      .900       Minor feasibility tol..  1.00E-06       Iteration limit........       200
 Scale option...........         0       Minor optimality  tol..  1.00E-06       Minor print level......         1
 Crash tolerance........      .100       Pivot tolerance........  3.25E-11       Partial price..........         1
 Crash option...........         3       Elastic weight.........  1.00E+04       Prtl price section ( A)         4
                                         New superbasics........        99       Prtl price section (-I)         5

 The SQP Method
 --------------
 Minimize...............                 Cold start.............                 Proximal Point method..         1
 Nonlinear objectiv vars         4       Objective Row..........         1       Function precision.....  1.00E-05
 Unbounded step size....  1.00E+20       Superbasics limit......         4       Difference interval....  3.16E-03
 Unbounded objective....  1.00E+15       Reduced Hessian dim....         4       Central difference int.  2.15E-02
 Major step limit.......  2.00E+00       Derivative linesearch..                 Derivative option......         1
 Major iterations limit.      1000       Linesearch tolerance...    .90000       Verify level...........         0
 Minor iterations limit.       500       Penalty parameter......  0.00E+00       Major Print Level......         1
                                         Major optimality tol...  1.00E-02

 Hessian Approximation
 ---------------------
 Full-Memory Hessian....                 Hessian updates........  99999999       Hessian frequency......  99999999
                                                                                 Hessian flush..........  99999999

 Nonlinear constraints
 ---------------------
 Nonlinear constraints..         4       Major feasibility tol..  1.00E-06       Violation limit........  1.00E+06
 Nonlinear Jacobian vars         4

 Miscellaneous
 -------------
 LU factor tolerance....      3.99       LU singularity tol.....  3.25E-11       Timing level...........         0
 LU update tolerance....      3.99       LU swap tolerance......  1.22E-04       Debug level............         0
 LU partial  pivoting...                 eps (machine precision)  2.22E-16       System information.....        No
                                                                                 Sticky parameters......        No
1
 

 

 Matrix statistics
 -----------------
               Total      Normal        Free       Fixed     Bounded
 Rows              5           0           1           4           0
 Columns           4           0           0           0           4

 No. of matrix elements                   16     Density      80.000
 Biggest  constant element        0.0000E+00  (excluding fixed columns,
 Smallest constant element        0.0000E+00   free rows, and RHS)

 No. of objective coefficients             0

 Nonlinear constraints       4     Linear constraints       1
 Nonlinear variables         4     Linear variables         0
 Jacobian  variables         4     Objective variables      4
 Total constraints           5     Total variables          4
1
 

 
 The user has defined      20   out of      20   first  derivatives

 Cheap test of user-supplied problem derivatives...

 The constraint gradients seem to be OK.

 -->  The largest discrepancy was    0.00E+00  in constraint     6
 

 The objective  gradients seem to be OK.

 Gradient projected in one direction   0.00000000000E+00
 Difference approximation              0.00000000000E+00
1
 
 

   Itns Major Minors    Step   nCon Feasible  Optimal  MeritFunction     L+U BSwap     nS  condHz Penalty
      0     0      0              1 (0.0E+00)(0.0E+00) 0.0000000E+00       5                              _  r
1
 
 SNOPTA EXIT   0 -- finished successfully
 SNOPTA INFO   1 -- optimality conditions satisfied

 Problem name                 Default
 No. of iterations                   0   Objective value      0.0000000000E+00
 No. of major iterations             0   Linear objective     0.0000000000E+00
 Penalty parameter           0.000E+00   Nonlinear objective  0.0000000000E+00
 No. of calls to funobj              2   No. of calls to funcon              2
 No. of degenerate steps             0   Percentage                        .00
 Max x                       2 6.3E+01   Max pi                      5 1.0E+00
 Max Primal infeas           0 0.0E+00   Max Dual infeas             0 0.0E+00
 Nonlinear constraint violn    0.0E+00
1
 
 Name           Default                  Objective Value      0.0000000000E+00

 Status         Optimal Soln             Iteration      0    Superbasics     0

 Objective               (Min)
 RHS
 Ranges
 Bounds

 Section 1 - Rows

  Number  ...Row.. State  ...Activity...  Slack Activity  ..Lower Limit.  ..Upper Limit.  .Dual Activity    ..i
 
       5  r      1    BS          .               .                None            None         -1.0          1
       6  r      2 D  BS          .               .               .               .               .           2
       7  r      3 D  BS          .               .               .               .               .           3
       8  r      4 D  BS          .               .               .               .               .           4
       9  r      5 D  BS          .               .               .               .               .           5
1
 
 Section 2 - Columns

  Number  .Column. State  ...Activity...  .Obj Gradient.  ..Lower Limit.  ..Upper Limit.  Reduced Gradnt    m+j
 
       1  x      1 A  FR          .19000          .               .07700          .24000          .           6
       2  x      2 A  UL        63.00000          .             20.00000        63.00000          .           7
       3  x      3 A  FR          .52000          .               .22000          .67000          .           8
       4  x      4 A  FR        42.00000          .             30.00000        90.00000          .           9
1
 
 SNMEMA EXIT 100 -- finished successfully
 SNMEMA INFO 104 -- memory requirements estimated

         ==============================
         S N O P T  7.2-11   (Jan 2011)
         ==============================
1
 
 Parameters
 ==========

 Files
 -----
 Solution file..........         0       Old basis file ........         0       Standard input.........         5
 Insert file............         0       New basis file ........         0       (Printer)..............         9
 Punch file.............         0       Backup basis file......         0       (Specs file)...........         0
 Load file..............         0       Dump file..............         0       Standard output........         6

 Frequencies
 -----------
 Print frequency........       100       Check frequency........        60       Save new basis map.....       100
 Summary frequency......       100       Factorization frequency        50       Expand frequency.......     10000

 QP subproblems
 --------------
 QPsolver Cholesky......
 Scale tolerance........      .900       Minor feasibility tol..  1.00E-06       Iteration limit........       200
 Scale option...........         0       Minor optimality  tol..  1.00E-06       Minor print level......         1
 Crash tolerance........      .100       Pivot tolerance........  3.25E-11       Partial price..........         1
 Crash option...........         3       Elastic weight.........  1.00E+04       Prtl price section ( A)         4
                                         New superbasics........        99       Prtl price section (-I)         5

 The SQP Method
 --------------
 Minimize...............                 Cold start.............                 Proximal Point method..         1
 Nonlinear objectiv vars         4       Objective Row..........         1       Function precision.....  1.00E-05
 Unbounded step size....  1.00E+20       Superbasics limit......         4       Difference interval....  3.16E-03
 Unbounded objective....  1.00E+15       Reduced Hessian dim....         4       Central difference int.  2.15E-02
 Major step limit.......  2.00E+00       Derivative linesearch..                 Derivative option......         1
 Major iterations limit.      1000       Linesearch tolerance...    .90000       Verify level...........         0
 Minor iterations limit.       500       Penalty parameter......  0.00E+00       Major Print Level......         1
                                         Major optimality tol...  1.00E-02

 Hessian Approximation
 ---------------------
 Full-Memory Hessian....                 Hessian updates........  99999999       Hessian frequency......  99999999
                                                                                 Hessian flush..........  99999999

 Nonlinear constraints
 ---------------------
 Nonlinear constraints..         4       Major feasibility tol..  1.00E-06       Violation limit........  1.00E+06
 Nonlinear Jacobian vars         4

 Miscellaneous
 -------------
 LU factor tolerance....      3.99       LU singularity tol.....  3.25E-11       Timing level...........         3
 LU update tolerance....      3.99       LU swap tolerance......  1.22E-04       Debug level............         0
 LU partial  pivoting...                 eps (machine precision)  2.22E-16       System information.....        No
                                                                                 Sticky parameters......        No
1
 

 

 Matrix statistics
 -----------------
               Total      Normal        Free       Fixed     Bounded
 Rows              5           0           1           4           0
 Columns           4           0           0           0           4

 No. of matrix elements                   16     Density      80.000
 Biggest  constant element        0.0000E+00  (excluding fixed columns,
 Smallest constant element        0.0000E+00   free rows, and RHS)

 No. of objective coefficients             0

 Nonlinear constraints       4     Linear constraints       1
 Nonlinear variables         4     Linear variables         0
 Jacobian  variables         4     Objective variables      4
 Total constraints           5     Total variables          4
1
 

 
 The user has defined      20   out of      20   first  derivatives

 Cheap test of user-supplied problem derivatives...

 The constraint gradients seem to be OK.

 -->  The largest discrepancy was    0.00E+00  in constraint     6
 

 The objective  gradients seem to be OK.

 Gradient projected in one direction   0.00000000000E+00
 Difference approximation              0.00000000000E+00
1
 
 

   Itns Major Minors    Step   nCon Feasible  Optimal  MeritFunction     L+U BSwap     nS  condHz Penalty
      0     0      0              1 (0.0E+00)(0.0E+00) 0.0000000E+00       5                              _  r
1
 
 SNOPTA EXIT   0 -- finished successfully
 SNOPTA INFO   1 -- optimality conditions satisfied

 Problem name                 Default
 No. of iterations                   0   Objective value      0.0000000000E+00
 No. of major iterations             0   Linear objective     0.0000000000E+00
 Penalty parameter           0.000E+00   Nonlinear objective  0.0000000000E+00
 No. of calls to funobj              2   No. of calls to funcon              2
 No. of degenerate steps             0   Percentage                        .00
 Max x                       2 6.3E+01   Max pi                      5 1.0E+00
 Max Primal infeas           0 0.0E+00   Max Dual infeas             0 0.0E+00
 Nonlinear constraint violn    0.0E+00
1
 
 Name           Default                  Objective Value      0.0000000000E+00

 Status         Optimal Soln             Iteration      0    Superbasics     0

 Objective               (Min)
 RHS
 Ranges
 Bounds

 Section 1 - Rows

  Number  ...Row.. State  ...Activity...  Slack Activity  ..Lower Limit.  ..Upper Limit.  .Dual Activity    ..i
 
       5  r      1    BS          .               .                None            None         -1.0          1
       6  r      2 D  BS          .               .               .               .               .           2
       7  r      3 D  BS          .               .               .               .               .           3
       8  r      4 D  BS          .               .               .               .               .           4
       9  r      5 D  BS          .               .               .               .               .           5
1
 
 Section 2 - Columns

  Number  .Column. State  ...Activity...  .Obj Gradient.  ..Lower Limit.  ..Upper Limit.  Reduced Gradnt    m+j
 
       1  x      1 A  FR          .19000          .               .07700          .24000          .           6
       2  x      2 A  UL        63.00000          .             20.00000        63.00000          .           7
       3  x      3 A  FR          .52000          .               .22000          .67000          .           8
       4  x      4 A  FR        42.00000          .             30.00000        90.00000          .           9
 
 Time for MPS input                              .00 seconds
 Time for solving problem                        .00 seconds
 Time for solution output                        .00 seconds
 Time for constraint functions                   .00 seconds
 Time for objective function                     .00 seconds
1
 
 SNMEMA EXIT 100 -- finished successfully
 SNMEMA INFO 104 -- memory requirements estimated

         ==============================
         S N O P T  7.2-11   (Jan 2011)
         ==============================
1
 
 Parameters
 ==========

 Files
 -----
 Solution file..........         0       Old basis file ........         0       Standard input.........         5
 Insert file............         0       New basis file ........         0       (Printer)..............         9
 Punch file.............         0       Backup basis file......         0       (Specs file)...........         0
 Load file..............         0       Dump file..............         0       Standard output........         6

 Frequencies
 -----------
 Print frequency........       100       Check frequency........        60       Save new basis map.....       100
 Summary frequency......       100       Factorization frequency        50       Expand frequency.......     10000

 QP subproblems
 --------------
 QPsolver Cholesky......
 Scale tolerance........      .900       Minor feasibility tol..  1.00E-06       Iteration limit........       200
 Scale option...........         0       Minor optimality  tol..  1.00E-06       Minor print level......         1
 Crash tolerance........      .100       Pivot tolerance........  3.25E-11       Partial price..........         1
 Crash option...........         3       Elastic weight.........  1.00E+04       Prtl price section ( A)         4
                                         New superbasics........        99       Prtl price section (-I)         5

 The SQP Method
 --------------
 Minimize...............                 Cold start.............                 Proximal Point method..         1
 Nonlinear objectiv vars         4       Objective Row..........         1       Function precision.....  1.00E-05
 Unbounded step size....  1.00E+20       Superbasics limit......         4       Difference interval....  3.16E-03
 Unbounded objective....  1.00E+15       Reduced Hessian dim....         4       Central difference int.  2.15E-02
 Major step limit.......  2.00E+00       Derivative linesearch..                 Derivative option......         1
 Major iterations limit.      1000       Linesearch tolerance...    .90000       Verify level...........         0
 Minor iterations limit.       500       Penalty parameter......  0.00E+00       Major Print Level......         1
                                         Major optimality tol...  1.00E-02

 Hessian Approximation
 ---------------------
 Full-Memory Hessian....                 Hessian updates........  99999999       Hessian frequency......  99999999
                                                                                 Hessian flush..........  99999999

 Nonlinear constraints
 ---------------------
 Nonlinear constraints..         4       Major feasibility tol..  1.00E-06       Violation limit........  1.00E+06
 Nonlinear Jacobian vars         4

 Miscellaneous
 -------------
 LU factor tolerance....      3.99       LU singularity tol.....  3.25E-11       Timing level...........         3
 LU update tolerance....      3.99       LU swap tolerance......  1.22E-04       Debug level............         0
 LU partial  pivoting...                 eps (machine precision)  2.22E-16       System information.....        No
                                                                                 Sticky parameters......        No
1
 

 

 Matrix statistics
 -----------------
               Total      Normal        Free       Fixed     Bounded
 Rows              5           0           1           4           0
 Columns           4           0           0           0           4

 No. of matrix elements                   16     Density      80.000
 Biggest  constant element        0.0000E+00  (excluding fixed columns,
 Smallest constant element        0.0000E+00   free rows, and RHS)

 No. of objective coefficients             0

 Nonlinear constraints       4     Linear constraints       1
 Nonlinear variables         4     Linear variables         0
 Jacobian  variables         4     Objective variables      4
 Total constraints           5     Total variables          4
1
 

 
 The user has defined      20   out of      20   first  derivatives

 Cheap test of user-supplied problem derivatives...

 The constraint gradients seem to be OK.

 -->  The largest discrepancy was    0.00E+00  in constraint     6
 

 The objective  gradients seem to be OK.

 Gradient projected in one direction   0.00000000000E+00
 Difference approximation              0.00000000000E+00
1
 
 

   Itns Major Minors    Step   nCon Feasible  Optimal  MeritFunction     L+U BSwap     nS  condHz Penalty
      0     0      0              1 (0.0E+00)(0.0E+00) 0.0000000E+00       5                              _  r
1
 
 SNOPTA EXIT   0 -- finished successfully
 SNOPTA INFO   1 -- optimality conditions satisfied

 Problem name                 Default
 No. of iterations                   0   Objective value      0.0000000000E+00
 No. of major iterations             0   Linear objective     0.0000000000E+00
 Penalty parameter           0.000E+00   Nonlinear objective  0.0000000000E+00
 No. of calls to funobj              2   No. of calls to funcon              2
 No. of degenerate steps             0   Percentage                        .00
 Max x                       2 6.3E+01   Max pi                      5 1.0E+00
 Max Primal infeas           0 0.0E+00   Max Dual infeas             0 0.0E+00
 Nonlinear constraint violn    0.0E+00
1
 
 Name           Default                  Objective Value      0.0000000000E+00

 Status         Optimal Soln             Iteration      0    Superbasics     0

 Objective               (Min)
 RHS
 Ranges
 Bounds

 Section 1 - Rows

  Number  ...Row.. State  ...Activity...  Slack Activity  ..Lower Limit.  ..Upper Limit.  .Dual Activity    ..i
 
       5  r      1    BS          .               .                None            None         -1.0          1
       6  r      2 D  BS          .               .               .               .               .           2
       7  r      3 D  BS          .               .               .               .               .           3
       8  r      4 D  BS          .               .               .               .               .           4
       9  r      5 D  BS          .               .               .               .               .           5
1
 
 Section 2 - Columns

  Number  .Column. State  ...Activity...  .Obj Gradient.  ..Lower Limit.  ..Upper Limit.  Reduced Gradnt    m+j
 
       1  x      1 A  FR          .19000          .               .07700          .24000          .           6
       2  x      2 A  UL        63.00000          .             20.00000        63.00000          .           7
       3  x      3 A  FR          .52000          .               .22000          .67000          .           8
       4  x      4 A  FR        42.00000          .             30.00000        90.00000          .           9
 
 Time for MPS input                              .00 seconds
 Time for solving problem                        .00 seconds
 Time for solution output                        .00 seconds
 Time for constraint functions         ************* seconds
 Time for objective function                     .00 seconds
1
 
 SNMEMA EXIT 100 -- finished successfully
 SNMEMA INFO 104 -- memory requirements estimated

         ==============================
         S N O P T  7.2-11   (Jan 2011)
         ==============================
1
 
 Parameters
 ==========

 Files
 -----
 Solution file..........         0       Old basis file ........         0       Standard input.........         5
 Insert file............         0       New basis file ........         0       (Printer)..............         9
 Punch file.............         0       Backup basis file......         0       (Specs file)...........         0
 Load file..............         0       Dump file..............         0       Standard output........         6

 Frequencies
 -----------
 Print frequency........       100       Check frequency........        60       Save new basis map.....       100
 Summary frequency......       100       Factorization frequency        50       Expand frequency.......     10000

 QP subproblems
 --------------
 QPsolver Cholesky......
 Scale tolerance........      .900       Minor feasibility tol..  1.00E-06       Iteration limit........       200
 Scale option...........         0       Minor optimality  tol..  1.00E-06       Minor print level......         1
 Crash tolerance........      .100       Pivot tolerance........  3.25E-11       Partial price..........         1
 Crash option...........         3       Elastic weight.........  1.00E+04       Prtl price section ( A)         4
                                         New superbasics........        99       Prtl price section (-I)         5

 The SQP Method
 --------------
 Minimize...............                 Cold start.............                 Proximal Point method..         1
 Nonlinear objectiv vars         4       Objective Row..........         1       Function precision.....  1.00E-05
 Unbounded step size....  1.00E+20       Superbasics limit......         4       Difference interval....  3.16E-03
 Unbounded objective....  1.00E+15       Reduced Hessian dim....         4       Central difference int.  2.15E-02
 Major step limit.......  2.00E+00       Derivative linesearch..                 Derivative option......         1
 Major iterations limit.      1000       Linesearch tolerance...    .90000       Verify level...........         0
 Minor iterations limit.       500       Penalty parameter......  0.00E+00       Major Print Level......         1
                                         Major optimality tol...  1.00E-02

 Hessian Approximation
 ---------------------
 Full-Memory Hessian....                 Hessian updates........  99999999       Hessian frequency......  99999999
                                                                                 Hessian flush..........  99999999

 Nonlinear constraints
 ---------------------
 Nonlinear constraints..         4       Major feasibility tol..  1.00E-06       Violation limit........  1.00E+06
 Nonlinear Jacobian vars         4

 Miscellaneous
 -------------
 LU factor tolerance....      3.99       LU singularity tol.....  3.25E-11       Timing level...........         3
 LU update tolerance....      3.99       LU swap tolerance......  1.22E-04       Debug level............         0
 LU partial  pivoting...                 eps (machine precision)  2.22E-16       System information.....        No
                                                                                 Sticky parameters......        No
1
 

 

 Matrix statistics
 -----------------
               Total      Normal        Free       Fixed     Bounded
 Rows              5           0           1           4           0
 Columns           4           0           0           0           4

 No. of matrix elements                   16     Density      80.000
 Biggest  constant element        0.0000E+00  (excluding fixed columns,
 Smallest constant element        0.0000E+00   free rows, and RHS)

 No. of objective coefficients             0

 Nonlinear constraints       4     Linear constraints       1
 Nonlinear variables         4     Linear variables         0
 Jacobian  variables         4     Objective variables      4
 Total constraints           5     Total variables          4
1
 

 
 The user has defined      20   out of      20   first  derivatives

 Cheap test of user-supplied problem derivatives...

 The constraint gradients seem to be OK.

 -->  The largest discrepancy was    0.00E+00  in constraint     6
 

 The objective  gradients seem to be OK.

 Gradient projected in one direction   0.00000000000E+00
 Difference approximation              0.00000000000E+00
1
 
 

   Itns Major Minors    Step   nCon Feasible  Optimal  MeritFunction     L+U BSwap     nS  condHz Penalty
      0     0      0              1 (0.0E+00)(0.0E+00) 0.0000000E+00       5                              _  r
1
 
 SNOPTA EXIT   0 -- finished successfully
 SNOPTA INFO   1 -- optimality conditions satisfied

 Problem name                 Default
 No. of iterations                   0   Objective value      0.0000000000E+00
 No. of major iterations             0   Linear objective     0.0000000000E+00
 Penalty parameter           0.000E+00   Nonlinear objective  0.0000000000E+00
 No. of calls to funobj              2   No. of calls to funcon              2
 No. of degenerate steps             0   Percentage                        .00
 Max x                       2 6.3E+01   Max pi                      5 1.0E+00
 Max Primal infeas           0 0.0E+00   Max Dual infeas             0 0.0E+00
 Nonlinear constraint violn    0.0E+00
1
 
 Name           Default                  Objective Value      0.0000000000E+00

 Status         Optimal Soln             Iteration      0    Superbasics     0

 Objective               (Min)
 RHS
 Ranges
 Bounds

 Section 1 - Rows

  Number  ...Row.. State  ...Activity...  Slack Activity  ..Lower Limit.  ..Upper Limit.  .Dual Activity    ..i
 
       5  r      1    BS          .               .                None            None         -1.0          1
       6  r      2 D  BS          .               .               .               .               .           2
       7  r      3 D  BS          .               .               .               .               .           3
       8  r      4 D  BS          .               .               .               .               .           4
       9  r      5 D  BS          .               .               .               .               .           5
1
 
 Section 2 - Columns

  Number  .Column. State  ...Activity...  .Obj Gradient.  ..Lower Limit.  ..Upper Limit.  Reduced Gradnt    m+j
 
       1  x      1 A  FR          .19000          .               .07700          .24000          .           6
       2  x      2 A  UL        63.00000          .             20.00000        63.00000          .           7
       3  x      3 A  FR          .52000          .               .22000          .67000          .           8
       4  x      4 A  FR        42.00000          .             30.00000        90.00000          .           9
 
 Time for MPS input                              .00 seconds
 Time for solving problem                        .00 seconds
 Time for solution output                        .00 seconds
 Time for constraint functions                   .00 seconds
 Time for objective function                     .00 seconds
