Files
ortools-clone/examples/dotnet/csintegerprogramming.cs

117 lines
4.7 KiB
C#
Raw Normal View History

2018-11-10 18:00:53 +01:00
// Copyright 2010-2018 Google LLC
2012-01-25 18:02:25 +00:00
// 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.
2012-01-25 18:02:25 +00:00
using System;
using Google.OrTools.LinearSolver;
2020-10-26 18:36:17 +01:00
public class CsIntegerProgramming {
private static void RunIntegerProgrammingExample(String solverType) {
Solver solver = Solver.CreateSolver(solverType);
2020-10-26 18:36:17 +01:00
if (solver == null) {
2012-01-25 18:02:25 +00:00
Console.WriteLine("Could not create solver " + solverType);
return;
}
// x1 and x2 are integer non-negative variables.
Variable x1 = solver.MakeIntVar(0.0, double.PositiveInfinity, "x1");
Variable x2 = solver.MakeIntVar(0.0, double.PositiveInfinity, "x2");
2012-01-25 18:02:25 +00:00
// Minimize x1 + 2 * x2.
2014-07-09 12:21:55 +00:00
Objective objective = solver.Objective();
objective.SetMinimization();
objective.SetCoefficient(x1, 1);
objective.SetCoefficient(x2, 2);
2012-01-25 18:02:25 +00:00
// 2 * x2 + 3 * x1 >= 17.
Constraint ct = solver.MakeConstraint(17, double.PositiveInfinity);
2012-01-25 18:02:25 +00:00
ct.SetCoefficient(x1, 3);
ct.SetCoefficient(x2, 2);
Solver.ResultStatus resultStatus = solver.Solve();
2012-01-25 18:02:25 +00:00
// Check that the problem has an optimal solution.
2020-10-26 18:36:17 +01:00
if (resultStatus != Solver.ResultStatus.OPTIMAL) {
2012-01-25 18:02:25 +00:00
Console.WriteLine("The problem does not have an optimal solution!");
return;
}
2020-10-28 09:43:50 +01:00
Console.WriteLine("Problem solved in " + solver.WallTime() + " milliseconds");
2012-01-25 18:02:25 +00:00
// The objective value of the solution.
2014-07-09 12:21:55 +00:00
Console.WriteLine("Optimal objective value = " + objective.Value());
2012-01-25 18:02:25 +00:00
// The value of each variable in the solution.
Console.WriteLine("x1 = " + x1.SolutionValue());
Console.WriteLine("x2 = " + x2.SolutionValue());
Console.WriteLine("Advanced usage:");
2020-10-28 09:43:50 +01:00
Console.WriteLine("Problem solved in " + solver.Nodes() + " branch-and-bound nodes");
2012-01-25 18:02:25 +00:00
}
2020-10-28 09:43:50 +01:00
private static void RunIntegerProgrammingExampleNaturalApi(String solverType) {
Solver solver = Solver.CreateSolver(solverType);
2020-10-26 18:36:17 +01:00
if (solver == null) {
Console.WriteLine("Could not create solver " + solverType);
return;
}
// x1 and x2 are integer non-negative variables.
Variable x1 = solver.MakeIntVar(0.0, double.PositiveInfinity, "x1");
Variable x2 = solver.MakeIntVar(0.0, double.PositiveInfinity, "x2");
solver.Minimize(x1 + 2 * x2);
solver.Add(2 * x2 + 3 * x1 >= 17);
Solver.ResultStatus resultStatus = solver.Solve();
// Check that the problem has an optimal solution.
2020-10-26 18:36:17 +01:00
if (resultStatus != Solver.ResultStatus.OPTIMAL) {
Console.WriteLine("The problem does not have an optimal solution!");
return;
}
2020-10-28 09:43:50 +01:00
Console.WriteLine("Problem solved in " + solver.WallTime() + " milliseconds");
// The objective value of the solution.
2020-10-28 09:43:50 +01:00
Console.WriteLine("Optimal objective value = " + solver.Objective().Value());
// The value of each variable in the solution.
Console.WriteLine("x1 = " + x1.SolutionValue());
Console.WriteLine("x2 = " + x2.SolutionValue());
Console.WriteLine("Advanced usage:");
2020-10-28 09:43:50 +01:00
Console.WriteLine("Problem solved in " + solver.Nodes() + " branch-and-bound nodes");
}
2020-10-26 18:36:17 +01:00
static void Main() {
2012-01-25 18:02:25 +00:00
Console.WriteLine("---- Integer programming example with GLPK ----");
2020-06-26 09:35:26 +02:00
RunIntegerProgrammingExample("GLPK");
2012-01-25 18:02:25 +00:00
Console.WriteLine("---- Linear programming example with CBC ----");
2020-06-26 09:35:26 +02:00
RunIntegerProgrammingExample("CBC");
2012-01-25 18:02:25 +00:00
Console.WriteLine("---- Linear programming example with SCIP ----");
2020-06-26 09:35:26 +02:00
RunIntegerProgrammingExample("SCIP");
2020-07-01 17:48:56 +02:00
Console.WriteLine("---- Linear programming example with SAT ----");
RunIntegerProgrammingExample("SAT");
Console.WriteLine("---- Linear programming example with GUROBI ----");
RunIntegerProgrammingExample("GUROBI");
2020-10-28 09:43:50 +01:00
Console.WriteLine("---- Integer programming example (Natural API) with GLPK ----");
2020-06-26 09:35:26 +02:00
RunIntegerProgrammingExampleNaturalApi("GLPK");
2020-10-28 09:43:50 +01:00
Console.WriteLine("---- Linear programming example (Natural API) with CBC ----");
2020-06-26 09:35:26 +02:00
RunIntegerProgrammingExampleNaturalApi("CBC");
2020-10-28 09:43:50 +01:00
Console.WriteLine("---- Linear programming example (Natural API) with SCIP ----");
2020-06-26 09:35:26 +02:00
RunIntegerProgrammingExampleNaturalApi("SCIP");
2020-10-28 09:43:50 +01:00
Console.WriteLine("---- Linear programming example (Natural API) with SAT ----");
2020-07-01 17:48:56 +02:00
RunIntegerProgrammingExampleNaturalApi("SAT");
2020-10-28 09:43:50 +01:00
Console.WriteLine("---- Linear programming example (Natural API) with GUROBI ----");
RunIntegerProgrammingExampleNaturalApi("GUROBI");
2012-01-25 18:02:25 +00:00
}
}