Steve Jacobsen (jacobsen@ee.ucla.edu), K. Moshirvaziri (moshir@ee.ucla.edu)
CONCAVE MININIMIZATION PROBLEM (m=10, n=20):

** This example is taken from A Collection of Test Problems for
** Constrained Global Optimization Algorithms, Springer Verlag,
** Lecture Notes in Computer Science (1990), by Floudas and Pardalos.
** The best x, stated below, found by edge search is the same as that
** reported in the above reference.

min f(x)
   Ax < b
    x > 0
    
where
    f(x) = -10*x'x
    
A,b=
 -3  7  0 -5  1  1  0  2 -1 -1 -9  3  5  0  0  1  7 -7 -4 -6    -5
  7  0 -5  1  1  0  2 -1 -1 -9  3  5  0  0  1  7 -7 -4 -6 -3     2
  0 -5  1  1  0  2 -1 -1 -9  3  5  0  0  1  7 -7 -4 -6 -3  7    -1
 -5  1  1  0  2 -1 -1 -9  3  5  0  0  1  7 -7 -4 -6 -3  7  0    -3
  1  1  0  2 -1 -1 -9  3  5  0  0  1  7 -7 -4 -6 -3  7  0 -5     5
  1  0  2 -1 -1 -9  3  5  0  0  1  7 -7 -4 -6 -3  7  0 -5  1     4
  0  2 -1 -1 -9  3  5  0  0  1  7 -7 -4 -6 -3  7  0 -5  1  1    -1
  2 -1 -1 -9  3  5  0  0  1  7 -7 -4 -6 -3  7  0 -5  1  1  0     0
 -1 -1 -9  3  5  0  0  1  7 -7 -4 -6 -3  7  0 -5  1  1  0  2     0
  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1    40
  
best found x =
0.000000000000000E+00  
0.000000000000000E+00
2.880239734156187E+01
0.000000000000000E+00
0.000000000000000E+00
4.179207215760750E+00
0.000000000000000E+00
0.000000000000000E+00
0.000000000000000E+00
0.000000000000000E+00
0.000000000000000E+00
0.000000000000000E+00
0.000000000000000E+00
0.000000000000000E+00
6.186802753382379E-01
4.093282696415836E+00
0.000000000000000E+00
2.306432470923359E+00
0.000000000000000E+00
0.000000000000000E+00