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

Minimizing A Linear Objective Function Subject To Fuzzy Relation Equations Constraints With Max-Hamacher Product Composition

Author

Listed:
  • ALI ABBASI MOLAI

    (Faculty of Mathematics and Computer Science, Amirkabir University of Technology, Hafez Avenue, Tehran, Iran)

  • ESMAILE KHORRAM

    (Faculty of Mathematics and Computer Science, Amirkabir University of Technology, Hafez Avenue, Tehran, Iran)

Abstract

In this paper, an optimization model with a linear objective function subject to a system of fuzzy relation equations, using max-Hamacher product composition operator, is presented. Since its nonempty feasible solution set is in general a nonconvex set, conventional linear programming methods are not suitable to solve such a problem, so an efficient solution procedure for such problems is necessary. In this paper, the feasible solution set of this problem is studied at first. Then, one efficient algorithm (i.e. tabular method algorithm) is proposed in order to solve the problem. Some procedures are also presented to reduce the original problem. Then, the reduced problem is decomposed (if possible) into several sub-problems with smaller dimensions, so solving them becomes very easier by the algorithm. By combining the algorithm and these procedures, another more efficient algorithm is suggested in order to obtain the optimal solution of the original problem. Some numerical examples are also given to illustrate the algorithms.

Suggested Citation

  • Ali Abbasi Molai & Esmaile Khorram, 2008. "Minimizing A Linear Objective Function Subject To Fuzzy Relation Equations Constraints With Max-Hamacher Product Composition," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 25(02), pages 243-266.
  • Handle: RePEc:wsi:apjorx:v:25:y:2008:i:02:n:s0217595908001717
    DOI: 10.1142/S0217595908001717
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595908001717
    Download Restriction: Access to full text is restricted to subscribers

    File URL: https://libkey.io/10.1142/S0217595908001717?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:25:y:2008:i:02:n:s0217595908001717. 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.