Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

Chance constrained optimal beam design: Convex reformulation and probabilistic robust design

Jakub KůdelaPavel Popela — 2018

Kybernetika

In this paper, we are concerned with a civil engineering application of optimization, namely the optimal design of a loaded beam. The developed optimization model includes ODE-type constraints and chance constraints. We use the finite element method (FEM) for the approximation of the ODE constraints. We derive a convex reformulation that transforms the problem into a linear one and find its analytic solution. Afterwards, we impose chance constraints on the stress and the deflection of the beam....

Warm-start cuts for Generalized Benders Decomposition

Jakub KůdelaPavel Popela — 2017

Kybernetika

In this paper, we describe a decomposition algorithm suitable for two-stage convex stochastic programs known as Generalized Benders Decomposition. For this algorithm we propose a new reformulation that incorporates a lower bound cut that serves as a warm-start, decreasing the overall computation time. Additionally, we test the performance of the proposed reformulation on two modifications of the algorithm (bunching and multicut) using numerical examples. The numerical part is programmed in MATLAB...

Page 1

Download Results (CSV)