2025-08-21 13:56:24 +02:00
|
|
|
// Copyright 2010-2025 Google LLC
|
|
|
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
|
|
|
// you may not use this file except in compliance with the License.
|
|
|
|
|
// You may obtain a copy of the License at
|
|
|
|
|
//
|
|
|
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
|
|
|
//
|
|
|
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
|
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
|
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
|
|
|
// See the License for the specific language governing permissions and
|
|
|
|
|
// limitations under the License.
|
|
|
|
|
|
2018-02-02 17:35:18 +01:00
|
|
|
#include <ortools/linear_solver/linear_solver.h>
|
|
|
|
|
#include <ortools/linear_solver/linear_solver.pb.h>
|
|
|
|
|
|
2022-09-30 18:08:44 +02:00
|
|
|
#include <iostream>
|
|
|
|
|
|
2018-02-02 17:35:18 +01:00
|
|
|
namespace operations_research {
|
|
|
|
|
void RunLinearExample(
|
2022-09-30 18:08:44 +02:00
|
|
|
MPSolver::OptimizationProblemType optimization_problem_type) {
|
2018-02-02 17:35:18 +01:00
|
|
|
MPSolver solver("LinearExample", optimization_problem_type);
|
|
|
|
|
const double infinity = solver.infinity();
|
|
|
|
|
// x and y are non-negative variables.
|
|
|
|
|
MPVariable* const x = solver.MakeNumVar(0.0, infinity, "x");
|
|
|
|
|
MPVariable* const y = solver.MakeNumVar(0.0, infinity, "y");
|
|
|
|
|
// Objective function: 3x + 4y.
|
|
|
|
|
MPObjective* const objective = solver.MutableObjective();
|
|
|
|
|
objective->SetCoefficient(x, 3);
|
|
|
|
|
objective->SetCoefficient(y, 4);
|
|
|
|
|
objective->SetMaximization();
|
|
|
|
|
// x + 2y <= 14.
|
|
|
|
|
MPConstraint* const c0 = solver.MakeRowConstraint(-infinity, 14.0);
|
|
|
|
|
c0->SetCoefficient(x, 1);
|
|
|
|
|
c0->SetCoefficient(y, 2);
|
|
|
|
|
|
|
|
|
|
// 3x - y >= 0.
|
|
|
|
|
MPConstraint* const c1 = solver.MakeRowConstraint(0.0, infinity);
|
|
|
|
|
c1->SetCoefficient(x, 3);
|
|
|
|
|
c1->SetCoefficient(y, -1);
|
|
|
|
|
|
|
|
|
|
// x - y <= 2.
|
|
|
|
|
MPConstraint* const c2 = solver.MakeRowConstraint(-infinity, 2.0);
|
|
|
|
|
c2->SetCoefficient(x, 1);
|
|
|
|
|
c2->SetCoefficient(y, -1);
|
2022-09-30 18:08:44 +02:00
|
|
|
std::cout << "Number of variables = " << solver.NumVariables() << std::endl;
|
|
|
|
|
std::cout << "Number of constraints = " << solver.NumConstraints()
|
|
|
|
|
<< std::endl;
|
2018-02-02 17:35:18 +01:00
|
|
|
solver.Solve();
|
|
|
|
|
// The value of each variable in the solution.
|
|
|
|
|
std::cout << "Solution:" << std::endl
|
2022-09-30 18:08:44 +02:00
|
|
|
<< "x = " << x->solution_value() << std::endl
|
|
|
|
|
<< "y = " << y->solution_value() << std::endl;
|
2018-02-02 17:35:18 +01:00
|
|
|
|
|
|
|
|
// The objective value of the solution.
|
2022-09-30 18:08:44 +02:00
|
|
|
std::cout << "Optimal objective value = " << objective->Value() << std::endl;
|
2018-02-02 17:35:18 +01:00
|
|
|
}
|
|
|
|
|
|
2022-09-30 18:08:44 +02:00
|
|
|
void RunExample() { RunLinearExample(MPSolver::GLOP_LINEAR_PROGRAMMING); }
|
2018-02-02 17:35:18 +01:00
|
|
|
} // namespace operations_research
|
|
|
|
|
|
|
|
|
|
int main(int argc, char** argv) {
|
2022-09-30 18:08:44 +02:00
|
|
|
operations_research::RunExample();
|
|
|
|
|
return 0;
|
2018-02-02 17:35:18 +01:00
|
|
|
}
|
