always-cautious/ortools-clone
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

add test from #2385

Browse Source
This commit is contained in:
Laurent Perron
2021-02-08 18:20:50 +01:00
parent 548a34dbc6
commit 5359e31e46
1 changed files with 34 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

34
examples/tests/lp_test.cc
View File

@@ -129,6 +129,38 @@ void RunBooleanProgrammingExample(
SolveAndPrint(solver, {x, y}, {c0});
}
void MutableObjectiveCrash() {
LOG(INFO) << "MutableObjectiveCrash";
// Create the linear solver with the GLOP backend.
MPSolver* solver = MPSolver::CreateSolver("GLOP");
// Create the variables x and y.
MPVariable* const x = solver->MakeNumVar(0.0, 1, "x");
MPVariable* const y = solver->MakeNumVar(0.0, 2, "y");
LOG(INFO) << "Number of variables = " << solver->NumVariables();
// Create a linear constraint, 0 <= x + y <= 2.
MPConstraint* const ct = solver->MakeRowConstraint(0.0, 2.0, "ct");
ct->SetCoefficient(x, 1);
ct->SetCoefficient(y, 1);
LOG(INFO) << "Number of constraints = " << solver->NumConstraints();
// Create the objective function, 3 * x + y.
MPObjective* const objective = solver->MutableObjective();
objective->SetCoefficient(x, 3);
objective->SetCoefficient(y, 1);
objective->SetMaximization();
solver->Solve();
LOG(INFO) << "Solution:" << std::endl;
LOG(INFO) << "Objective value = " << objective->Value();
LOG(INFO) << "x = " << x->solution_value();
LOG(INFO) << "y = " << y->solution_value();
}
void RunAllExamples() {
// Linear programming problems
#if defined(USE_CLP)
@@ -179,6 +211,8 @@ void RunAllExamples() {
LOG(INFO) << "---- Boolean Integer programming example with BOP ----";
RunBooleanProgrammingExample(MPSolver::BOP_INTEGER_PROGRAMMING);
#endif // USE_BOP
MutableObjectiveCrash();
}
} // namespace operations_research