急！！！用Lingo软件求解线性规划问题
目标函数：max u ;
约束条件：((x1*0.0096+x2*0.0114+x3*0.0108+x4*0.0113+x5*0.0096+x6*0.0073+x7*0.0108+x8*0.0095+x9*0.0096+x10*0.0088)-0.00175)/(0.09-0.00175)>=u;
(0.6645-(x1*0.3934+x2*0.4739+x3*0.4629+x4*0.4983+x5*0.4540+x6*0.3498+x7*0.5296+x8*0.4925+x9*0.4882+x10*0.4535))/(0.6645-0.01)>=u;
x1+x2+x3+x4+x5+x6+x7+x8+x9+x10=1;
x1>0;x1<1;
x2>0;x2<1;
x3>0;x3<1;
x4>0;x4<1;
x5>0;x5<1;
x6>0;x6<1;
x7>0;x7<1;
x8>0;x8<1;
x9>0;x9<1;
x10>0;x10<1;
求解使得u（0<u<1,）最大的解（x1,x2,x3,......,x10），u最好接近1。（x1,x2,x3,......,x10）最好每个都有值。因为是投资分配的问题。
如果哪位大侠可以用matlab软件或者maple解出来也可以，谢谢啦！
线性规划问题，按照你的提供的模型，略微修改即可得到可供LINGO求解的程序，见附件。运行后得到最优解如下：
Global optimal solution found.
Objective value: 0.1093484
Infeasibilities: 0.000000
Total solver iterations: 2
Model Class: LP
Total variables: 11
Nonlinear variables: 0
Integer variables: 0
Total constraints: 24
Nonlinear constraints: 0
Total nonzeros: 53
Nonlinear nonzeros: 0
Variable Value Reduced Cost
U 0.1093484 0.000000
X1 0.000000 0.1926346E-01
X2 1.000000 0.000000
X3 0.000000 0.5665722E-02
X4 0.000000 0.000000
X5 0.000000 0.1926346E-01
X6 0.000000 0.4532578E-01
X7 0.000000 0.5665722E-02
X8 0.000000 0.2039660E-01
X9 0.000000 0.1926346E-01
X10 0.000000 0.2832861E-01
Row Slack or Surplus Dual Price
1 0.1093484 1.000000
2 0.000000 -1.000000
3 0.1818662 0.000000
4 0.000000 0.1280453
5 0.000000 0.000000
6 1.000000 0.000000
7 1.000000 0.000000
8 0.000000 0.1133144E-02
9 0.000000 0.000000
10 1.000000 0.000000
11 0.000000 0.000000
12 1.000000 0.000000
13 0.000000 0.000000
14 1.000000 0.000000
15 0.000000 0.000000
16 1.000000 0.000000
17 0.000000 0.000000
18 1.000000 0.000000
19 0.000000 0.000000
20 1.000000 0.000000
21 0.000000 0.000000
22 1.000000 0.000000
23 0.000000 0.000000
24 1.000000 0.000000