Abstract
One-dimensional problems arise in both primal and dual signomial programs. Primal problems are of interest since many multidimensional search procedures involve one-dimensional searches. Dual problems occur naturally since many engineering design problems can be expressed as signomial programs with a single degree of difficulty. This paper applies an interval arithmetic version of Newton's method to one-dimensional unconstrained problems in signomial programming. The interval arithmetic method is guaranteed to generate all the stationary points.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
