IDEAS home Printed from https://ideas.repec.org/a/hin/jnlaor/279181.html
   My bibliography  Save this article

Multiobjective Two-Stage Stochastic Programming Problems with Interval Discrete Random Variables

Author

Listed:
  • S. K. Barik
  • M. P. Biswal
  • D. Chakravarty

Abstract

Most of the real-life decision-making problems have more than one conflicting and incommensurable objective functions. In this paper, we present a multiobjective two-stage stochastic linear programming problem considering some parameters of the linear constraints as interval type discrete random variables with known probability distribution. Randomness of the discrete intervals are considered for the model parameters. Further, the concepts of best optimum and worst optimum solution are analyzed in two-stage stochastic programming. To solve the stated problem, first we remove the randomness of the problem and formulate an equivalent deterministic linear programming model with multiobjective interval coefficients. Then the deterministic multiobjective model is solved using weighting method, where we apply the solution procedure of interval linear programming technique. We obtain the upper and lower bound of the objective function as the best and the worst value, respectively. It highlights the possible risk involved in the decision-making tool. A numerical example is presented to demonstrate the proposed solution procedure.

Suggested Citation

  • S. K. Barik & M. P. Biswal & D. Chakravarty, 2012. "Multiobjective Two-Stage Stochastic Programming Problems with Interval Discrete Random Variables," Advances in Operations Research, Hindawi, vol. 2012, pages 1-21, December.
  • Handle: RePEc:hin:jnlaor:279181
    DOI: 10.1155/2012/279181
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/AOR/2012/279181.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/AOR/2012/279181.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2012/279181?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
    ---><---

    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:hin:jnlaor:279181. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.