Abstract
This paper puts forward a novel affine relaxation-based algorithm for solving the minimax affine fractional program problem (MAFPP) over a polyhedron set. First of all, some new variables are introduced for deriving the equivalence problem (EP) of the MAFPP. Then, for the EP, the affine relaxation problem (ARP) is established by using the two-stage affine relaxation method. The method provides a lower bound by solving the ARP in the branch-and-bound searching process. By subdividing the output space rectangle and solving a series of ARPs continuously, the feasible solution sequence generated by the algorithm converges to a global optimal solution of the initial problem. In addition, the algorithmic maximum iteration in the worst case is estimated by complexity analysis for the first time. Lastly, the practicability and effectiveness of the algorithm have been verified by numerical experimental results.
Published Version
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 call