Deploying to gh-pages from @ 3fcafdf 🚀

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-12-11 12:53:54 [INFO] checks license for COPT v8.0.2 20251201
-2025-12-11 12:53:54 [WARN] no license files in current working folder: /home/runner/work/PyOptInterface/PyOptInterface/docs/source
-2025-12-11 12:53:54 [WARN] no license files in binary folder: /opt/hostedtoolcache/Python/3.12.12/x64/bin
-2025-12-11 12:53:54 [WARN] no license files in HOME folder: /home/runner/copt
-2025-12-11 12:53:54 [INFO] empty environment variable: COPT_LICENSE_DIR
-2025-12-11 12:53: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-11 13:01:34 [INFO] checks license for COPT v8.0.2 20251201
+2025-12-11 13:01:34 [WARN] no license files in current working folder: /home/runner/work/PyOptInterface/PyOptInterface/docs/source
+2025-12-11 13:01:34 [WARN] no license files in binary folder: /opt/hostedtoolcache/Python/3.13.11/x64/bin
+2025-12-11 13:01:34 [WARN] no license files in HOME folder: /home/runner/copt
+2025-12-11 13:01:34 [INFO] empty environment variable: COPT_LICENSE_DIR
+2025-12-11 13:01:34 [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 0x7fc6105733f0&gt;
+<div class="output text_plain highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>&lt;pyoptinterface._src.core_ext.ConstraintIndex at 0x7f84d0eec4b0&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 0x7fc6105738f0&gt;
+<div class="output text_plain highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>&lt;pyoptinterface._src.core_ext.ConstraintIndex at 0x7f84d0eecc90&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 0x7fc610573930&gt;
+<div class="output text_plain highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>&lt;pyoptinterface._src.core_ext.ConstraintIndex at 0x7f84d0eeccf0&gt;
 </pre></div>
 </div>
 </div>

container.html

@@ -486,7 +486,7 @@ <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
+        100        5.8333336               50      0.01s
         200        3.3333335              100      0.01s
         300        2.3611112              150      0.01s
         360        2.0000001              180      0.01s

examples/economic_dispatch.html

@@ -486,11 +486,6 @@ <h2>Change the load and solve the model again<a class="headerlink" href="#change
         100        14091.031                3      0.01s
         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.
@@ -510,6 +505,13 @@ <h2>Change the load and solve the model again<a class="headerlink" href="#change
    52.85719184  53.28576347  53.7143351   54.14290673]]
 </pre></div>
 </div>
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Simplex   iterations: 86
+QP ASM    iterations: 169
+Objective value     :  1.3740213571e+04
+P-D objective error :  1.6699127419e-06
+HiGHS run time      :          0.01
+</pre></div>
+</div>
 </div>
 </div>
 </section>

examples/optimal_control_rocket.html

@@ -498,7 +498,7 @@ <h2>Implementation<a class="headerlink" href="#implementation" title="Link to th
 Total CPU secs in NLP function evaluation
 </pre></div>
 </div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>s           =      0.011
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>s           =      0.010
 
 EXIT: Optimal Solution Found.
 </pre></div>

examples/optimal_power_flow.html

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

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 699 μs, sys: 0 ns, total: 699 μs
-Wall time: 703 μs
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>CPU times: user 751 μs, sys: 0 ns, total: 751 μs
+Wall time: 753 μ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 15.5 ms, sys: 0 ns, total: 15.5 ms
-Wall time: 15.3 ms
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>CPU times: user 15.7 ms, sys: 0 ns, total: 15.7 ms
+Wall time: 15.4 ms
 </pre></div>
 </div>
 </div>

infeasibility.html

