Detail publikace

Optimum Beam Design via Stochastic Programming

Originální název

Optimum Beam Design via Stochastic Programming

Anglický název

Optimum Beam Design via Stochastic Programming

Jazyk

en

Originální abstrakt

The purpose of the paper is to discuss the applicability of stochastic programming models and methods to civil engineering design problems. In cooperation with experts in civil engineering, the problem concerning an optimal design of beam dimensions has been chosen. The corresponding mathematical model involves an ODE-type constraint, uncertain parameter related to the material characteristics and multiple criteria. As a result, a multi-criteria stochastic nonlinear optimization model is obtained. It has been shown that two-stage stochastic programming offers a promising approach to solving similar problems. A computational scheme for this type of problems is proposed, including discretization methods for random elements and ODE constraint. An approximation is derived to implement the mathematical model and solve it in GAMS. The solution quality is determined by an interval estimate of the optimality gap computed by a Monte Carlo bounding technique. The parametric analysis of a multi-criteria model results in efficient frontier computation. Furthermore, a progressive hedging algorithm is implemented and tested for the selected problem in view of the future possibilities of parallel computing of large engineering problems. Finally, two discretization methods are compared by using GAMS and ANSYS.

Anglický abstrakt

The purpose of the paper is to discuss the applicability of stochastic programming models and methods to civil engineering design problems. In cooperation with experts in civil engineering, the problem concerning an optimal design of beam dimensions has been chosen. The corresponding mathematical model involves an ODE-type constraint, uncertain parameter related to the material characteristics and multiple criteria. As a result, a multi-criteria stochastic nonlinear optimization model is obtained. It has been shown that two-stage stochastic programming offers a promising approach to solving similar problems. A computational scheme for this type of problems is proposed, including discretization methods for random elements and ODE constraint. An approximation is derived to implement the mathematical model and solve it in GAMS. The solution quality is determined by an interval estimate of the optimality gap computed by a Monte Carlo bounding technique. The parametric analysis of a multi-criteria model results in efficient frontier computation. Furthermore, a progressive hedging algorithm is implemented and tested for the selected problem in view of the future possibilities of parallel computing of large engineering problems. Finally, two discretization methods are compared by using GAMS and ANSYS.

BibTex


@article{BUT49738,
  author="Eva {Mrázková} and Pavel {Popela} and Michal {Mrázek}",
  title="Optimum Beam Design via Stochastic Programming",
  annote="The purpose of the paper is to discuss the applicability of stochastic programming models and methods to civil engineering design problems. In cooperation with experts in civil engineering, the problem concerning an optimal design of beam dimensions has been chosen. The corresponding mathematical model involves an ODE-type constraint, uncertain parameter related to the material characteristics and multiple criteria. As a result, a multi-criteria stochastic nonlinear optimization model is obtained. It has been shown that two-stage stochastic programming offers a promising approach to solving similar problems. A computational scheme for this type of problems is proposed, including discretization methods for random elements and ODE constraint. An approximation is derived to implement the mathematical model and solve it in GAMS. The solution quality is determined by an interval estimate of the optimality gap computed by a Monte Carlo bounding technique. The parametric analysis of a multi-criteria model results in efficient frontier computation. Furthermore, a progressive hedging algorithm is implemented and tested for the selected problem in view of the future possibilities of parallel computing of large engineering problems. Finally, two discretization methods are compared by using GAMS and ANSYS.",
  address="Institute of Information Theory and Automation",
  chapter="49738",
  institution="Institute of Information Theory and Automation",
  journal="Kybernetika",
  number="3",
  volume="46",
  year="2010",
  month="june",
  pages="571--582",
  publisher="Institute of Information Theory and Automation",
  type="journal article - other"
}