Abstract
The posynomial fractional programming (PFP) problem arises from the summation minimization of several quotient terms, which are composed of posynomial terms appearing in the objective function subject to given posynomial constraints. This paper proposes an approximate approach to solving a PFP problem. A linear programming relaxation is derived for the problem based on piecewise linearization techniques, which first convert a posynomial term into the sum of absolute terms; these absolute terms are then linearized by some linearization techniques. The proposed approach could reach a solution as close as possible to a global optimum.
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.
