优化设计混合惩罚函数法程序.doc

源程序：package HyBrid;public class hybrid public static int count=1;public static double x=1,30;public static double r=3,c=0.7,w1=0;public static double dv=new double2;public static double x1=new double2;public double function(double x1,double x2)/目标函数return 120*x1+x2;public double g1(double x1,double x2)/约束条件一double G1=-x1;return G1;public double g2(double x1,double x2)/约束条件二double G2=-x2;return G2;public double g3(double x1,double x2)/约束条件三double G3=1-0.25*x2;return G3; public double g4(double x1,double x2)/约束条件四double G4=1-7*x1*x2/45;return G4;public double g5(double x1,double x2)/约束条件五double G5=1-7*Math.pow(x1,3)*x2/45;return G5;public double g6(double x1,double x2)/约束条件六double G6=1-Math.pow(x2,2)*x1/320;return G6;public double fun(double x,double r)/构建惩罚函数double FUN=0;double f=function(x0,x1);double g10=g1(x0,x1);double g20=g2(x0,x1);double g30=g3(x0,x1);double g40=g4(x0,x1);double g50=g5(x0,x1);double g60=g6(x0,x1);/*判断条件一的正负*/if(g100)FUN-=r/g10;elseFUN+=(1.0/r)*Math.pow(g10,2);/*判断条件二的正负*/if(g200)FUN-=r/g20;elseFUN+=(1.0/r)*Math.pow(g20,2);/*判断条件三的正负*/if(g300)FUN-=r/g30;elseFUN+=(1/r)*Math.pow(g30,2);/*判断条件四的正负*/if(g400)FUN-=r/g40;elseFUN+=(1/r)*Math.pow(g40,2);/*判断条件五的正负*/if(g500)FUN-=r/g50;elseFUN+=(1/r)*Math.pow(g50,2);/*判断条件六的正负*/if(g600)FUN-=r/g60;elseFUN+=(1/r)*Math.pow(g60,2);return f+FUN;public double reflect(double a,double x3,double xh)/反射double result1=new double2;result10=x30+a*(x30-xh0);result11=x31+a*(x31-xh1);return result1;public double stretch(double c,double x3,double x4)/延伸double result2=new double2;result20=x30+c*(x40-x30);result21=x31+c*(x41-x31);return result2;public double shrink(double b,double x3,double xh)/收缩double result3=new double2;result30=x30+b*(xh0-x30);result31=x31+b*(xh1-x31);return result3;public void narrow(double x0,double x1,double x2,double xe)/缩小x00=0.5*(x00+xe0);x01=0.5*(x01+xe1);x10=0.5*(x10+xe0);x11=0.5*(x11+xe1);x20=0.5*(x20+xe0);x21=0.5*(x21+xe1);public double simple(double x)/存放初始点double a=1.12,eps=0.0001;/初试步长、精度double resX=new double2;/存放最小值点int max=0,mid=0,min=0;double fmax=-1000,fmin=1000,fmid=0;/分别标记三个点中的好点、坏点、不坏不好点hybrid s=new hybrid();double number=new double72;number0=new double2;/number0存放起点x0number00=x0;number01=x1;number1=new double2;/number1存放点x1number10=0.9659*a+number00;number11=0.2588*a+number01;number2=new double2;/number2存放点x2number20=0.2588*a+number00;number21=0.9659*a+number01;for(int i=0;ifmax)max=i;fmax=s.fun(numberi,r);else if(s.fun(numberi,r)fmin)min=i;fmin=s.fun(numberi,r);for(int j=0;jeps|Math.abs(s.fun(number1,r)-s.fun(number3,r)eps|Math.abs(s.fun(number2,r)-s.fun(number3,r)eps)for(int i=0;ifmax)max=i;fmax=s.fun(numberi,r);else if(s.fun(numberi,r)fmin)min=i;fmin=s.fun(numberi,r);for(int j=0;js.fun(numbermin,r) & s.fun(number4,r)s.fun(numbermid,r)numbermax0=number40;numbermax1=number41;fmax=s.fun(number4,r);else if(s.fun(number4,r)s.fun(numbermin,r)number5=s.stretch(2, number3, number4);if(s.fun(number5,r)=fmax)number6=s.shrink(0.5, number3,numbermax);if(s.fun(number6,r)fmax)s.narrow(number0,number1,number2,numbermin);elsenumbermax0=number60;numbermax1=number61;fmax=s.fun(number6,r);else if(s.fun(number4,r)s.fun(numbermid,r)numbermax0=number40;numbermax1=number41;fmax=s.fun(number4,r);number6=s.shrink(0.5, number3,numbermax);if(s.fun(number6,r)fmax)s.narrow(number0,number1,number2,numbermin);elsenumbermax0=number60;numbermax1=number61;fmax=s.fun(number6,r);System.out.printf(第+count+次单纯形优化结果：x1=+%-5.4ft+x2=+%-5.4ft+f（x1,x2）=+%-5.4ftnn,numbermin0,numbermin1,s.function(numbermin0,numbermin1);resX0=numbermin0;resX1=numbermin1;return resX;public static void mai