IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v41y2024i05ns0217595923500367.html
   My bibliography  Save this article

A Novel Affine Relaxation-Based Algorithm for Minimax Affine Fractional Program

Author

Listed:
  • Hongwei Jiao

    (School of Mathematical Sciences, Henan Institute of Science and Technology, Hualan Street, Henan, Xinxiang 453003, P. R. China)

  • Binbin Li

    (School of Mathematical Sciences, Henan Institute of Science and Technology, Hualan Street, Henan, Xinxiang 453003, P. R. China)

  • Youlin Shang

    (School of Mathematics and Statistics, Henan University of Science and Technology, Kaiyuan Street, Henan, Luoyang 471023, P. R. China)

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.

Suggested Citation

  • Hongwei Jiao & Binbin Li & Youlin Shang, 2024. "A Novel Affine Relaxation-Based Algorithm for Minimax Affine Fractional Program," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 41(05), pages 1-25, October.
    • Handle: RePEc:wsi:apjorx:v:41:y:2024:i:05:n:s0217595923500367
    DOI: 10.1142/S0217595923500367
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595923500367
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595923500367?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wsi:apjorx:v:41:y:2024:i:05:n:s0217595923500367. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.