link.springer.com/article/10.1007/s10107-021-01740-0

Preview meta tags from the link.springer.com website.

Linked Hostnames

28

Thumbnail

Search Engine Appearance

Google

https://link.springer.com/article/10.1007/s10107-021-01740-0

Non-convex nested Benders decomposition - Mathematical Programming

We propose a new decomposition method to solve multistage non-convex mixed-integer (stochastic) nonlinear programming problems (MINLPs). We call this algor



Bing

Non-convex nested Benders decomposition - Mathematical Programming

https://link.springer.com/article/10.1007/s10107-021-01740-0

We propose a new decomposition method to solve multistage non-convex mixed-integer (stochastic) nonlinear programming problems (MINLPs). We call this algor



DuckDuckGo

https://link.springer.com/article/10.1007/s10107-021-01740-0

Non-convex nested Benders decomposition - Mathematical Programming

We propose a new decomposition method to solve multistage non-convex mixed-integer (stochastic) nonlinear programming problems (MINLPs). We call this algor

  • General Meta Tags

    127
    • title
      Non-convex nested Benders decomposition | Mathematical Programming
    • charset
      UTF-8
    • X-UA-Compatible
      IE=edge
    • applicable-device
      pc,mobile
    • viewport
      width=device-width, initial-scale=1

  • Open Graph Meta Tags

    6
    • og:url
      https://link.springer.com/article/10.1007/s10107-021-01740-0
    • og:type
      article
    • og:site_name
      SpringerLink
    • og:title
      Non-convex nested Benders decomposition - Mathematical Programming
    • og:description
      We propose a new decomposition method to solve multistage non-convex mixed-integer (stochastic) nonlinear programming problems (MINLPs). We call this algorithm non-convex nested Benders decomposition (NC-NBD). NC-NBD is based on solving dynamically improved mixed-integer linear outer approximations of the MINLP, obtained by piecewise linear relaxations of nonlinear functions. Those MILPs are solved to global optimality using an enhancement of nested Benders decomposition, in which regularization, dynamically refined binary approximations of the state variables and Lagrangian cut techniques are combined to generate Lipschitz continuous non-convex approximations of the value functions. Those approximations are then used to decide whether the approximating MILP has to be dynamically refined and in order to compute feasible solutions for the original MINLP. We prove that NC-NBD converges to an $$\varepsilon $$ ε -optimal solution in a finite number of steps. We provide promising computational results for some unit commitment problems of moderate size.

  • Twitter Meta Tags

    6
    • twitter:site
      @SpringerLink
    • twitter:card
      summary_large_image
    • twitter:image:alt
      Content cover image
    • twitter:title
      Non-convex nested Benders decomposition
    • twitter:description
      Mathematical Programming - We propose a new decomposition method to solve multistage non-convex mixed-integer (stochastic) nonlinear programming problems (MINLPs). We call this algorithm non-convex...

  • Item Prop Meta Tags

    3
    • position
      1
    • position
      2
    • position
      3

  • Link Tags

    9
    • apple-touch-icon
      /oscar-static/img/favicons/darwin/apple-touch-icon-6ef0829b9c.png
    • canonical
      https://link.springer.com/article/10.1007/s10107-021-01740-0
    • icon
      /oscar-static/img/favicons/darwin/android-chrome-192x192.png
    • icon
      /oscar-static/img/favicons/darwin/favicon-32x32.png
    • icon
      /oscar-static/img/favicons/darwin/favicon-16x16.png

Emails

1

Links

317