Deploying to gh-pages from @ 64deec9 🚀

Author: metab0t

constraint.html

@@ -299,12 +299,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-12-21 13:39:54 [INFO] checks license for COPT v8.0.2 20251201
-2025-12-21 13:39:54 [WARN] no license files in current working folder: /home/runner/work/PyOptInterface/PyOptInterface/docs/source
-2025-12-21 13:39:54 [WARN] no license files in binary folder: /opt/hostedtoolcache/Python/3.13.11/x64/bin
-2025-12-21 13:39:54 [WARN] no license files in HOME folder: /home/runner/copt
-2025-12-21 13:39:54 [INFO] empty environment variable: COPT_LICENSE_DIR
-2025-12-21 13:39:54 [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-12-21 13:49:23 [INFO] checks license for COPT v8.0.2 20251201
+2025-12-21 13:49:23 [WARN] no license files in current working folder: /home/runner/work/PyOptInterface/PyOptInterface/docs/source
+2025-12-21 13:49:23 [WARN] no license files in binary folder: /opt/hostedtoolcache/Python/3.13.11/x64/bin
+2025-12-21 13:49:23 [WARN] no license files in HOME folder: /home/runner/copt
+2025-12-21 13:49:23 [INFO] empty environment variable: COPT_LICENSE_DIR
+2025-12-21 13:49:23 [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
@@ -379,7 +379,7 @@ <h2>Linear Constraint<a class="headerlink" href="#linear-constraint" title="Link
 </div>
 </div>
 <div class="cell_output docutils container">
-<div class="output text_plain highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>&lt;pyoptinterface._src.core_ext.ConstraintIndex at 0x7f16acf08830&gt;
+<div class="output text_plain highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>&lt;pyoptinterface._src.core_ext.ConstraintIndex at 0x7fe6dcb0c4f0&gt;
 </pre></div>
 </div>
 </div>
@@ -392,7 +392,7 @@ <h2>Linear Constraint<a class="headerlink" href="#linear-constraint" title="Link
 </div>
 </div>
 <div class="cell_output docutils container">
-<div class="output text_plain highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>&lt;pyoptinterface._src.core_ext.ConstraintIndex at 0x7f16acf08cd0&gt;
+<div class="output text_plain highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>&lt;pyoptinterface._src.core_ext.ConstraintIndex at 0x7fe6dcb0ccd0&gt;
 </pre></div>
 </div>
 </div>
@@ -406,7 +406,7 @@ <h2>Linear Constraint<a class="headerlink" href="#linear-constraint" title="Link
 </div>
 </div>
 <div class="cell_output docutils container">
-<div class="output text_plain highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>&lt;pyoptinterface._src.core_ext.ConstraintIndex at 0x7f16acf08d30&gt;
+<div class="output text_plain highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>&lt;pyoptinterface._src.core_ext.ConstraintIndex at 0x7fe6dcb0cd30&gt;
 </pre></div>
 </div>
 </div>

container.html

@@ -496,7 +496,7 @@ <h2>Building a model with <code class="docutils literal notranslate"><span class
 QP ASM    iterations: 360
 Objective value     :  2.0000000000e+00
 P-D objective error :  3.9999998246e-08
-HiGHS run time      :          0.02
+HiGHS run time      :          0.01
 </pre></div>
 </div>
 </div>

examples/optimal_control_rocket.html

@@ -478,9 +478,8 @@ <h2>Implementation<a class="headerlink" href="#implementation" title="Link to th
   35 -1.0128334e+00 5.34e-07 3.99e-04  -8.6 8.28e-01    -  1.00e+00 5.00e-01f  2
   36 -1.0128334e+00 4.72e-08 1.58e-05  -8.6 3.52e-01    -  1.00e+00 1.00e+00h  1
   37 -1.0128334e+00 8.97e-12 3.04e-09  -8.6 1.37e-02    -  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....: 37
+
+Number of Iterations....: 37
 
                                    (scaled)                 (unscaled)
 Objective...............:  -1.0128333977358319e+00   -1.0128333977358319e+00

examples/optimal_power_flow.html

@@ -579,10 +579,7 @@ <h2>Implementation<a class="headerlink" href="#implementation" title="Link to th
 Number of inequality constraint Jacobian evaluations = 19
 Number of Lagrangian Hessian evaluations             = 18
 Total CPU secs in IPOPT (w/o function evaluations)   =      0.007
-Total CPU secs in NLP function evaluati
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>ons           =      0.000
+Total CPU secs in NLP function evaluations           =      0.000
 
 EXIT: Optimal Solution Found.
 </pre></div>

expression.html

@@ -356,8 +356,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 604 μs, sys: 111 μs, total: 715 μs
-Wall time: 719 μs
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>CPU times: user 754 μs, sys: 0 ns, total: 754 μs
+Wall time: 758 μs
 </pre></div>
 </div>
 </div>
@@ -369,7 +369,7 @@ <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.2 ms, sys: 0 ns, total: 15.2 ms
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>CPU times: user 15.3 ms, sys: 0 ns, total: 15.3 ms
 Wall time: 15.1 ms
 </pre></div>
 </div>

infeasibility.html

@@ -309,7 +309,17 @@ <h1>Infeasibility Analysis<a class="headerlink" href="#infeasibility-analysis" t
 </div>
 </div>
 <div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>No license found. LP size is limited to 10000 variables and 10000 constraints
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>No license found. LP size is limited to 10000 variables and 10000 constraints2025-12-21 13:49:31 [INFO] checks license for COPT v8.0.2 20251201
+2025-12-21 13:49:31 [WARN] no license files in current working folder: /home/runner/work/PyOptInterface/PyOptInterface/docs/source
+2025-12-21 13:49:31 [WARN] no license files in binary folder: /opt/hostedtoolcache/Python/3.13.11/x64/bin
+2025-12-21 13:49:31 [WARN] no license files in HOME folder: /home/runner/copt
+2025-12-21 13:49:31 [INFO] empty environment variable: COPT_LICENSE_DIR
+2025-12-21 13:49: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
+
+
 Please apply for a license from www.shanshu.ai/copt
 
 Model fingerprint: 43b22f9c
@@ -328,15 +338,6 @@ <h1>Infeasibility Analysis<a class="headerlink" href="#infeasibility-analysis" t
 IIS computation finished (0.001s)
 Constraint 1 IIS: True
 Constraint 2 IIS: True
-2025-12-21 13:40:03 [INFO] checks license for COPT v8.0.2 20251201
-2025-12-21 13:40:03 [WARN] no license files in current working folder: /home/runner/work/PyOptInterface/PyOptInterface/docs/source
-2025-12-21 13:40:03 [WARN] no license files in binary folder: /opt/hostedtoolcache/Python/3.13.11/x64/bin
-2025-12-21 13:40:03 [WARN] no license files in HOME folder: /home/runner/copt
-2025-12-21 13:40:03 [INFO] empty environment variable: COPT_LICENSE_DIR
-2025-12-21 13:40:03 [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
 </pre></div>
 </div>
 </div>

nonlinear.html

@@ -479,7 +479,9 @@ <h2>Nonlinear constraints and objectives<a class="headerlink" href="#nonlinear-c
    7  5.4427137e+00 0.00e+00 3.36e-03  -2.5 7.95e-02    -  9.84e-01 1.00e+00f  1
    8  5.4366982e+00 0.00e+00 4.18e-06  -3.8 7.75e-03    -  1.00e+00 1.00e+00h  1
    9  5.4365655e+00 0.00e+00 1.91e-08  -5.7 1.81e-04    -  1.00e+00 1.00e+00h  1
-iter    objective    inf_pr   inf_du lg(mu)  ||d||  lg(rg) alpha_du alpha_pr  ls
+</pre></div>
+</div>
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>iter    objective    inf_pr   inf_du lg(mu)  ||d||  lg(rg) alpha_du alpha_pr  ls
   10  5.4365636e+00 0.00e+00 3.26e-12  -8.6 2.72e-06    -  1.00e+00 1.00e+00h  1
 
 Number of Iterations....: 10
@@ -499,7 +501,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.004
+Total CPU secs in IPOPT (w/o function evaluations)   =      0.005
 Total CPU secs in NLP function evaluations           =      0.000
 
 EXIT: Optimal Solution Found.
@@ -622,8 +624,8 @@ <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.006
-Total CPU secs in NLP function evaluations           =      0.002
+Total CPU secs in IPOPT (w/o function evaluations)   =      0.007
+Total CPU secs in NLP function evaluations           =      0.000
 
 EXIT: Optimal Solution Found.
 </pre></div>
@@ -701,10 +703,10 @@ <h2>Mixing nonlinear and linear/quadratic constraints together<a class="headerli
 
 iter    objective    inf_pr   inf_du lg(mu)  ||d||  lg(rg) alpha_du alpha_pr  ls
    0  3.5000000e+02 0.00e+00 0.00e+00  -1.0 0.00e+00    -  0.00e+00 0.00e+00   0
+   1  3.5000000e+02 0.00e+00 0.00e+00  -1.7 0.00e+00    -  1.00e+00 1.00e+00   0
 </pre></div>
 </div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>   1  3.5000000e+02 0.00e+00 0.00e+00  -1.7 0.00e+00    -  1.00e+00 1.00e+00   0
-   2  3.5000000e+02 0.00e+00 0.00e+00  -3.8 0.00e+00  -2.0 1.00e+00 1.00e+00T  0
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>   2  3.5000000e+02 0.00e+00 0.00e+00  -3.8 0.00e+00  -2.0 1.00e+00 1.00e+00T  0
    3  3.5000000e+02 0.00e+00 0.00e+00  -5.7 0.00e+00   0.2 1.00e+00 1.00e+00T  0
    4  3.5000000e+02 0.00e+00 0.00e+00  -8.6 0.00e+00  -0.2 1.00e+00 1.00e+00T  0
 
@@ -725,7 +727,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.027
+Total CPU secs in IPOPT (w/o function evaluations)   =      0.026
 Total CPU secs in NLP function evaluations           =      0.001
 
 EXIT: Optimal Solution Found.

numpy.html

@@ -365,10 +365,8 @@ <h2>N-queen problem<a class="headerlink" href="#n-queen-problem" title="Link to
 
  J       0       0         0 100.00%   -inf            0                  Large        0      0      0         0     0.0s
          1       0         1 100.00%   0               0                  0.00%        0      0      0         0     0.0s
-Termination status: TerminationStatusCode.OPTIMAL
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Solving report
+
+Solving report
   Status            Optimal
   Primal bound      0
   Dual bound        0
@@ -384,6 +382,7 @@ <h2>N-queen problem<a class="headerlink" href="#n-queen-problem" title="Link to
   Nodes             1
   Repair LPs        0
   LP iterations     0
+Termination status: TerminationStatusCode.OPTIMAL
 </pre></div>
 </div>
 </div>

searchindex.js

@@ -394,10 +394,8 @@ <h1>Building Bigger Optimization Model<a class="headerlink" href="#building-bigg
      I =&gt; Shifting; J =&gt; Feasibility jump; L =&gt; Sub-MIP; P =&gt; Empty MIP; R =&gt; Randomized rounding;
      S =&gt; Solve LP; T =&gt; Evaluate node; U =&gt; Unbounded; X =&gt; User solution; Y =&gt; HiGHS solution;
      Z =&gt; ZI Round; l =&gt; Trivial lower; p =&gt; Trivial point; u =&gt; Trivial upper; z =&gt; Trivial zero
-Termination status: TerminationStatusCode.OPTIMAL
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>        Nodes      |    B&amp;B Tree     |            Objective Bounds              |  Dynamic Constraints |       Work      
+
+        Nodes      |    B&amp;B Tree     |            Objective Bounds              |  Dynamic Constraints |       Work      
 Src  Proc. InQueue |  Leaves   Expl. | BestBound       BestSol              Gap |   Cuts   InLp Confl. | LpIters     Time
 
  J       0       0         0 100.00%   -inf            0                  Large        0      0      0         0     0.0s
@@ -409,7 +407,10 @@ <h1>Building Bigger Optimization Model<a class="headerlink" href="#building-bigg
   Dual bound        0
   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>  Solution status   feasible
                     0 (objective)
                     0 (bound viol.)
                     0 (int. viol.)