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

min cx
   Ax < b
    x > 0
   g(x) < 0 
   
   where
   
    g(x) = -x'x + d'x + g0
    
A,b =
   -6   1   1  -3  -9            2 
   -9   3  -8   3   3           10 
    4 -10   3   5   8           28 
    4  -2  -2  10  -5           23 
    9  -9   4  -3  -1           18 
   -2  -2   8  -5   5           23 
    0   4   5  10  -0           37 
    7   2  -5   4  -5           21 
   -9   9  -9   5  -5            9 
    2   5   9   9   1          440 
  -66  87 -240 1076 -87       1000 
 

   
c=  0   
    0
   -4
   10
    0
  
g0=-8.149305040539678e+02  
  
d=
    5.815054691101734e+00  
   -2.238457301202428e+01
    3.358969200974813e+02
   -1.013908834814289e+03
   -5.821950894264603e-01
   
   
optimal x =
    6.686046511627886e+00
    5.499999999999986e+00
    3.000000000000008e+00
    0.0                  
    4.674418604651140e+00