shili0841.m

约束最优化

% P227 location problem: nonliear programming (10 dimensions)
format short
% LOCATION 1: (x(7),x(8)), quantity from 1: x(1:6) 
% LOCATION 2: (x(9),x(10)), quantity from 2: x(7:12)

a=[1.25 8.75  0.5  5.75   3 7.25];
b=[1.25 0.75 4.75     5 6.5 7.75];
d=[3 5 4 7 6 11]';
e=[20,20]';

%	A1=[1 0 0 0 0 0 0 0 0 0 
%      0 1 0 0 0 0 0 0 0 0
%	    0 0 1 0 0 0 0 0 0 0
%      0 0 0 1 0 0 0 0 0 0
%	    0 0 0 0 1 0 0 0 0 0
%      0 0 0 0 0 1 0 0 0 0
%      1 1 1 1 1 1 0 0 0 0
%      -1 -1 -1 -1 -1 -1 0 0 0 0]
A10=[eye(6);ones(1,6);-1*ones(1,6)];	
A1=[A20,zeros(8,4)];
B1=[d;e(1);e(2)-sum(d)];

x0=[3*rand(1,6) 5 1 2 7]; % 取原料场位置为新料场位置的初值
v1=zeros(1,10)
v2=[d',[10,10,10,10]]

opt=optimset('LargeScale','off','MaxFunEvals',1000,'MaxIter',100);
[x,f,exitflag,out]=fmincon('shili0841fun',x0,A1,B1,[],[],v1,v2,[],opt),
pause