Deploying to gh-pages from @ 2967e8c 🚀

metab0t · Jan 26, 2025 · b5181dd · b5181dd
1 parent 59b9ca3
commit b5181dd
Show file tree

Hide file tree

Showing 8 changed files with 19 additions and 21 deletions.
diff --git a/constraint.html b/constraint.html
@@ -306,12 +306,12 @@ <h1>Constraint<a class="headerlink" href="#constraint" title="Link to this headi
 </div>
 </div>
 <div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>2025-01-26 11:22:07 [INFO] checks license for COPT v7.2.4 20241206
-2025-01-26 11:22:07 [WARN] no license files in current working folder: /home/runner/work/PyOptInterface/PyOptInterface/docs/source
-2025-01-26 11:22:07 [WARN] no license files in binary folder: /opt/hostedtoolcache/Python/3.12.8/x64/bin
-2025-01-26 11:22:07 [WARN] no license files in HOME folder: /home/runner/copt
-2025-01-26 11:22:07 [INFO] empty environment variable: COPT_LICENSE_DIR
-2025-01-26 11:22:07 [WARN] no license files in EV &#39;COPT_LICENSE_DIR&#39;: 
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>2025-01-26 11:26:31 [INFO] checks license for COPT v7.2.4 20241206
+2025-01-26 11:26:31 [WARN] no license files in current working folder: /home/runner/work/PyOptInterface/PyOptInterface/docs/source
+2025-01-26 11:26:31 [WARN] no license files in binary folder: /opt/hostedtoolcache/Python/3.12.8/x64/bin
+2025-01-26 11:26:31 [WARN] no license files in HOME folder: /home/runner/copt
+2025-01-26 11:26:31 [INFO] empty environment variable: COPT_LICENSE_DIR
+2025-01-26 11:26:31 [WARN] no license files in EV &#39;COPT_LICENSE_DIR&#39;: 
 
 No license found. Starting COPT with size limitations for non-commercial use
 Please apply for a license from www.shanshu.ai/copt

diff --git a/examples/optimal_control_rocket.html b/examples/optimal_control_rocket.html
@@ -480,7 +480,7 @@ <h2>Implementation<a class="headerlink" href="#implementation" title="Link to th
 Number of equality constraint Jacobian evaluations   = 24
 Number of inequality constraint Jacobian evaluations = 0
 Number of Lagrangian Hessian evaluations             = 23
-Total CPU secs in IPOPT (w/o function evaluations)   =      0.124
+Total CPU secs in IPOPT (w/o function evaluations)   =      0.117
 Total CPU secs in NLP function evaluations           =      0.005
 
 EXIT: Optimal Solution Found.

diff --git a/expression.html b/expression.html
@@ -363,8 +363,8 @@ <h2>Efficient expression construction<a class="headerlink" href="#efficient-expr
 </div>
 </div>
 <div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>CPU times: user 771 μs, sys: 0 ns, total: 771 μs
-Wall time: 774 μs
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>CPU times: user 743 μs, sys: 0 ns, total: 743 μs
+Wall time: 747 μs
 </pre></div>
 </div>
 </div>
@@ -376,8 +376,8 @@ <h2>Efficient expression construction<a class="headerlink" href="#efficient-expr
 </div>
 </div>
 <div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>CPU times: user 18.7 ms, sys: 915 μs, total: 19.7 ms
-Wall time: 19.5 ms
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>CPU times: user 19.1 ms, sys: 866 μs, total: 19.9 ms
+Wall time: 19.7 ms
 </pre></div>
 </div>
 </div>

diff --git a/model.html b/model.html
@@ -415,6 +415,7 @@ <h2>Inspect and customize the model<a class="headerlink" href="#inspect-and-cust
 </div>
 <div class="cell_output docutils container">
 <div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Running HiGHS 1.8.1 (git hash: 4a7f24a): Copyright (c) 2024 HiGHS under MIT licence terms
