docs: update unreleased changelog entries

Co-authored-by: Copilot <223556219+Copilot@users.noreply.github.com>

Author: rasheedja

ChangeLog.md

@@ -2,48 +2,34 @@
 
 ## Unreleased changes
 
-### Breaking changes
-
-- **`twoPhaseSimplex` signature changed**:
-  - Old: `ObjectiveFunction -> [PolyConstraint] -> m (Maybe Result)`
-  - New: `VarDomainMap -> [ObjectiveFunction] -> [PolyConstraint] -> m SimplexResult`
-  - The first argument is now a `VarDomainMap` specifying variable domains
-  - The second argument is now a **list** of `ObjectiveFunction`; pass an empty list to check
-    feasibility only (Phase 1) without optimising
-  - The return type is now `SimplexResult` (see below)
-- **`VarDomain` type restructured** to support upper bounds:
-  - Replaced `NonNegative`, `LowerBound SimplexNum`, and `Unbounded` constructors with
-    a single `Bounded { lowerBound :: Maybe SimplexNum, upperBound :: Maybe SimplexNum }` record
-  - `Bounded Nothing Nothing` is equivalent to the old `Unbounded`
-  - `Bounded (Just 0) Nothing` is equivalent to the old `NonNegative`
-  - Added smart constructors: `unbounded`, `nonNegative`, `lowerBoundOnly`, `upperBoundOnly`,
-    and `boundedRange`
-- **`Result` and `SimplexMeta` types removed**; replaced by:
-  - `SimplexResult { feasibleSystem :: Maybe FeasibleSystem, objectiveResults :: [ObjectiveResult] }`
-    — the top-level return from `twoPhaseSimplex`
-  - `ObjectiveResult { objectiveFunction :: ObjectiveFunction, outcome :: OptimisationOutcome }`
-    — the result for each objective function
-  - `OptimisationOutcome` — describes the outcome of optimising a single objective (optimal
-    value found, unbounded, or infeasible)
-
-### New features
-
-- Upper bounds on variables are now supported: use `upperBoundOnly` or `boundedRange` in the
-  `VarDomainMap`; upper bounds are automatically added as LEQ constraints
-- `twoPhaseSimplex` can optimise multiple objective functions in a single call against one
-  constraint set; results are returned in the same order as the input list
-- Added `VarDomainMap` type for mapping variables to their domains; variables not present are
-  assumed `unbounded`
-
-### Infrastructure
-
-- Added Nix flake (`flake.nix`) for a reproducible dev environment via `nix develop` (GHC 9.6,
-  cabal, stack, fourmolu, hlint, HLS)
-- Added `Makefile` with `make build`, `make test`, `make ci`, etc.; supports both cabal and
-  stack via `BUILD_TOOL=cabal|stack` (default: cabal)
-- CI now tests GHC 9.2–9.12 across ubuntu, macos, and windows (cabal); Stack LTS 22.44 on
-  ubuntu and macos; and a Nix-based job running both cabal and stack
-- Replaced HUnit golden tests with HSpec (`hspec-discover`)
+- `twoPhaseSimplex` now takes a `VarDomainMap` as its first argument
+  - Specify each variable's domain using smart constructors: `nonNegative`, `unbounded`, `lowerBoundOnly`, `upperBoundOnly`, or `boundedRange`
+  - Variables not in the `VarDomainMap` are assumed to be `unbounded`
+  - To keep the same behaviour as before (all vars non-negative), use `nonNegative` for all variables
+- `twoPhaseSimplex` now takes a list of `ObjectiveFunction`s instead of a single one
+  - Optimise multiple variables against one constraint set in a single call
+  - Pass an empty list to run Phase 1 only (feasibility check)
+- `twoPhaseSimplex` now returns `SimplexResult` instead of `Maybe Result`
+  - `SimplexResult` contains `Maybe FeasibleSystem` and `[ObjectiveResult]`
+  - Each `ObjectiveResult` pairs an `ObjectiveFunction` with its `OptimisationOutcome`
+  - `OptimisationOutcome` is either `Optimal { varValMap }` or `Unbounded`
+- `optimizeFeasibleSystem` now returns `OptimisationOutcome` instead of `Maybe Result`
+- Restructured `VarDomain` type to support upper bounds
+  - Replaced `NonNegative`, `LowerBound SimplexNum`, and `Unbounded` constructors with a single `Bounded { lowerBound :: Maybe SimplexNum, upperBound :: Maybe SimplexNum }` record
+  - Added smart constructors: `unbounded`, `nonNegative`, `lowerBoundOnly`, `upperBoundOnly`, and `boundedRange`
+- Added `VarDomainMap` newtype for mapping variables to their domains
+- Added `VarTransform` type with `AddLowerBound`, `AddUpperBound`, `Shift`, and `Split` constructors
+- Removed `Result`, `SimplexMeta`, `SystemWithSlackVarRow`, `Equation` types
+- Removed `extractObjectiveValue` and `foldDictValue` utility functions
+- Renamed `prettyShowVarConstMap` to `prettyShowVarLitMapSum`
+- Widened dependency version bounds (supports GHC 9.2–9.12)
+- Removed `package.yaml`; `simplex-method.cabal` is now maintained directly
+- Use HSpec for tests
+- Add Nix flake
+- Add Makefile with cabal and stack support
+- Add CI for cabal (GHC 9.2–9.12), stack (LTS 22.44), and Nix
+- Explicit import lists on all modules
+- Bump Stackage LTS to 22.44
 
 ## [v0.2.0.0](https://github.com/rasheedja/LPPaver/tree/v0.2.0.0)