Steve Jacobsen (jacobsen@ee.ucla.edu), Khosrow Moshirvaziri (moshir@ee.ucla.edu) LINEAR REVERSE CONVEX MINIMIZATION PROBLEM (m=11, n=40): min cx Ax < b x > 0 g(x) < 0 where g(x) = -(q'x)**1.5 + d'x + g0 A,b = -8 3 -2 3 3 -6 -1 7 3 -7 3 -4 1 7 -10 4 1 -4 9 4 1 -4 -9 7 -5 2 -10 1 7 5 -6 4 -3 7 4 -7 0 6 -2 -6 11 3 10 -2 0 -8 -3 5 -6 -5 -5 -6 -6 -4 -8 5 5 -1 5 -8 8 -5 -7 4 -0 -8 1 -7 0 -4 4 -1 7 -7 -3 -7 -9 -1 6 1 7 -37 -8 7 -4 4 -1 2 -3 -1 -2 3 -5 -1 1 -8 10 -5 -0 10 -9 4 6 9 -6 -7 -9 8 -8 4 -7 -9 4 -0 -1 2 -8 -8 8 -10 -9 9 -25 4 -4 2 -9 -7 -5 1 2 2 -3 6 4 -7 5 -8 -2 -4 7 -5 -5 6 0 -8 7 8 10 10 3 9 -10 7 -4 -2 -6 1 -9 0 -8 -4 8 10 -3 -2 -2 -9 -4 -7 -9 2 2 -9 3 -7 7 1 2 3 -4 -4 9 -4 0 -2 9 -5 7 1 -8 -4 4 -4 -8 -10 -5 -6 0 -10 6 -2 -10 0 -67 -5 -8 9 -1 3 1 -0 -3 -7 -1 -5 4 3 -9 8 -3 -7 2 5 -0 -8 -3 2 8 -8 6 -5 10 -10 2 -5 -9 1 1 -0 -4 -2 3 1 -5 -28 -5 7 -3 9 10 2 4 3 6 -2 6 -0 2 -0 9 2 9 -6 -7 0 -6 8 7 6 -2 7 -10 -1 -1 -2 8 1 2 -7 -9 9 6 7 -8 -7 71 2 0 3 -1 -1 4 -3 -2 8 4 9 3 4 8 2 0 -4 8 7 -8 6 2 7 5 3 -7 -2 9 2 2 1 10 8 -8 -6 2 7 -8 -5 8 94 -2 9 7 -10 -2 -9 -2 3 -10 -7 4 2 8 -8 6 -8 4 -4 -2 -8 -1 -1 -1 -5 1 -5 -5 -7 -6 5 -9 -4 -0 4 5 3 -8 4 3 7 -33 6 4 5 2 9 8 5 2 9 5 7 4 6 5 1 4 6 5 3 8 9 2 1 8 3 5 10 7 10 7 7 5 0 7 1 3 1 4 6 1 2190 42 128 82 117 120 64 182 139 134 181 143 117 237 24646 162 27181 77 133 107 214 96 107 107 36 93 91 45 70 139 3035 4 269 243 15 153 -164 -127 85 -2009 -552 100000 c = -8 9 6 8 -5 5 3 -8 2 -4 -3 8 -10 1 9 9 5 7 9 -1 -10 8 -5 1 -5 7 -1 6 3 -2 6 -3 7 -5 1 -4 4 -2 7 9 d = 4.313049467067943e+01 -3.782406163668632e+02 3.715193441728447e+01 -1.455326555215743e+02 5.573828182718071e+01 -5.683389731834512e+01 -9.303272786564104e+01 4.011432650662465e+01 6.485612714137687e+01 -4.107464444458817e+01 1.141234062743205e+02 3.689000264132103e+01 -6.746682785842070e+01 2.279550968021632e+02 -3.808793859832978e+02 -4.458541801089127e+01 -9.358728318614786e+01 -3.085040011791410e+02 2.356973700324994e+02 -2.793710584407878e+02 -1.153199392323009e+02 -3.609492701724804e+02 -3.270585446775930e+01 7.715325235394687e+01 7.290129647207598e+01 -2.325087058271584e+02 2.101594367549083e+02 -1.364902630827646e+02 1.412456342109986e+02 -2.742214610584917e+00 -1.060637374361445e+02 -1.881615412938378e+02 5.178260786116547e+01 6.139223605726063e+01 2.443700326665352e+02 1.750499373839863e+02 -2.095372153049215e+02 -2.017174879226371e+01 7.116661980169171e+01 -1.726107555806317e+02 q = 1.000000000000000e+000 5.000000000000000e-001 6.666666666666666e-001 7.500000000000000e-001 8.000000000000000e-001 8.333333333333334e-001 8.571428571428571e-001 8.750000000000000e-001 8.888888888888888e-001 9.000000000000000e-001 9.090909090909090e-001 9.166666666666666e-001 9.230769230769232e-001 9.285714285714286e-001 9.333333333333334e-001 9.375000000000000e-001 9.411764705882352e-001 9.444444444444444e-001 9.473684210526316e-001 9.500000000000000e-001 9.523809523809524e-001 9.545454545454546e-001 9.565217391304348e-001 9.583333333333334e-001 9.600000000000000e-001 9.615384615384616e-001 9.629629629629630e-001 9.642857142857144e-001 9.655172413793104e-001 9.666666666666666e-001 9.677419354838710e-001 9.687500000000000e-001 9.696969696969698e-001 9.705882352941176e-001 9.714285714285714e-001 9.722222222222222e-001 9.729729729729730e-001 9.736842105263158e-001 9.743589743589744e-001 9.750000000000000e-001 g0 = 4.339674174658539e+04 optimal x = x(1) = 8.155016349474269e+01 x(8) = 2.057308515244313e+02 x(10) = 5.123312512813816e+01 x(13) = 2.314372157393630e+01 x(15) = 7.842539787503377e+00 x(20) = 9.253263052405454e+01 x(21) = 4.025138619197544e+00 x(23) = 4.663625612133282e+01 x(35) = 6.222918320855358e+00 x(40) = 5.702035490361718e+01 all other x's = 0.0