You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
This is Ipopt version 3.13.2, running with linear solver ma27.
580
+
<divclass="output stream highlight-myst-ansi notranslate"><divclass="highlight"><pre><span></span>This is Ipopt version 3.13.2, running with linear solver ma27.
584
581
585
582
Number of nonzeros in equality constraint Jacobian...: 0
586
583
Number of nonzeros in inequality constraint Jacobian.: 0
@@ -631,7 +628,7 @@ <h2>Nonlinear constraints and objectives<a class="headerlink" href="#nonlinear-c
631
628
Number of equality constraint Jacobian evaluations = 0
632
629
Number of inequality constraint Jacobian evaluations = 0
633
630
Number of Lagrangian Hessian evaluations = 14
634
-
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
631
+
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
635
632
Total CPU secs in NLP function evaluations = 0.000
This is Ipopt version 3.13.2, running with linear solver ma27.
692
+
<divclass="output stream highlight-myst-ansi notranslate"><divclass="highlight"><pre><span></span>This is Ipopt version 3.13.2, running with linear solver ma27.
697
693
698
694
Number of nonzeros in equality constraint Jacobian...: 8000
699
695
Number of nonzeros in inequality constraint Jacobian.: 0
Copy file name to clipboardExpand all lines: numpy.html
+5-5Lines changed: 5 additions & 5 deletions
Original file line number
Diff line number
Diff line change
@@ -364,16 +364,16 @@ <h2>N-queen problem<a class="headerlink" href="#n-queen-problem" title="Link to
364
364
Src: B => Branching; C => Central rounding; F => Feasibility pump; J => Feasibility jump;
365
365
H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; Z => ZI Round;
366
366
I => Shifting; S => Solve LP; T => Evaluate node; U => Unbounded; X => User solution;
367
-
Termination status: TerminationStatusCode.OPTIMAL
368
-
</pre></div>
369
-
</div>
370
-
<divclass="output stream highlight-myst-ansi notranslate"><divclass="highlight"><pre><span></span> z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point
367
+
z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point
371
368
372
369
Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work
373
370
Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time
0 commit comments