アットウィキロゴ

Sえんj

package lp;
 
import org.apache.commons.math3.optimization.linear.*;
import java.util.ArrayList;
import org.apache.commons.math3.optimization.*;
import java.util.Collection;
 
public class pro {
 
 
    public static void main(String[] args) {
 
        double[] a=new double[2];
        a[0]=-5;
        a[1]=-4;
 
          double[] b=new double[2];
        b[0]=1;
        b[1]=2;
 
LinearObjectiveFunction f = new LinearObjectiveFunction(a, 0);
Collection constraints = new ArrayList();
constraints.add(new LinearConstraint(b, Relationship.LEQ, 80));
constraints.add(new LinearConstraint(new double[] { 4, 4}, Relationship.LEQ, 180));
constraints.add(new LinearConstraint(new double[] { 3, 1}, Relationship.LEQ, 90));
 
PointValuePair sol = new SimplexSolver().optimize(f, constraints, GoalType.MINIMIZE, false);
 
 
double[] x = sol.getPoint();
 
double min = sol.getValue();
 
System.out.println(min+","+x[0]+","+x[1]);
 
 
 
 
 
 
 
 
    }
 
}
 
最終更新:2015年04月17日 02:50