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

** This example is taken from Global Optimization (by Horst and Tuy), P.249
** The best x, stated below, found by edge-search is different from that 
** reported in the above reference.

min f(x)
   Ax < b
    x > 0
    
where
    f(x) = -(e'x)**1.5 + 0.1*(f'x + g)**2
    
A,b=
 1.2  1.4   .4   .8        6.8
 -.7   .8   .8    0         .8
   0  1.2    0   .4        2.1
 2.8 -2.1   .5    0        1.2
  .4  2.1 -1.5  -.2        1.4
 -.6 -1.3  2.4   .5         .8
 
e=
1.0        
0.5        
0.66666667 
0.75 

f=
 1.0 
-0.5
 0.3 
 1.0
 
 g=-4.2
 
best found x =
7.903846153846155E-01
4.824175824175826E-01
0.000000000000000E+00
3.802747252747253E+00