+Objective value: 0.49999999999999994
 Coefficient ranges:
   Matrix [1e+00, 1e+00]
   Cost   [0e+00, 0e+00]
@@ -427,7 +428,6 @@ <h2>Inspect and customize the model<a class="headerlink" href="#inspect-and-cust
 QP ASM    iterations: 2
 Objective value     :  5.0000000000e-01
 HiGHS run time      :          0.00
-Objective value: 0.49999999999999994
 </pre></div>
 </div>
 </div>

diff --git a/nonlinear.html b/nonlinear.html
@@ -696,7 +696,7 @@ <h2>Nonlinear constraints and objectives<a class="headerlink" href="#nonlinear-c
 Number of equality constraint Jacobian evaluations   = 0
 Number of inequality constraint Jacobian evaluations = 0
 Number of Lagrangian Hessian evaluations             = 14
-Total CPU secs in IPOPT (w/o function evaluations)   =      0.003
+Total CPU secs in IPOPT (w/o function evaluations)   =      0.001
 Total CPU secs in NLP function evaluations           =      0.000
 
 EXIT: Optimal Solution Found.
@@ -801,7 +801,7 @@ <h2>Mixing nonlinear and linear/quadratic constraints together<a class="headerli
 Number of equality constraint Jacobian evaluations   = 5
 Number of inequality constraint Jacobian evaluations = 0
 Number of Lagrangian Hessian evaluations             = 4
-Total CPU secs in IPOPT (w/o function evaluations)   =      0.026
+Total CPU secs in IPOPT (w/o function evaluations)   =      0.024
 Total CPU secs in NLP function evaluations           =      0.001
 
 EXIT: Optimal Solution Found.

diff --git a/numpy.html b/numpy.html
@@ -357,7 +357,7 @@ <h1>Numpy Container and N-queens Problem<a class="headerlink" href="#numpy-conta
    42 rows
    64 cols (64 binary, 0 integer, 0 implied int., 0 continuous)
    270 nonzeros
-MIP-Timing:      0.0019 - starting analytic centre calculation
+MIP-Timing:      0.0011 - starting analytic centre calculation
 
 Src: B =&gt; Branching; C =&gt; Central rounding; F =&gt; Feasibility pump; H =&gt; Heuristic; L =&gt; Sub-MIP;
      P =&gt; Empty MIP; R =&gt; Randomized rounding; S =&gt; Solve LP; T =&gt; Evaluate node; U =&gt; Unbounded;

diff --git a/searchindex.js b/searchindex.js
diff --git a/structure.html b/structure.html
@@ -394,7 +394,7 @@ <h1>Building Bigger Optimization Model<a class="headerlink" href="#building-bigg
    42 rows
    64 cols (64 binary, 0 integer, 0 implied int., 0 continuous)
    270 nonzeros
-MIP-Timing:       0.006 - starting analytic centre calculation
+MIP-Timing:      0.0011 - starting analytic centre calculation
 
 Src: B =&gt; Branching; C =&gt; Central rounding; F =&gt; Feasibility pump; H =&gt; Heuristic; L =&gt; Sub-MIP;
      P =&gt; Empty MIP; R =&gt; Randomized rounding; S =&gt; Solve LP; T =&gt; Evaluate node; U =&gt; Unbounded;
@@ -415,10 +415,7 @@ <h1>Building Bigger Optimization Model<a class="headerlink" href="#building-bigg
   Gap               0% (tolerance: 0.01%)
   P-D integral      0
   Solution status   feasible
-Termination status: TerminationStatusCode.OPTIMAL
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>                    0 (objective)
+                    0 (objective)
                     0 (bound viol.)
                     0 (int. viol.)
                     0 (row viol.)
@@ -433,6 +430,7 @@ <h1>Building Bigger Optimization Model<a class="headerlink" href="#building-bigg
                     0 (strong br.)
                     184 (separation)
                     54 (heuristics)
+Termination status: TerminationStatusCode.OPTIMAL
 </pre></div>
 </div>
 </div>