当前位置: 首页 > 工具软件 > Choco-solver > 使用案例 >

java批量加入约束_java-求解带约束的多元方程-Choco

燕刚毅
2023-12-01

我想用这样的离散值求解非线性多变量方程:

x*y + z + t - 10 = 0

有约束:

10 < x < 100

等等..

我正在尝试使用Choco库来做,但是我有点迷茫.

我发现此代码:

// 1. Create a Solver

Solver solver = new Solver("my first problem");

// 2. Create variables through the variable factory

IntVar x = VariableFactory.bounded("X", 0, 5, solver);

IntVar y = VariableFactory.bounded("Y", 0, 5, solver);

// 3. Create and post constraints by using constraint factories

solver.post(IntConstraintFactory.arithm(x, "+", y, "

// 4. Define the search strategy

solver.set(IntStrategyFactory.lexico_LB(x, y));

// 5. Launch the resolution process

solver.findSolution();

//6. Print search statistics

Chatterbox.printStatistics(solver);

但我不明白我将方程式放在哪里.

解决方法:

是的,更准确地说,您应该将方程分解为几个约束:

10 < x < 100

变成

solver.post(ICF.arithm(x,">",10));

solver.post(ICF.arithm(x,"

x*y + z + t - 10 = 0

变成

// x*y = a

IntVar a = VF.bounded("x*y",-25,25,solver);

solver.post(ICF.times(x,y,a);

// a+z+t=10

IntVar cst = VF.fixed(10,solver);

solver.post(ICF.sum(new IntVar[]{a,z,t},cst));

最好,

请与我们联系以获取有关Choco Solver的更多支持:www.cosling.com

标签:equation-solving,java,choco

来源: https://codeday.me/bug/20191119/2034220.html

 类似资料: