52 lines
1.7 KiB
C++
52 lines
1.7 KiB
C++
// Copyright 2010-2018 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.
|
|
|
|
// Minimal example to call the GLOP solver.
|
|
// [START program]
|
|
#include <iostream>
|
|
#include "ortools/linear_solver/linear_solver.h"
|
|
|
|
namespace operations_research {
|
|
void run() {
|
|
// Create the linear solver with the GLOP backend.
|
|
MPSolver solver("simple_lp_program", MPSolver::GLOP_LINEAR_PROGRAMMING);
|
|
|
|
// Create the variables x and y.
|
|
MPVariable* const x = solver.MakeNumVar(0.0, 1, "x");
|
|
MPVariable* const y = solver.MakeNumVar(0.0, 2, "y");
|
|
|
|
// 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);
|
|
|
|
// Create the objective function, 3 * x + y.
|
|
MPObjective* const objective = solver.MutableObjective();
|
|
objective->SetCoefficient(x, 3);
|
|
objective->SetCoefficient(y, 1);
|
|
objective->SetMaximization();
|
|
|
|
// Call the solver and display the results.
|
|
solver.Solve();
|
|
std::cout << "Solution:" << std::endl;
|
|
std::cout << "x = " << x->solution_value() << std::endl;
|
|
std::cout << "y = " << y->solution_value() << std::endl;
|
|
}
|
|
} // namespace operations_research
|
|
|
|
int main() {
|
|
operations_research::run();
|
|
return EXIT_SUCCESS;
|
|
}
|
|
// [END program]
|