Deploying to gh-pages from @ f66e78a 🚀

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>2024-12-21 16:20:25 [INFO] checks license for COPT v7.2.2 20241023
-2024-12-21 16:20:25 [WARN] no license files in current working folder: /home/runner/work/PyOptInterface/PyOptInterface/docs/source
-2024-12-21 16:20:25 [WARN] no license files in binary folder: /opt/hostedtoolcache/Python/3.12.8/x64/bin
-2024-12-21 16:20:25 [WARN] no license files in HOME folder: /home/runner/copt
-2024-12-21 16:20:25 [INFO] empty environment variable: COPT_LICENSE_DIR
-2024-12-21 16:20:25 [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-02 10:39:20 [INFO] checks license for COPT v7.2.2 20241023
+2025-01-02 10:39:20 [WARN] no license files in current working folder: /home/runner/work/PyOptInterface/PyOptInterface/docs/source
+2025-01-02 10:39:20 [WARN] no license files in binary folder: /opt/hostedtoolcache/Python/3.12.8/x64/bin
+2025-01-02 10:39:20 [WARN] no license files in HOME folder: /home/runner/copt
+2025-01-02 10:39:20 [INFO] empty environment variable: COPT_LICENSE_DIR
+2025-01-02 10:39:20 [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

examples/economic_dispatch.html

@@ -421,9 +421,9 @@ <h2>Implementation<a class="headerlink" href="#implementation" title="Link to th
 Simplex   iterations: 63
 QP ASM    iterations: 108
 Objective value     :  1.2684000000e+04
-HiGHS run time      :          0.00
 TerminationStatusCode.OPTIMAL
 Objective value:  12684.0
+HiGHS run time      :          0.00
 </pre></div>
 </div>
 </div>
@@ -487,7 +487,7 @@ <h2>Change the load and solve the model again<a class="headerlink" href="#change
   RHS    [2e+01, 2e+02]
   Iteration        Objective     NullspaceDim
           0        15430.248                0      0.00s
-        100        14091.031                3      0.00s
+        100        14091.031                3      0.01s
         169        13740.237               10      0.01s
 Model status        : Optimal
 Simplex   iterations: 86

examples/optimal_control_rocket.html

@@ -480,7 +480,7 @@ <h2>Implementation<a class="headerlink" href="#implementation" title="Link to th
 Number of inequality constraint Jacobian evaluations = 0
 Number of Lagrangian Hessian evaluations             = 23
 Total CPU secs in IPOPT (w/o function evaluations)   =      0.125
-Total CPU secs in NLP function evaluations           =      0.004
+Total CPU secs in NLP function evaluations           =      0.005
 
 EXIT: Optimal Solution Found.
 </pre></div>

examples/optimal_power_flow.html

@@ -589,9 +589,8 @@ <h2>Implementation<a class="headerlink" href="#implementation" title="Link to th
   16  1.7551939e+04 1.54e-08 1.13e-06  -3.8 6.68e-04    -  1.00e+00 1.00e+00f  1
   17  1.7551891e+04 1.33e-08 1.02e-06  -5.7 9.92e-04    -  1.00e+00 1.00e+00f  1
   18  1.7551891e+04 1.15e-12 1.20e-10  -8.6 1.29e-05    -  1.00e+00 1.00e+00h  1
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Number of Iterations....: 18
+
+Number of Iterations....: 18
 
                                    (scaled)                 (unscaled)
 Objective...............:   4.3879727096482048e+02    1.7551890838592819e+04
@@ -608,7 +607,7 @@ <h2>Implementation<a class="headerlink" href="#implementation" title="Link to th
 Number of equality constraint Jacobian evaluations   = 19
 Number of inequality constraint Jacobian evaluations = 19
 Number of Lagrangian Hessian evaluations             = 18
-Total CPU secs in IPOPT (w/o function evaluations)   =      0.009
+Total CPU secs in IPOPT (w/o function evaluations)   =      0.011
 Total CPU secs in NLP function evaluations           =      0.001
 
 EXIT: Optimal Solution Found.

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 593 μs, sys: 93 μs, total: 686 μs
-Wall time: 690 μs
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>CPU times: user 700 μs, sys: 0 ns, total: 700 μs
+Wall time: 704 μ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 15.8 ms, sys: 0 ns, total: 15.8 ms
-Wall time: 15.6 ms
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>CPU times: user 16 ms, sys: 18 μs, total: 16 ms
+Wall time: 15.8 ms
 </pre></div>
 </div>
 </div>

nonlinear.html

@@ -554,7 +554,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 = 11
 Number of Lagrangian Hessian evaluations             = 10
-Total CPU secs in IPOPT (w/o function evaluations)   =      0.008
+Total CPU secs in IPOPT (w/o function evaluations)   =      0.003
 Total CPU secs in NLP function evaluations           =      0.001
 
 EXIT: Optimal Solution Found.
@@ -678,8 +678,9 @@ <h2>Nonlinear constraints and objectives<a class="headerlink" href="#nonlinear-c
   12  2.8189505e-09 0.00e+00 8.31e-04  -2.5 3.20e-03    -  1.00e+00 1.00e+00f  1
   13  1.0095040e-15 0.00e+00 8.68e-07  -5.7 9.78e-05    -  1.00e+00 1.00e+00f  1
   14  1.3288608e-28 0.00e+00 2.02e-13  -8.6 4.65e-08    -  1.00e+00 1.00e+00f  1
-
-Number of Iterations....: 14
+</pre></div>
+</div>
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Number of Iterations....: 14
 
                                    (scaled)                 (unscaled)
 Objective...............:   1.3288608467480825e-28    1.3288608467480825e-28
@@ -696,7 +697,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.004
+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 +802,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.025
+Total CPU secs in IPOPT (w/o function evaluations)   =      0.026
 Total CPU secs in NLP function evaluations     
 </pre></div>
 </div>

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.0018 - starting analytic centre calculation
+MIP-Timing:      0.0025 - 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;

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.0012 - 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;