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

Linearization Of 0-1 Multi-Quadratic Fractional Programming Problem

Author

Listed:
  • R. KAPOOR

    (Department of Mathematics, I.P. College, University of Delhi, Delhi-110007, India)

  • S. R. ARORA

    (Department of Mathematics, Hansraj College, University of Delhi, Delhi-110007, India)

Abstract

The considered problem in this paper is a 0-1 Multi-Quadratic Fractional Programming Problem (0-1MQFP) without the restriction of positive denominators. The two important contributions of the paper are: (a) it proposes a linearization technique to solve any type of 0-1MQFP problem; and (b) when applied to the 0-1MQFP problem with the restriction of positive denominators, it requires less number of constraints and variables as compare with the available techniques in the literature. The problem is proved to be NP-hard. The linearization process is summarized with the help of an algorithm and flow chart, and further illustrated by examples. Codes for linearizing 0-1MQFPP is given in the APPENDIX.

Suggested Citation

  • R. Kapoor & S. R. Arora, 2009. "Linearization Of 0-1 Multi-Quadratic Fractional Programming Problem," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 26(01), pages 59-84.
    • Handle: RePEc:wsi:apjorx:v:26:y:2009:i:01:n:s0217595909002092
    DOI: 10.1142/S0217595909002092
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595909002092
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595909002092?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:26:y:2009:i:01:n:s0217595909002092. 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.