rename linear examples

com/google/ortools/linearsolver/samples/IntegerProgramming.java

@@ -0,0 +1,80 @@
+// Copyright 2010-2011 Google
+// 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.
+
+package com.google.ortools.linearsolver.samples;
+
+import com.google.ortools.linearsolver.MPConstraint;
+import com.google.ortools.linearsolver.MPSolver;
+import com.google.ortools.linearsolver.MPVariable;
+
+/**
+ * Integer programming example that shows how to use the API.
+ *
+ */
+
+public class IntegerProgramming {
+
+  static {
+    System.loadLibrary("jnilinearsolver");
+  }
+
+
+  private static void runIntegerProgrammingExample(int optimizationProblemType) {
+    MPSolver solver = new MPSolver("IntegerProgrammingExample",
+                                   optimizationProblemType);
+    double infinity = solver.infinity();
+    // x1 and x2 are integer non-negative variables.
+    MPVariable x1 = solver.makeIntVar(0.0, infinity, "x1");
+    MPVariable x2 = solver.makeIntVar(0.0, infinity, "x2");
+
+    // Minimize x1 + 2 * x2.
+    solver.addObjectiveTerm(x1, 1);
+    solver.addObjectiveTerm(x2, 2);
+
+    // 2 * x2 + 3 * x1 >= 17.
+    MPConstraint ct = solver.makeConstraint(17, infinity);
+    ct.addTerm(x1, 3);
+    ct.addTerm(x2, 2);
+
+    int resultStatus = solver.solve();
+
+    // Check that the problem has an optimal solution.
+    if (resultStatus != MPSolver.OPTIMAL) {
+      System.err.println("The problem does not have an optimal solution!");
+      return;
+    }
+
+    System.out.println("Problem solved in " + solver.wallTime() +
+                       " milliseconds");
+
+    // The objective value of the solution.
+    System.out.println("Optimal objective value = " + solver.objectiveValue());
+
+    // The value of each variable in the solution.
+    System.out.println("x1 = " + x1.solutionValue());
+    System.out.println("x2 = " + x2.solutionValue());
+
+    System.out.println("Advanced usage:");
+    System.out.println("Problem solved in " + solver.nodes() +
+                       " branch-and-bound nodes");
+  }
+
+  public static void main(String[] args) throws Exception {
+    System.out.println("---- Integer programming example with GLPK ----");
+    runIntegerProgrammingExample(MPSolver.GLPK_MIXED_INTEGER_PROGRAMMING);
+    System.out.println("---- Integer programming example with CBC ----");
+    runIntegerProgrammingExample(MPSolver.CBC_MIXED_INTEGER_PROGRAMMING);
+    System.out.println("---- Integer programming example with SCIP ----");
+    runIntegerProgrammingExample(MPSolver.SCIP_MIXED_INTEGER_PROGRAMMING);
+  }
+}