Interval arithmetic in unidimensional signomial programming

This paper applies an interval arithmetic version of Newton's method to unidimensional problems in signomial programming. Unidimensional dual problems occur in engineering design problems formulated as a signomial program with a single degree of difficulty. Unidimensional primal problems are of interest, since many multidimensional search procedures involve unidimensional searches. The interval arithmetic method is guaranteed to generate all the local optima.The authors are grateful to the National Science Foundation for support through a Graduate Fellowship and Grant No. GK-41301.