Global optimization for signomial discrete programming problems in engineering design

Global optimization for signomial discrete programming problems in engineering design

0.00 Avg rating0 Votes
Article ID: iaor20032488
Country: United Kingdom
Volume: 34
Issue: 6
Start Page Number: 613
End Page Number: 622
Publication Date: Dec 2002
Journal: Engineering Optimization
Authors: , ,
Keywords: programming: geometric, programming: integer, programming: convex, engineering
Abstract:

This paper proposes a novel method to solve signomial discrete programming (SDP) problems frequently occurring in engineering design. Various signomial terms are first convexified following different strategies. The original SDP program is then converted into a convex integer program solvable by commercialized packages to obtain globally optimal solutions. Compared with current SDP methods, the proposed method is guaranteed to converge to a global optimum, is computationally more efficient, and is capable of treating zero boundary problems. Numerical examples are presented to demonstrate the usefulness of the proposed method in engineering design.

Reviews

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