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

** This example is taken from "Modification, Implementation and Comparison
** Of Three Algorithms for Globally Solving Linearly Constrained Concave
** Minimization Problems", Computing 42, 271-289 (1989), by Horst and Thoai.
** 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
    
A,b=
  0.795137  0.225733  0.371307  0.225064  0.878756      4.242372
 -0.905037 -0.638848 -0.134430 -0.921211  0.150370     -1.785220
  0.905037  0.248231  0.278197  0.376265 -0.597468      3.213560
  0.762043 -0.304755 -0.012345 -0.394312 -0.792129      1.205676
  0.564347  0.746523 -0.822105 -0.892331 -0.922916     -0.891062
 -0.954276 -0.196016  0.242000  0.797313 -0.147119     -0.066698
  0.747682  0.912055 -0.529338  0.243496  0.279402      2.286079
 -0.109599  0.727219 -0.741781 -0.058455  0.749470      0.521564
  0.209106 -0.074202 -0.022484 -0.144214 -0.735169     -0.730516
  
e=
1.000000000000000e+000  
5.000000000000000e-001
6.666666666666666e-001
7.500000000000000e-001
8.000000000000000e-001

best found x =
4.096432466036950e-01
5.601116681523931e+00
6.135399681147060e+00
0.000000000000000e+00
4.258016748075255e-01