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

notebook: regenerate them

Browse Source
This commit is contained in:
Corentin Le Molgat
2023-10-26 10:33:09 +02:00
parent 0de06db28a
commit 3b00b323ba
19 changed files with 216 additions and 39 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
examples/notebook/linear_solver/mip_var_array.ipynb
View File

@@ -135,6 +135,7 @@
" # obj_expr = [data['obj_coeffs'][j] * x[j] for j in range(data['num_vars'])]\n",
" # solver.Maximize(solver.Sum(obj_expr))\n",
"\n",
" print(f\"Solving with {solver.SolverVersion()}\")\n",
" status = solver.Solve()\n",
"\n",
" if status == pywraplp.Solver.OPTIMAL:\n",
@@ -142,9 +143,9 @@
" for j in range(data[\"num_vars\"]):\n",
" print(x[j].name(), \" = \", x[j].solution_value())\n",
" print()\n",
" print(\"Problem solved in %f milliseconds\" % solver.wall_time())\n",
" print(\"Problem solved in %d iterations\" % solver.iterations())\n",
" print(\"Problem solved in %d branch-and-bound nodes\" % solver.nodes())\n",
" print(f\"Problem solved in {solver.wall_time():d} milliseconds\")\n",
" print(f\"Problem solved in {solver.iterations():d} iterations\")\n",
" print(f\"Problem solved in {solver.nodes():d} branch-and-bound nodes\")\n",
" else:\n",
" print(\"The problem does not have an optimal solution.\")\n",
"\n",