アットウィキロゴ

seenkle

package math;
 
import org.apache.commons.math3.optimization.*;
import org.apache.commons.math3.optimization.linear.*;
import java.util.ArrayList;
import java.util.*;
 
import org.apache.commons.math3.optimization.PointValuePair;
 
class pro{
 
public static void main(String[] args) {
 
pro test=new pro();
}
 
pro(){
 
LinearObjectiveFunction f = new LinearObjectiveFunction(new double[] { -2, 1 }, -5);
Collection constraints = new ArrayList();
constraints.add(new LinearConstraint(new double[] { 1, 2 }, Relationship.LEQ, 6));
constraints.add(new LinearConstraint(new double[] { 3, 2 }, Relationship.LEQ, 12));
constraints.add(new LinearConstraint(new double[] { 0, 1 }, Relationship.GEQ, 0));
 
PointValuePair solution = new SimplexSolver().optimize(f, constraints, GoalType.MINIMIZE, false);
 
double x = solution.getPoint()[0];
double y = solution.getPoint()[1];
double min = solution.getValue();
 
System.out.println(min);    
 
 
 
 
}
}
最終更新:2015年11月11日 16:30