Abstract
Geometric programming provides a powerful tool for solving nonlinear problems where nonlinear relations can be well presented by exponential or power function. This paper develops a procedure to derive the lower and upper bounds of the objective of the posynomial geometric programming problem when the cost and constraint parameters are uncertain. The imprecise parameters are represented by ranges, instead of single values. An imprecise geometric program is transformed to a family of conventional geometric programs to calculate the objective value. The derived result is also in a range, where the objective value would appear. The ability of calculating the bounds of the objective value developed in this paper might help lead to more realistic modeling efforts in engineering design areas.
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.
