Stochastic binary problems with simple penalties for capacity constraints violations

B. Fortz, M. Labbé, F. Louveaux, M. Poss

    Résultats de recherche: Contribution à un journal/une revueArticle

    Résumé

    This paper studies stochastic programs with first-stage binary variables and capacity constraints, using simple penalties for capacities violations. In particular, we take a closer look at the knapsack problem with weights and capacity following independent random variables and prove that the problem is weakly NP-hard in general. We provide pseudo-polynomial algorithms for three special cases of the problem: constant weights and capacity uniformly distributed, subset sum with Gaussian weights and strictly positively distributed random capacity, and subset sum with constant weights and arbitrary random capacity. We then turn to a branch-and-cut algorithm based on the outer approximation of the objective function. We provide computational results for the stochastic knapsack problem (i) with Gaussian weights and constant capacity and (ii) with constant weights and capacity uniformly distributed, on randomly generated instances inspired by computational results for the knapsack problem.

    langue originaleAnglais
    Pages (de - à)199-221
    Nombre de pages23
    journalMathematical Programming
    Volume138
    Numéro de publication1-2
    Les DOIs
    Etat de la publicationPublié - 1 avr. 2013

    Empreinte digitale Examiner les sujets de recherche de « Stochastic binary problems with simple penalties for capacity constraints violations ». Ensemble, ils forment une empreinte digitale unique.

  • Contient cette citation