运筹学建模0-1规划求最大最小值的代码实现

x1+x2+x3+x4+x5>=2
x3+x5+x6+x8+x9>=3
x4+x6+x7+x9>=2
x1+x2>=2*x3
x4<=x7
x1+x2>=2*x5
x6<=x7

x1+x2>=2x9
x8<=x5

且x1-x9只能为0或1，求sum=x1+x2+x3+x4+x5+x6+x7+x8+x9的最小值

我们可以用java代码进行实现

import java.util.Random;
public class yuyin2 {
	public static void main(String[] args) {
		int sum=0,h=20;
		for(int z=0;z<10000;z++) {		
				Random r=new Random();
				int x1=r.nextInt(2);
				int x2=r.nextInt(2);
				int x3=r.nextInt(2);
				int x4=r.nextInt(2);
				int x5=r.nextInt(2);
				int x6=r.nextInt(2);
				int x7=r.nextInt(2);
				int x8=r.nextInt(2);
				int x9=r.nextInt(2);
			    if( x1+x2+x3+x4+x5>=2
					&&x3+x5+x6+x8+x9>=3
					&&x4+x6+x7+x9>=2
					&&x1+x2>=2*x3
					&&x4<=x7
					&&x1+x2>=2*x5
					&&x6<=x7
					&&x8<=x5
					&&x1+x2>=2*x9
					) {
			    	 sum=x1+x2+x3+x4+x5+x6+x7+x8+x9;
			    	 if(h>sum) {
			    		 h=sum;
			    	 }
			    	 }    
		}
		     System.out.println("最小值为:"+h);
			}
			}