LOCAL PROBLEM = problem01  Best local minimum:  2.931083072094414d-02 (6)
LOCAL PROBLEM = problem02a Best local minimum: -4.000000000219420d+02 (4)
LOCAL PROBLEM = problem02b Best local minimum: -6.000000000000023d+02 (9)
LOCAL PROBLEM = problem02c Best local minimum: -7.500000000094735d+02 (9)
LOCAL PROBLEM = problem02d Best local minimum: -4.000000000018445d+02 (7)
LOCAL PROBLEM = problem03a Best local minimum: -3.880823580776311d-01 (1)
LOCAL PROBLEM = problem03b Best local minimum: -3.888114342917279d-01 (9)
LOCAL PROBLEM = problem04  Best local minimum: -6.666666666666667d+00 (7)
LOCAL PROBLEM = problem05  Best local minimum:  2.011593340608648d+02 (3, 7infeas)
LOCAL PROBLEM = problem06  Best local minimum:  3.762919323265911d+02 (10)
LOCAL PROBLEM = problem07  Best local minimum: -2.828427124746190d+00 (10)
LOCAL PROBLEM = problem08  Best local minimum: -1.170000000000000d+02 (2)
LOCAL PROBLEM = problem09  Best local minimum: -1.340190355505064d+01 (1)
LOCAL PROBLEM = problem10  Best local minimum:  7.417819581954519d-01 (1,9infeas)
LOCAL PROBLEM = problem11  Best local minimum: -5.000000010138400d-01 (10)
LOCAL PROBLEM = problem12  Best local minimum: -1.673889318439464d+01 (10)
LOCAL PROBLEM = problem13  Best local minimum:  1.893465728931372d+02 (10)
LOCAL PROBLEM = problem14  Best local minimum: -4.514201651361934d+00 (10)
LOCAL PROBLEM = problem15  Best local minimum:  0.000000000000000d+00 (7, 3infeas)
LOCAL PROBLEM = problem16  Best local minimum:  7.049249272475995d-01 (10)
LOCAL PROBLEM = prodpl0    Best local minimum:  6.091923647619048d+01 (10)
LOCAL PROBLEM = prodpl1    Best local minimum:  5.303701505558153d+01 (10)
LOCAL PROBLEM = optmass    Best local minimum: -1.895425000000000d-01 (10)