(完整word版)优化设计Matlab编程作业.docVIP

i   ——W—l z r? Q ■ a 9（ ） ic □ 卜 1004^ ㈣ ▼ 4Qji frflu-]蓦」j fi] IK!3Ev 无约束优化 22 min f(x)= x1 +x2-2 x1x2 -4x1 初选 x0=[1,1] 程序： Step 1: Write an M-file objfun1.m. function f1=objfun1(x) f1=x ⑴ A2+2*x (2) A2-2*x(1)*x (2) -4*x(1); Step 2: Invoke one of the unconstrained optimization routines x0=[1,1]; options = optimset(LargeScale,off); [x,fval,exitflag,output] = fminunc(@objfun1,x0,options) 运行结果： x = 4.0000 2.0000 fval = -8.0000 exitflag = 1 output = iterations: 3 funcCount: 12 stepsize: 1 firstorderopt: 2.3842e-007 algorithm: medium-scale: Quasi-Newton line search message: [1x85 char] 非线性有约束优化 22 1. Min f(x)=3 x1 + x2 +2 x1-3 x2 +5 Subject to: g1 (x)= x1+ x2 +1^ 0 g 2 (x)=5 Xi-3 X2-25 _ 0 g3 (x)=13 X1-41 X2 _ 0 g 4 (x)=14 _ x1 _ 130 g 5 (x)=2 岂 X2 乞 57 初选 x0=[10,10] Step 1: Write an M-file objfun 2.m fun cti on f2=objfu n2(x) f2=3*x(1)A2+x(2)A2+2*x(1)-3*x(2)+5; Step 2: Write an M-file confunl.m for the constraints. fun cti on [c,ceq]=c onfun 1(x) % Non li near in equality con strai nts c=[x(1)+x(2)+18; 5*x(1)-3*x(2)-25; 13*x(1)-41*x(2)A2; 14-x(1); x(1)-130; 2-x(2); x(2)-57]; % Non li near in equality con strai nts ceq=[]; Step 3: Invoke constrained optimization routine x0=[10,10]; % Make a starting guess at the solution opti ons = optimset(LargeScale,off); [x, fval]=... fmi ncon(@ objfu n2,x0,[],[],[],[],[],[],@co nfun 1,optio ns) 运行结果： x = 3.6755 -7.0744 fval = 124.14952. min f (x) = 4x；亠 5x； s.t. g1 (x) = 2x1 3x2「6 乞 0 g2(x)二 x1x2 1 _ 0 初选 x0=[1,1] Step 1: Write an M-file objfun 3.m fun cti on f=objfu n3(x) f=4*x(1)A2+5*x(2)A2 Step 2: Write an M-file confun3.m for the constraints. fun cti on [c,ceq]=c onfun 3(x) %No nlin ear in equality con strai nts c=[2*x(1)+3*x(2)-6; -x(1)*x(2)-1]; % Non li near equality con strai nts ceq[]; Step 3: Invoke constrained optimization routine x0=[1,1];% Make a start ing guess at the soluti on opti ons = optimset(LargeScale,off); [x, fval]=... fmincon (@objfu n,x0,[],[],[],[],[],[],@co nfun ,optio ns) 运行结果： Optimizati on term