search

lkapelevich / SDDiP.jl

The functionality from this package has been moved to https://github.com/odow/SDDP.jl
Other
8 stars 3 forks source link

better initial bound #16

Closed lkapelevich closed 6 years ago

lkapelevich commented 6 years ago

Use MIP solution as a starting bound in the dual problem. Thanks @loehndorf for pointing this out.

codecov-io commented 6 years ago

Codecov Report

:exclamation: No coverage uploaded for pull request base (master@72ea16f). Click here to learn what that means. The diff coverage is 100%.

Impacted file tree graph

@@            Coverage Diff            @@
##             master      #16   +/-   ##
=========================================
  Coverage          ?   93.27%           
=========================================
  Files             ?        9           
  Lines             ?      431           
  Branches          ?        0           
=========================================
  Hits              ?      402           
  Misses            ?       29           
  Partials          ?        0
Impacted Files Coverage Δ
src/Lagrangian/levelmethod.jl 93.33% <ø> (ø)
src/Lagrangian/subgradient.jl 96.49% <ø> (ø)
src/Lagrangian/kelley.jl 87.5% <ø> (ø)
src/solver.jl 98.33% <100%> (ø)

Continue to review full report at Codecov.

Legend - Click here to learn more Δ = absolute <relative> (impact), ø = not affected, ? = missing data Powered by Codecov. Last update 72ea16f...a0d6346. Read the comment docs.