Deploying to gh-pages from @ ac9b768 🚀

Author: metab0t

constraint.html

@@ -297,12 +297,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-09-29 16:35:31 [INFO] checks license for COPT v7.2.8 20250516
-2025-09-29 16:35:31 [WARN] no license files in current working folder: /home/runner/work/PyOptInterface/PyOptInterface/docs/source
-2025-09-29 16:35:31 [WARN] no license files in binary folder: /opt/hostedtoolcache/Python/3.12.11/x64/bin
-2025-09-29 16:35:31 [WARN] no license files in HOME folder: /home/runner/copt
-2025-09-29 16:35:31 [INFO] empty environment variable: COPT_LICENSE_DIR
-2025-09-29 16:35:31 [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-10-01 15:49:10 [INFO] checks license for COPT v7.2.8 20250516
+2025-10-01 15:49:10 [WARN] no license files in current working folder: /home/runner/work/PyOptInterface/PyOptInterface/docs/source
+2025-10-01 15:49:10 [WARN] no license files in binary folder: /opt/hostedtoolcache/Python/3.12.11/x64/bin
+2025-10-01 15:49:10 [WARN] no license files in HOME folder: /home/runner/copt
+2025-10-01 15:49:10 [INFO] empty environment variable: COPT_LICENSE_DIR
+2025-10-01 15:49:10 [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
@@ -377,7 +377,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 0x7f000060f050&gt;
+<div class="output text_plain highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>&lt;pyoptinterface._src.core_ext.ConstraintIndex at 0x7fafa0f53050&gt;
 </pre></div>
 </div>
 </div>
@@ -390,7 +390,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 0x7f000060f5d0&gt;
+<div class="output text_plain highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>&lt;pyoptinterface._src.core_ext.ConstraintIndex at 0x7fafa0f535d0&gt;
 </pre></div>
 </div>
 </div>
@@ -404,7 +404,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 0x7f000060f630&gt;
+<div class="output text_plain highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>&lt;pyoptinterface._src.core_ext.ConstraintIndex at 0x7fafa0f53630&gt;
 </pre></div>
 </div>
 </div>

container.html

@@ -485,15 +485,15 @@ <h2>Building a model with <code class="docutils literal notranslate"><span class
   RHS    [1e+00, 1e+00]
   Iteration        Objective     NullspaceDim
           0        20.000001                0      0.00s
-        100        5.8333336               50      0.00s
-        200        3.3333335              100      0.00s
+        100        5.8333336               50      0.01s
+        200        3.3333335              100      0.01s
         300        2.3611112              150      0.01s
         360        2.0000001              180      0.01s
 Model status        : Optimal
 QP ASM    iterations: 360
 Objective value     :  2.0000000000e+00
 P-D objective error :  3.9999998246e-08
-HiGHS run time      :          0.01
+HiGHS run time      :          0.02
 </pre></div>
 </div>
 </div>

examples/optimal_control_rocket.html

@@ -451,10 +451,10 @@ <h2>Implementation<a class="headerlink" href="#implementation" title="Link to th
   14 -1.0097529e+00 1.22e-04 1.86e+05  -1.0 1.76e+00    -  1.00e+00 8.03e-01h  1
   15 -1.0081978e+00 6.01e-05 8.20e+04  -1.0 1.03e+00    -  1.00e+00 1.00e+00h  1
   16 -1.0078306e+00 3.23e-06 5.36e+03  -1.0 3.69e-01    -  1.00e+00 1.00e+00h  1
-  17 -1.0078153e+00 1.07e-08 1.04e+01  -1.0 6.32e-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>  18 -1.0078154e+00 1.07e-13 1.24e+01  -2.5 6.61e-05    -  1.00e+00 1.00e+00h  1
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>  17 -1.0078153e+00 1.07e-08 1.04e+01  -1.0 6.32e-02    -  1.00e+00 1.00e+00h  1
+  18 -1.0078154e+00 1.07e-13 1.24e+01  -2.5 6.61e-05    -  1.00e+00 1.00e+00h  1
   19 -1.0078183e+00 1.32e-10 9.14e-04  -2.5 2.22e-03    -  1.00e+00 1.00e+00h  1
 iter    objective    inf_pr   inf_du lg(mu)  ||d||  lg(rg) alpha_du alpha_pr  ls
   20 -1.0078213e+00 1.42e-10 1.30e+01  -3.8 2.25e-03    -  1.00e+00 1.00e+00h  1
@@ -494,7 +494,7 @@ <h2>Implementation<a class="headerlink" href="#implementation" title="Link to th
 Number of equality constraint Jacobian evaluations   = 38
 Number of inequality constraint Jacobian evaluations = 0
 Number of Lagrangian Hessian evaluations             = 37
-Total CPU secs in IPOPT (w/o function evaluations)   =      0.349
+Total CPU secs in IPOPT (w/o function evaluations)   =      0.358
 Total CPU secs in NLP function evaluations           =      0.011
 
 EXIT: Optimal Solution Found.

examples/optimal_power_flow.html

@@ -576,7 +576,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.006
+Total CPU secs in IPOPT (w/o function evaluations)   =      0.007
 Total CPU secs in NLP function evaluations           =      0.000
 
 EXIT: Optimal Solution Found.

expression.html

@@ -354,8 +354,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 577 μs, sys: 95 μs, total: 672 μs
-Wall time: 674 μs
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>CPU times: user 737 μs, sys: 0 ns, total: 737 μs
+Wall time: 741 μs
 </pre></div>
 </div>
 </div>
@@ -367,8 +367,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 14.3 ms, sys: 1.03 ms, total: 15.3 ms
-Wall time: 15.2 ms
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>CPU times: user 15.7 ms, sys: 62 μs, total: 15.7 ms
+Wall time: 15.5 ms
 </pre></div>
 </div>
 </div>

infeasibility.html

@@ -307,12 +307,12 @@ <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>Constraint 1 IIS: True2025-09-29 16:35:42 [INFO] checks license for COPT v7.2.8 20250516
-2025-09-29 16:35:42 [WARN] no license files in current working folder: /home/runner/work/PyOptInterface/PyOptInterface/docs/source
-2025-09-29 16:35:42 [WARN] no license files in binary folder: /opt/hostedtoolcache/Python/3.12.11/x64/bin
-2025-09-29 16:35:42 [WARN] no license files in HOME folder: /home/runner/copt
-2025-09-29 16:35:42 [INFO] empty environment variable: COPT_LICENSE_DIR
-2025-09-29 16:35:42 [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>Constraint 1 IIS: True2025-10-01 15:49:21 [INFO] checks license for COPT v7.2.8 20250516
+2025-10-01 15:49:21 [WARN] no license files in current working folder: /home/runner/work/PyOptInterface/PyOptInterface/docs/source
+2025-10-01 15:49:21 [WARN] no license files in binary folder: /opt/hostedtoolcache/Python/3.12.11/x64/bin
+2025-10-01 15:49:21 [WARN] no license files in HOME folder: /home/runner/copt
+2025-10-01 15:49:21 [INFO] empty environment variable: COPT_LICENSE_DIR
+2025-10-01 15:49:21 [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
@@ -382,9 +382,8 @@ <h1>Infeasibility Analysis<a class="headerlink" href="#infeasibility-analysis" t
 Model fingerprint: 6e53fbd7
 
 Start the IIS computation for an LP
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span> Iteration  Min RowBnd  Max RowBnd  Min ColBnd  Max ColBnd      Time
+
+ Iteration  Min RowBnd  Max RowBnd  Min ColBnd  Max ColBnd      Time
          0           0           1           0           2      0.00s
          1           0           1           0           2      0.00s
          2           1           1           0           2      0.00s

nonlinear.html

@@ -497,7 +497,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.005
+Total CPU secs in IPOPT (w/o function evaluations)   =      0.003
 Total CPU secs in NLP function evaluations           =      0.000
 
 EXIT: Optimal Solution Found.
@@ -619,7 +619,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.002
 Total CPU secs in NLP function evaluations           =      0.000
 
 EXIT: Optimal Solution Found.
@@ -698,10 +698,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>   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>   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
    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
 
@@ -722,7 +722,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.025
 Total CPU secs in NLP function evaluations           =      0.001
 
 EXIT: Optimal Solution Found.

numpy.html

@@ -351,7 +351,6 @@ <h2>N-queen problem<a class="headerlink" href="#n-queen-problem" title="Link to
    42 rows
    64 cols (64 binary, 0 integer, 0 implied int., 0 continuous, 0 domain fixed)
    270 nonzeros
-Termination status: TerminationStatusCode.OPTIMAL
 
 Src: B =&gt; Branching; C =&gt; Central rounding; F =&gt; Feasibility pump; J =&gt; Feasibility jump;
      H =&gt; Heuristic; L =&gt; Sub-MIP; P =&gt; Empty MIP; R =&gt; Randomized rounding; Z =&gt; ZI Round;
@@ -365,7 +364,10 @@ <h2>N-queen problem<a class="headerlink" href="#n-queen-problem" title="Link to
          1       0         1 100.00%   0               0                  0.00%        0      0      0         0     0.0s
 
 Solving report
-  Status            Optimal
+Termination status: TerminationStatusCode.OPTIMAL
+</pre></div>
+</div>
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>  Status            Optimal
   Primal bound      0
   Dual bound        0
   Gap               0% (tolerance: 0.01%)

searchindex.js

@@ -396,7 +396,10 @@ <h1>Building Bigger Optimization Model<a class="headerlink" href="#building-bigg
 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
-         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>         1       0         1 100.00%   0               0                  0.00%        0      0      0         0     0.0s
 
 Solving report
   Status            Optimal
@@ -420,7 +423,6 @@ <h1>Building Bigger Optimization Model<a class="headerlink" href="#building-bigg
                     0 (strong br.)
                     0 (separation)
                     0 (heuristics)
-Termination status: TerminationStatusCode.OPTIMAL
 </pre></div>
 </div>
 </div>