Lagrangean relaxation and subgradient optimization applied to optimal design with discrete sizing

Lagrangean relaxation and subgradient optimization applied to optimal design with discrete sizing

0.00 Avg rating0 Votes
Article ID: iaor19911012
Country: United Kingdom
Volume: 16
Issue: 3
Start Page Number: 221
End Page Number: 233
Publication Date: Oct 1990
Journal: Engineering Optimization
Authors: ,
Keywords: design, programming: nonlinear, programming: integer, lagrange multipliers
Abstract:

The discrete sizing problem in optimal design is addressed. Lagrangean dual approaches earlier published are briefly reviewed and it is noted that quite sophisticated procedures have been used to solve the dual problems. The simple concept of Lagrangean relaxation combined with subgradient optimization and Lagrangean heuristics has, however, not been applied to the discrete sizing problem. In this paper a scheme based on this concept is described and tested on some small problems. The results indicate that subgradient optimization is completely capable of solving the dual problem. Moreover it is possible to devise heuristics that construct feasible solutions to the original problem, using the Lagrangean subproblem solution.

Reviews

Required fields are marked *. Your email address will not be published.