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.
| Original language | English |
|---|---|
| Pages (from-to) | 613-622 |
| Number of pages | 10 |
| Journal | Engineering Optimization |
| Volume | 34 |
| Issue number | 6 |
| DOIs | |
| State | Published - Dec 2002 |
Keywords
- Convexification
- Global optimization
- Signomial discrete programming problem