Data: Solver with Simplex LP, integer branch and bound and a nonlinear method (#326)

Browse Source

data.solver maximises, minimises or targets a value in an objective cell by
changing variable cells under <=, >=, =, int and bin constraints. Simplex LP
linearises the model through recalculation, checks linearity and solves it
with a two-phase simplex; integers use branch and bound. The GRG Nonlinear
choice runs an augmented-Lagrangian projected-gradient method. The model is
saved as hidden solver_* names; Solver Parameters and Solver Results dialogs.

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>

...

This commit is contained in:

vangel76

2026-10-11 12:56:36 +02:00

co-authored by Claude Opus 5.5

parent 9f896c1249

commit dc75b2cf5e

14 changed files with 1704 additions and 9 deletions

Show all changes Ignore whitespace when comparing lines Ignore changes in amount of whitespace Ignore changes in whitespace at EOL

Download Patch File Download Diff File Expand all files Collapse all files

crates/engine/src/cmd/solver.rs

+1487

File diff suppressed because it is too large Load Diff