max = 3 1.59 * x 1+35.79 * x2+76.0 1 * x3+3 1.82 * x4+32.42 * X5+99.65 * X6+99.65 * x7+34.78 * x8+29.63 * x9+40.34 * x 10.265430

x 1+x2+x3+x3+X5+X6+x7+x8+x9+x 10+x 16+x 12 = 65823 1.30；

235423.60 & lt= x 1；

x 1 & lt； =242095.3;

9332.4 & lt= x2

x2 & lt= 10359;

86 183.6<= x3

x3 & lt=9 1 138.73;

x4 & lt=46.7;

82563.5 & lt= x5

x5 & lt= 103204.4;

X6+x7 & lt； = 132988.4;

80694.2 & lt= x6

x6 & lt= 10985 1.24;

x7 & lt=52294.2;

x8 & gt= 13693.7;

x9 & gt= 18448.4;

x 10 & gt； =88 14.4;

47967.3 1 & lt； = x 1 1；

x 1 1 & lt； =48977. 14;

4 100 & lt； = x 12；

x 12 & lt； = 10 127.2;

end

Then there is no feasible plan. There is no way. Your constraint is not a feasible solution. See for yourself whether the constraints are correct.