lingo求解约束条件连续变化情况下的规划问题
模型如下
min=0.0108*x1^2+0.0584*x2^2+0.0942*x3^2+0.0248*x1*x2+0.1108*x2*x3+0.0262*x3*x1;
1.0891*x1+1.2137*x2+1.2346*x3>=1.1(从1.1变到2,步长0.01);
x1+x2+x3=1;
如何编程求解 要求输出每一步的变量值x1 x2 x3