On the convex hull of the simple integer recourse objective function

  • Klein Haneveld W
  • Stougie L
  • van der Vlerk M
  • 16


    Mendeley users who have this article in their library.
  • 18


    Citations of this article.


We consider the objective function of a simple integer recourse problem with fixed technology matrix. Using properties of the expected value function, we prove a relation between the convex hull of this function and the expected value function of a continuous simple recourse program. We present an algorithm to compute the convex hull of the expected value function in case of discrete right-hand side random variables. Allowing for restrictions on the first stage decision variables, this result is then extended to the convex hull of the objective function. [ABSTRACT FROM AUTHOR]

Author-supplied keywords

  • Simple integer recourse
  • convex hull

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Willem K. Klein Haneveld

  • Leen Stougie

  • Maarten H. van der Vlerk

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free