带有OR条件的Apache common SimplexSolver LinearConstraint

import org.apache.commons.math3.optim.*;
import org.apache.commons.math3.optim.linear.*;
import org.apache.commons.math3.optim.nonlinear.scalar.GoalType;
import org.apache.commons.math3.optim.nonlinear.scalar.ObjectiveFunction;
import org.apache.commons.math3.optim.nonlinear.scalar.ObjectiveFunctionGradient;

public class LinearProgrammingExample {
    public static void main(String[] args) {
        // 定义决策变量
        Variable x = new Variable("x");
        Variable y = new Variable("y");

        // 定义目标函数
        LinearObjectiveFunction objectiveFunction = new LinearObjectiveFunction(
                new double[]{3, 4}, 0);

        // 定义约束条件
        LinearConstraint constraint1 = new LinearConstraint(
                new double[]{1, 0}, Relationship.GEQ, 1);
        LinearConstraint constraint2 = new LinearConstraint(
                new double[]{0, 1}, Relationship.GEQ, 1);
        LinearConstraint constraint3 = new LinearConstraint(
                new double[]{-1, -1}, Relationship.LEQ, -1);

        // 定义线性规划问题
        LinearConstraintSet constraints = new LinearConstraintSet(
                new LinearConstraint[]{constraint1, constraint2, constraint3});
        OptimizationData[] optimizationData = {
                objectiveFunction,
                constraints,
                GoalType.MAXIMIZE
        };
        SimplexSolver solver = new SimplexSolver();
        PointValuePair solution = solver.optimize(optimizationData);

        // 输出结果
        System.out.println("x = " + solution.getPoint()[0]);
        System.out.println("y = " + solution.getPoint()[1]);
    }
}