Steve Jacobsen (jacobsen@ee.ucla.edu), Khosrow Moshirvaziri (moshir@ee.ucla.edu)
LINEAR REVERSE CONVEX MINIMIZATION PROBLEM (m=30, n=10):

min cx
   Ax < b
    x > 0
   g(x) < 0 
   
   where
   
    g(x) = -x'x + d'x + g0
    
A,b =
  -6    5   -4   -3   -5   -1   -1   -8   -1   -6        -16 
  -9   -3   10    0  -10    9   -3   -2   -4   -6         -5 
   4    3   -0    2   -2   -7   -1    2    0   -8          3 
   4    5   -5    7   -9   -6    6    8    8   -2         27 
   9   10   -8   -2    4   -4    9   -1   -1    9         36 
  -2   -3    9    7    9    3    3    5   -1    9         50 
   0   -5   -9   -5   -5   -7   -6    7    6   -2        -13 
   7   10    0   -2   -6    3    4    4   -3   -5         24 
  -9    4   -2    1   -4    2    8    6   -6    4         17 
  -9    5   -4   -1    8    6   -5    4   10   -4         22 
   1    3    8   -4    3   -5    7    5   -7    6         28 
   3   -9    1   -6   -7   -0   -1  -10    3    6         -8 
 -10    3   -1   -7    4   -2    0    8    2   -2          7 
  -2    8    9    1   -2   -6    2    0  -10   -4          8 
  -9   -5   -9    6   -2   -9    6   -1  -10   -6        -26 
  -2   -1    5   -9   -0    8    5   -9    5  -10          5 
   4    5    5    1   -7   -1   -1    4    5   -6         20 
   2   -0    7   -0    2   -7    9   -0   -4   10         29 
   9   -5   -7    9    7    9    3    3   -2   -5         32 
   7   -5  -10    5    2   -2   -1    4    4    6         22 
   1   -3    4    1    9   -7    6   -6    4   -7         13 
  -8   -7    7    8    1    8    4    8   -6   -2         25
   3   -0    3    2   -7   -8    4    7    7    2         25
  -2    8    5    7   10   -7   10    8    4   -6         48
   4    8    5   -7   -2   -9    9    1    7    7         35
   8   -9   10   -6   -7   -3    7   -7   -8   -7         -9
   5    8    8    4    1   -5   -4   -1   -8   10         30
  -5    0   -5   -7   -5   -7    1   10    5   -5         -7
   1    2    6    7    8    7    8    7    6    1        650
-790 -805  524 -1285 735 1352 -1350 -825 -1517 740      1000


c =
 -5
 -4
  4
 -8
  5
  1
  1
  2
 -3
  4
    
d =
 5.339215155039643e+03 
 4.241612907161644e+03
-4.298563096480741e+03
 8.551359894573105e+03
-5.406312101593369e+03 
-1.062154296594876e+03 
-1.097418450798856e+03
-2.127124120818493e+03 
 3.209129817786450e+03
-4.281833633254211e+03


g0 =-2.756649786791826e+04


optimal x =
   1.992658942567532e+00
   2.060829556048932e+00
   1.102412968238718e+00
   2.245640978991363e+00
   1.504467121322874e+00
   1.081788349178762e+00
   3.207867185017546e-01
                     0.0
   2.314245757625296e+00
   9.449788736476024e-01