IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v64y2013i10p1557-1569.html
   My bibliography  Save this article

An interval-coefficient fuzzy binary linear programming, the solution, and its application under uncertainties

Author

Listed:
  • W Peng

    (University of Regina, Saskatchewan, Canada)

  • R V Mayorga

    (University of Regina, Saskatchewan, Canada)

Abstract

The common difficulty in solving a Binary Linear Programming (BLP) problem is uncertainties in the parameters and the model structure. The previous studies of BLP problems normally focus on parameter uncertainty or model structure uncertainty, but not on both types of uncertainties. This paper develops an interval-coefficient Fuzzy Binary Linear Programming (IFBLP) and its solution for BLP problems under uncertainties both on parameters and model structure. In the IFBLP, the parameter uncertainty is represented by the interval coefficients, and the model structure uncertainty is reflected by the fuzzy constraints and a fuzzy goal. A novel and efficient methodology is used to solve the IFLBP into two extreme crisp-coefficient BLPs, which are called the ‘best optimum model’ and the ‘worst optimum model’. The results of these two crisp-coefficient extreme models can bound all outcomes of the IFBLP. One of the contributions in this paper is that it provides a mathematical sound approach (based on some mathematical developments) to find the boundaries of optimal alpha values, so that the linearity of model can be maintained during the conversions. The proposed approach is applied to a traffic noise control plan to demonstrate its capability of dealing with uncertainties.

Suggested Citation

  • W Peng & R V Mayorga, 2013. "An interval-coefficient fuzzy binary linear programming, the solution, and its application under uncertainties," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 64(10), pages 1557-1569, October.
  • Handle: RePEc:pal:jorsoc:v:64:y:2013:i:10:p:1557-1569
    as

    Download full text from publisher

    File URL: http://www.palgrave-journals.com/jors/journal/v64/n10/pdf/jors2012111a.pdf
    File Function: Link to full text PDF
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: http://www.palgrave-journals.com/jors/journal/v64/n10/full/jors2012111a.html
    File Function: Link to full text HTML
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

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

    More about this item

    Statistics

    Access and download statistics

    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:pal:jorsoc:v:64:y:2013:i:10:p:1557-1569. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    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.