Abstract
The paper proposes a branch-and-bound method to find the global solution of general polynomial programs. The problem is first transformed into a reversed posynomial program. The procedure, which is a combination of a previously developed branch-and-bound method and of a well-known cutting plane algorithm, only requires the solution of linear subproblems.
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.
