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

min cx
   Ax < b
    x > 0
   g(x) < 0 
   
   where
   
    g(x) = -x'x + d'x + g0
    
A,b =
 -6   1   1  -3  -9  -7  -0  -1   3   7   1   7   4  -2  -2       -3
 -9   3  -8   3   3  -0  -5   9   5  -2   6  -7   9  -0  -7        2
  4 -10   3   5   8   8  -8  -9   5   7  -9  -6  -5  -7   1      -12
  4  -2  -2  10  -5   8   9   5  10  -5   1   4  -6   2  -5       31
  9  -9   4  -3  -1  -9  -9   5   8  -2  -0  -7  -4   7  -0       -8
 -2  -2   8  -5   5   8   0   7  -5   1   9  -8   8   2  -1       27
  0   4   5  10  -0   0  -2  -7  -4  -1   5  -5   3   9   9       29
  7   2  -5   4  -5   0  -4 -10  -3  -4   1 -10  -7   1  -7      -38
 -9   9  -9   5  -5  -4   8   4   0  -6   8  -2   4  -7  -6       -8
  6   1   7   6   8   3   5   4   2   0   9   4   2   9   4      740
 10  -4   1  -6  -7   1   4 -13  -9   1 -11  42  -9  -1   9     1000

   
c= 
    8 
   -8
   -7
   -9
   -3
   -5
   -7
    6
   -1
   -3
   -1
    6
    9
    3
   -6

  
g0=-1.402049172453760e+05
  
d=
    -2.979422432135185e+03
     2.965900481351812e+03
     1.369920332263725e+03
     2.905065565451139e+03
     8.237406982473010e+02
     1.915705643396763e+03
     2.162650335236307e+03
    -2.168853883731023e+03
     8.916712282349198e+01
     9.693320399830612e+02
    -3.377225333061369e+01
    -1.656781541831116e+03
    -2.857739421638500e+03  
    -1.202187449223366e+03
     2.107968670535783e+03
   
   
optimal x =
    3.915918547840158e+01
    6.756097054683521e+01
    8.219528278986820e+00
                      0.0
    2.776314165040144e+01
                      0.0
    8.302645188767769e+00
    1.631177844635685e+01
    2.554087284868524e+01
    4.939029268550021e+01
                      0.0
                      0.0
                      0.0
                      0.0
                      0.0