IDEAS home Printed from https://ideas.repec.org/a/wly/apsmbi/v31y2015i6p862-874.html
   My bibliography  Save this article

Comparison of two algorithms for solving a two‐stage bilinear stochastic programming problem with quantile criterion

Author

Listed:
  • Andrey Kibzun

Abstract

The paper is devoted to solving the two‐stage problem of stochastic programming with quantile criterion. It is assumed that the loss function is bilinear in random parameters and strategies, and the random vector has a normal distribution. Two algorithms are suggested to solve the problem, and they are compared. The first algorithm is based on the reduction of the original stochastic problem to a mixed integer linear programming problem. The second algorithm is based on the reduction of the problem to a sequence of convex programming problems. Performance characteristics of both the algorithms are illustrated by an example. A modification of both the algorithms is suggested to reduce the computing time. The new algorithm uses the solution obtained by the second algorithm as a starting point for the first algorithm. Copyright © 2015 John Wiley & Sons, Ltd.

Suggested Citation

  • Andrey Kibzun, 2015. "Comparison of two algorithms for solving a two‐stage bilinear stochastic programming problem with quantile criterion," Applied Stochastic Models in Business and Industry, John Wiley & Sons, vol. 31(6), pages 862-874, November.
    • Handle: RePEc:wly:apsmbi:v:31:y:2015:i:6:p:862-874
    DOI: 10.1002/asmb.2115
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/asmb.2115
    Download Restriction: no
    File URL: https://libkey.io/10.1002/asmb.2115?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:wly:apsmbi:v:31:y:2015:i:6:p:862-874. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1526-4025 .

    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.