a deterministic algorithm for stochastic multistage
play

A deterministic algorithm for stochastic multistage problems or - PowerPoint PPT Presentation

A deterministic algorithm for stochastic multistage problems or The problem-child algorithm Regan Baucke, Anthony Downward, Golbon Zakeri CERMICS, Ecole des Ponts ParisTech reganbaucke.github.io CMS and MMEI 2019 27 th March 2019 Stochastic


  1. C ( u ) u ¯ C ( u ) = max µ + ⟨ λ, u ⟩ µ ∈ R ,λ ∈ R n s . t . µ + ⟨ λ, ˆ u ⟩ ≤ G (ˆ u ) , ∀ ˆ u, || λ || ∗ ≤ α. The upper bound function | Construction

  2. C ( u ) u ¯ C ( u ) = max µ + ⟨ λ, u ⟩ µ ∈ R ,λ ∈ R n s . t . µ + ⟨ λ, ˆ u ⟩ ≤ C (ˆ u ) , ∀ ˆ u, || λ || ∗ ≤ α. The upper bound function | Construction

  3. Example 1 2 C 1 ( u ) + 1 min 2 C 2 ( u ) u ∈U The problem-child algorithm | Two-stage problem

  4. 1 2 C 1 + 1 2 C 2 C 2 C 1

  5. 1 2 C 1 + 1 2 C 2 C 2 C 1

  6. 1 2 C 1 + 1 2 C 2 C 2 C 1

  7. 1 2 C 1 + 1 2 C 2 C 2 C 1

  8. 1 2 C 1 + 1 2 C 2 C 2 C 1

  9. 1 2 C 1 + 1 2 C 2 C 2 C 1

  10. 1 2 C 1 + 1 2 C 2 C 2 C 1

  11. 1 2 C 1 + 1 2 C 2 C 2 C 1

  12. 1 2 C 1 + 1 2 C 2 C 2 C 1

  13. 1 2 C 1 + 1 2 C 2 C 2 C 1

  14. 1 2 C 1 + 1 2 C 2 C 2 C 1

  15. 1 2 C 1 + 1 2 C 2 C 2 C 1

  16. 1 2 C 1 + 1 2 C 2 C 2 C 1

  17. 1 2 C 1 + 1 2 C 2 C 2 C 1

  18. 1 2 C 1 + 1 2 C 2 C 2 C 1

  19. 1 2 C 1 + 1 2 C 2 C 2 C 1

  20. 1 2 C 1 + 1 2 C 2 C 2 C 1

  21. 1 2 C 1 + 1 2 C 2 C 2 C 1

  22. 1 2 C 1 + 1 2 C 2 C 2 C 1

  23. 1 2 C 1 + 1 2 C 2 C 2 C 1

  24. 1 2 C 1 + 1 2 C 2 C 2 C 1

  25. 1 2 C 1 + 1 2 C 2 C 2 C 1

  26. The problem-child algorithm | Two-stage problem

  27. The problem-child algorithm | Two-stage problem

  28. The problem-child algorithm | Two-stage problem

  29. The problem-child algorithm | Two-stage problem

  30. The problem-child algorithm | Two-stage problem

  31. The problem-child algorithm | Two-stage problem

  32. The problem-child algorithm | Two-stage problem

  33. The problem-child algorithm | Two-stage problem

  34. The problem-child algorithm | Two-stage problem

  35. The problem-child algorithm | Two-stage problem

  36. The problem-child algorithm | Two-stage problem

  37. The problem-child algorithm | Two-stage problem

  38. Let’s fjx some notation: ∑ V n ( x n ) = min C n ( x n , u n ) + p ( n, m ) V m ( x m ) x m ,u n m ∈ R ( n ) s . t . x m = f m ( x n , u n ) , ∀ m ∈ R ( n ) , x m ∈ X m , ∀ m ∈ R ( n ) , u n ∈ U n ( x n ) . We want to compute V 0 ( x 0 ) . The problem-child algorithm | The multistage problem

  39. The problem-child algorithm | The multistage problem

  40. The problem-child algorithm | The multistage problem

  41. The problem-child algorithm | The multistage problem

  42. The problem-child algorithm | The multistage problem

  43. The problem-child algorithm | The multistage problem

  44. The problem-child algorithm | The multistage problem

  45. The problem-child algorithm | The multistage problem

  46. The problem-child algorithm | The multistage problem

  47. The problem-child algorithm | The multistage problem

  48. The problem-child algorithm | The multistage problem

  49. The problem-child algorithm | The multistage problem

  50. The problem-child algorithm | The multistage problem

  51. The problem-child algorithm | The multistage problem

  52. The problem-child algorithm | The multistage problem

  53. The problem-child algorithm | The multistage problem

  54. The problem-child algorithm | The multistage problem

  55. The problem-child algorithm | The multistage problem

  56. The problem-child algorithm | The multistage problem

  57. The problem-child algorithm | The multistage problem

  58. The problem-child algorithm | The multistage problem

  59. The problem-child algorithm | The multistage problem

  60. The problem-child algorithm | The multistage problem

  61. The problem-child algorithm | The multistage problem

Recommend


More recommend