Global optimization for signomial discrete programming problems in engineering design

Jung Fa Tsai, Han-Lin Li*, Nian Ze Hu

*Corresponding author for this work

Research output: Contribution to journalArticle

36 Scopus citations


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 languageEnglish
Pages (from-to)613-622
Number of pages10
JournalEngineering Optimization
Issue number6
StatePublished - 1 Dec 2002


  • Convexification
  • Global optimization
  • Signomial discrete programming problem

Fingerprint Dive into the research topics of 'Global optimization for signomial discrete programming problems in engineering design'. Together they form a unique fingerprint.

  • Cite this