@@ -307,17 +307,7 @@ <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 constraints2025-12-11 12:54:04 [INFO] checks license for COPT v8.0.2 20251201
-2025-12-11 12:54:04 [WARN] no license files in current working folder: /home/runner/work/PyOptInterface/PyOptInterface/docs/source
-2025-12-11 12:54:04 [WARN] no license files in binary folder: /opt/hostedtoolcache/Python/3.12.12/x64/bin
-2025-12-11 12:54:04 [WARN] no license files in HOME folder: /home/runner/copt
-2025-12-11 12:54:04 [INFO] empty environment variable: COPT_LICENSE_DIR
-2025-12-11 12:54:04 [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
-
-
+<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
 Please apply for a license from www.shanshu.ai/copt
 
 Model fingerprint: 43b22f9c
@@ -338,6 +328,17 @@ <h1>Infeasibility Analysis<a class="headerlink" href="#infeasibility-analysis" t
 Constraint 2 IIS: True
 </pre></div>
 </div>
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>2025-12-11 13:01:42 [INFO] checks license for COPT v8.0.2 20251201
+2025-12-11 13:01:42 [WARN] no license files in current working folder: /home/runner/work/PyOptInterface/PyOptInterface/docs/source
+2025-12-11 13:01:42 [WARN] no license files in binary folder: /opt/hostedtoolcache/Python/3.13.11/x64/bin
+2025-12-11 13:01:42 [WARN] no license files in HOME folder: /home/runner/copt
+2025-12-11 13:01:42 [INFO] empty environment variable: COPT_LICENSE_DIR
+2025-12-11 13:01:42 [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>
 </div>
 <p>This code snippet creates an infeasible model with two constraints and finds the IIS of the model. Obviously, the constraints are contradictory because <code class="docutils literal notranslate"><span class="pre">x</span> <span class="pre">+</span> <span class="pre">2</span> <span class="pre">*</span> <span class="pre">y</span> <span class="pre">&lt;=</span> <span class="pre">1</span></code> and <code class="docutils literal notranslate"><span class="pre">x</span> <span class="pre">+</span> <span class="pre">y</span> <span class="pre">&gt;=</span> <span class="pre">5</span></code> cannot be satisfied at the same time when <code class="docutils literal notranslate"><span class="pre">x</span></code> and <code class="docutils literal notranslate"><span class="pre">y</span></code> are non-negative. The optimizer will detect that the model is infeasible and return the IIS, which is the set of constraints that cause the infeasibility. We can query whether a constraint is in the IIS by calling <code class="docutils literal notranslate"><span class="pre">get_constraint_attribute</span></code> with the <code class="docutils literal notranslate"><span class="pre">ConstraintAttribute.IIS</span></code> attribute.</p>

model.html

@@ -414,10 +414,10 @@ <h2>Inspect and customize the model<a class="headerlink" href="#inspect-and-cust
   Bound   [1e+00, 1e+00]
   RHS     [1e+00, 1e+00]
   Iteration        Objective     NullspaceDim
-Objective value: 0.49999999999999994
           0                1                0      0.00s
           2       0.50000002                1      0.00s
 Model status        : Optimal
+Objective value: 0.49999999999999994
 QP ASM    iterations: 2
 Objective value     :  5.0000000000e-01
 P-D objective error :  2.4999999473e-08

nonlinear.html

@@ -477,7 +477,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
@@ -497,7 +499,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.002
+Total CPU secs in IPOPT (w/o function evaluations)   =      0.005
 Total CPU secs in NLP function evaluations           =      0.000
 
 EXIT: Optimal Solution Found.
@@ -619,8 +621,11 @@ <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.005
-Total CPU secs in NLP function evaluations           =      0.000
+Total CPU secs in IPOPT (w/o function evaluations)   =      0.003
+Total CPU secs in NLP function evaluations 
+</pre></div>
+</div>
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>          =      0.000
 
 EXIT: Optimal Solution Found.
 </pre></div>
@@ -704,9 +709,8 @@ <h2>Mixing nonlinear and linear/quadratic constraints together<a class="headerli
 <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
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Number of Iterations....: 4
+
+Number of Iterations....: 4
 
                                    (scaled)                 (unscaled)
 Objective...............:   3.5000000000000318e+02    3.5000000000000318e+02

numpy.html

@@ -352,8 +352,10 @@ <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
-
-Src: B =&gt; Branching; C =&gt; Central rounding; F =&gt; Feasibility pump; H =&gt; Heuristic;
+Termination status: TerminationStatusCode.OPTIMAL
+</pre></div>
+</div>
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Src: B =&gt; Branching; C =&gt; Central rounding; F =&gt; Feasibility pump; H =&gt; Heuristic;
      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
@@ -362,7 +364,6 @@ <h2>N-queen problem<a class="headerlink" href="#n-queen-problem" title="Link to
 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
-Termination status: TerminationStatusCode.OPTIMAL
          1       0         1 100.00%   0               0                  0.00%        0      0      0         0     0.0s
 
 Solving report
@@ -376,7 +377,7 @@ <h2>N-queen problem<a class="headerlink" href="#n-queen-problem" title="Link to
                     0 (bound viol.)
                     0 (int. viol.)
                     0 (row viol.)
-  Timing            0.02
+  Timing            0.01
   Max sub-MIP depth 0
   Nodes             1
   Repair LPs        0