Benoît Legat

Results 290 issues of Benoît Legat

The lowerbound and status should be the ones of the master node in the backward pass, not of the forward pass. cc @gerardcel

See https://github.com/odow/SDDP.jl/pull/72

New abstraction : at each iteration, you give it the stats and it returns the number of samples you need to do for this iteration and whether you need to...

See test Optimize Stock/Add scenario latter

An `AbstractNode` must implements `getoptimalitycut` and `getfeasibilitycut`. * `getoptimalitycut` must returns a `MinFunCut` (do you prefer `UBFunCut` ?) (`θ ≦ ⟨a, x⟩ + β`) or a `MaxFunCut` (do you prefer...

When adding `:AddImmediately` [here](https://github.com/blegat/StochasticDualDynamicProgramming.jl/blob/0b8d2296082c395275d141b31a77b4b609e0d074/test/prob5.2.jl#L4) some tests fails

In the following https://github.com/dionysos-dev/Dionysos.jl/pull/352, resolving the environment `Dionysos/BipedRobot/Project.toml` takes hours. You can see in the following log that it took 6 hours to do `Pkg.instantiate()` with Julia v1.10.2: https://github.com/dionysos-dev/Dionysos.jl/actions/runs/8783197708/job/24099651447?pr=352 Steps...

@wg030 this does not seem to work out of the box with the new version of `jlcode`, what should be the recommended way to use jlcode v6.0 for the JuliaCon...