目标规划特有的目标约束称为什么

目标规划特有的目标约束称为什么

软约束
目标约束是目标规划特有的，可把约束右端项看作要追求的目标值。在达到此目标值时允许发生正或负偏差，因此在这些约束中加入正、负偏差变量，它们是软约束。

function f=myfun(x) f=0.192457*10^(-4)*(x(2)+2)*x(1)^2*x(3); function [c,cep]=mycon(x) c(1)=350-163*x(1)^(-2.86)*x(3)^0.86; c(2)=10-0.14*0.01*x(1)^-4*x(2)*x(3)^3; c(3)=(x(2)+1.5)*x(1)+0.44*0.01*x(1)^(-4)*x(2)*x(3)^3-3.7*x(3); c(4)=375-0.356*10^6*x(1)*x(2)^(-1)*x(3)^(-2); c(5)=4-x(3)/x(1); cep=[]; ----------------------------------- a=[-1 0 0 1 0 0 0 -1 0 0 1 0 0 0 -1 0 0 1]; b=[-1;4;-4.5;50;-10;30]; x0=[2.0;5.0;25.0]; lb=zeros(3,1); [x,fval,exitflag,output,lambda]=fmincon(@myfun,x0,a,b,[],[],lb,[],@mycon) warning: trust-region-reflective method does not currently solve this type of problem, using active-set (line search) instead. > in fmincon at 439 local minimum possible. constraints satisfied. fmincon stopped because the size of the current search direction is less than twice the default value of the step size tolerance and constraints were satisfied to within the default value of the constraint tolerance. active inequalities (to within options.tolcon = 1e-006): lower upper ineqlin ineqnonlin 1 3 x = 1.0000 4.5000 11.7155 fval = 0.0015 exitflag = 4 output = iterations: 5 funccount: 20 lssteplength: 1 stepsize: 6.1230e-007 algorithm: 'medium-scale: sqp, quasi-newton, line-search' firstorderopt: 1.2510e-004 constrviolation: 0 message: [1x817 char] lambda = lower: [3x1 double] upper: [3x1 double] eqlin: [0x1 double] eqnonlin: [0x1 double] ineqlin: [6x1 double] ineqnonlin: [5x1 double]