## Abstract

We consider the objective function of a simple integer recourse problem with fixed technology matrix and discretely distributed right-hand sides. Exploiting the special structure of this problem, we devise an algorithm that determines the convex hull of this function efficiently. The results are improvements over those in a previous paper. In the first place, the convex hull of many objective functions in the class is covered, instead of only one-dimensional versions. In the second place, the algorithm is faster than the one in the previous paper. Moreover, some new results on the structure of the objective function are presented

Original language | English |
---|---|

Pages (from-to) | 67-81 |

Journal | Annals of Operations Research |

Volume | 64 |

Issue number | 1 |

DOIs | |

Publication status | Published - 1996 |