Deploying to gh-pages from @ 204dcb6 🚀

Author: metab0t

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-08-08 09:46:19 [INFO] checks license for COPT v7.2.8 20250516
-2025-08-08 09:46:19 [WARN] no license files in current working folder: /home/runner/work/PyOptInterface/PyOptInterface/docs/source
-2025-08-08 09:46:19 [WARN] no license files in binary folder: /opt/hostedtoolcache/Python/3.12.11/x64/bin
-2025-08-08 09:46:19 [WARN] no license files in HOME folder: /home/runner/copt
-2025-08-08 09:46:19 [INFO] empty environment variable: COPT_LICENSE_DIR
-2025-08-08 09:46:19 [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-08-08 09:52:58 [INFO] checks license for COPT v7.2.8 20250516
+2025-08-08 09:52:58 [WARN] no license files in current working folder: /home/runner/work/PyOptInterface/PyOptInterface/docs/source
+2025-08-08 09:52:58 [WARN] no license files in binary folder: /opt/hostedtoolcache/Python/3.12.11/x64/bin
+2025-08-08 09:52:58 [WARN] no license files in HOME folder: /home/runner/copt
+2025-08-08 09:52:58 [INFO] empty environment variable: COPT_LICENSE_DIR
+2025-08-08 09:52:58 [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
@@ -386,7 +386,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 0x7f86acb86870&gt;
+<div class="output text_plain highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>&lt;pyoptinterface._src.core_ext.ConstraintIndex at 0x7fed0c956870&gt;
 </pre></div>
 </div>
 </div>
@@ -399,7 +399,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 0x7f86acb86db0&gt;
+<div class="output text_plain highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>&lt;pyoptinterface._src.core_ext.ConstraintIndex at 0x7fed0c956db0&gt;
 </pre></div>
 </div>
 </div>
@@ -413,7 +413,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 0x7f86acb86e10&gt;
+<div class="output text_plain highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>&lt;pyoptinterface._src.core_ext.ConstraintIndex at 0x7fed0c956e10&gt;
 </pre></div>
 </div>
 </div>

examples/economic_dispatch.html

@@ -490,13 +490,14 @@ <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.01s
+        100        14091.031                3      0.00s
         169        13740.237               10      0.01s
 Model status        : Optimal
 Simplex   iterations: 86
 QP ASM    iterations: 169
 Objective value     :  1.3740213571e+04
 P-D objective error :  1.6699127419e-06
+HiGHS run time      :          0.01
 TerminationStatusCode.OPTIMAL
 Objective value:  13740.213571429404
 [[100.         100.         100.         100.         100.
@@ -514,7 +515,6 @@ <h2>Change the load and solve the model again<a class="headerlink" href="#change
    50.          50.          50.          50.          50.28576204
    50.71433367  51.14290531  51.57147694  52.00004857  52.4286202
    52.85719184  53.28576347  53.7143351   54.14290673]]
-HiGHS run time      :          0.01
 </pre></div>
 </div>
 </div>

examples/optimal_control_rocket.html

@@ -503,7 +503,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.351
+Total CPU secs in IPOPT (w/o function evaluations)   =      0.354
 Total CPU secs in NLP function evaluations           =      0.010
 
 EXIT: Optimal Solution Found.

examples/optimal_power_flow.html

@@ -567,9 +567,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.14e-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.3879727096482060e+02    1.7551890838592823e+04
@@ -586,7 +585,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

@@ -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 708 μs, sys: 0 ns, total: 708 μs
-Wall time: 711 μs
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>CPU times: user 561 μs, sys: 113 μs, total: 674 μs
+Wall time: 677 μ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.1 ms, sys: 0 ns, total: 15.1 ms
-Wall time: 15 ms
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>CPU times: user 15.1 ms, sys: 39 μs, total: 15.2 ms
+Wall time: 15.1 ms
 </pre></div>
 </div>
 </div>

getting_started.html

@@ -557,7 +557,9 @@ <h2>Let’s build a simple model and solve it<a class="headerlink" href="#let-s-
 </div>
 <div class="cell_output docutils container">
 <div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>QP   has 1 rows; 2 cols; 2 matrix nonzeros; 2 Hessian nonzeros
-Coefficient ranges:
+</pre></div>
+</div>
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Coefficient ranges:
   Matrix [1e+00, 1e+00]
   Cost   [0e+00, 0e+00]
   Bound  [0e+00, 0e+00]

infeasibility.html

@@ -318,12 +318,12 @@ <h1>Infeasibility Analysis<a class="headerlink" href="#infeasibility-analysis" t
 <div class="cell_output docutils container">
 <div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Constraint 1 IIS: True
 Constraint 2 IIS: True
-2025-08-08 09:46:29 [INFO] checks license for COPT v7.2.8 20250516
-2025-08-08 09:46:29 [WARN] no license files in current working folder: /home/runner/work/PyOptInterface/PyOptInterface/docs/source
-2025-08-08 09:46:29 [WARN] no license files in binary folder: /opt/hostedtoolcache/Python/3.12.11/x64/bin
-2025-08-08 09:46:29 [WARN] no license files in HOME folder: /home/runner/copt
-2025-08-08 09:46:29 [INFO] empty environment variable: COPT_LICENSE_DIR
-2025-08-08 09:46:29 [WARN] no license files in EV &#39;COPT_LICENSE_DIR&#39;: 
+2025-08-08 09:53:07 [INFO] checks license for COPT v7.2.8 20250516
+2025-08-08 09:53:07 [WARN] no license files in current working folder: /home/runner/work/PyOptInterface/PyOptInterface/docs/source
+2025-08-08 09:53:07 [WARN] no license files in binary folder: /opt/hostedtoolcache/Python/3.12.11/x64/bin
+2025-08-08 09:53:07 [WARN] no license files in HOME folder: /home/runner/copt
+2025-08-08 09:53:07 [INFO] empty environment variable: COPT_LICENSE_DIR
+2025-08-08 09:53:07 [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

model.html

@@ -424,14 +424,12 @@ <h2>Inspect and customize the model<a class="headerlink" href="#inspect-and-cust
   Iteration        Objective     NullspaceDim
           0                1                0      0.00s
           2       0.50000002                1      0.00s
-Objective value: 0.49999999999999994
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Model status        : Optimal
+Model status        : Optimal
 QP ASM    iterations: 2
 Objective value     :  5.0000000000e-01
 P-D objective error :  2.4999999473e-08
 HiGHS run time      :          0.00
+Objective value: 0.49999999999999994
 </pre></div>
 </div>
 </div>

nonlinear.html

@@ -608,7 +608,9 @@ <h2>Nonlinear constraints and objectives<a class="headerlink" href="#nonlinear-c
   10  2.3797236e-04 0.00e+00 2.19e-01  -1.7 5.09e-02    -  1.00e+00 1.00e+00f  1
   11  4.9267371e-06 0.00e+00 5.95e-02  -1.7 2.53e-02    -  1.00e+00 1.00e+00f  1
   12  2.8189505e-09 0.00e+00 8.31e-04  -2.5 3.20e-03    -  1.00e+00 1.00e+00f  1
-  13  9.9920072e-16 0.00e+00 8.68e-07  -5.7 9.78e-05    -  1.00e+00 1.00e+00f  1
+</pre></div>
+</div>
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>  13  9.9920072e-16 0.00e+00 8.68e-07  -5.7 9.78e-05    -  1.00e+00 1.00e+00f  1
   14  0.0000000e+00 0.00e+00 1.57e-13  -8.6 4.65e-08    -  1.00e+00 1.00e+00f  1
 
 Number of Iterations....: 14
@@ -628,7 +630,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.007
+Total CPU secs in IPOPT (w/o function evaluations)   =      0.004
 Total CPU secs in NLP function evaluations           =      0.000
 
 EXIT: Optimal Solution Found.
@@ -707,9 +709,7 @@ <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
-</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
+   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
 </pre></div>
 </div>
@@ -733,7 +733,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.028
+Total CPU secs in IPOPT (w/o function evaluations)   =      0.027
 Total CPU secs in NLP function evaluations           =      0.001
 
 EXIT: Optimal Solution Found.

numpy.html

@@ -362,7 +362,6 @@ <h2>N-queen problem<a class="headerlink" href="#n-queen-problem" title="Link to
    270 nonzeros
 
 Src: B =&gt; Branching; C =&gt; Central rounding; F =&gt; Feasibility pump; J =&gt; Feasibility jump;
-Termination status: TerminationStatusCode.OPTIMAL
      H =&gt; Heuristic; L =&gt; Sub-MIP; P =&gt; Empty MIP; R =&gt; Randomized rounding; Z =&gt; ZI Round;
      I =&gt; Shifting; S =&gt; Solve LP; T =&gt; Evaluate node; U =&gt; Unbounded; X =&gt; User solution;
      z =&gt; Trivial zero; l =&gt; Trivial lower; u =&gt; Trivial upper; p =&gt; Trivial point
@@ -372,8 +371,10 @@ <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
-
-Solving report
+Termination status: TerminationStatusCode.OPTIMAL
+</pre></div>
+</div>
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Solving report
   Status            Optimal
   Primal bound      0
   Dual bound        0