Optimization guided lower and upper bounds for the resource investment problem

Optimization guided lower and upper bounds for the resource investment problem

0.00 Avg rating0 Votes
Article ID: iaor20013860
Country: United Kingdom
Volume: 52
Issue: 3
Start Page Number: 340
End Page Number: 351
Publication Date: Mar 2001
Journal: Journal of the Operational Research Society
Authors: ,
Keywords: allocation: resources, programming: linear
Abstract:

The resource investment problem deals with the issue of providing resources to a project such that a given deadline can be met. The objective is to make the resources available in the cheapest possible way. For each resource, expenses depend on the maximum amount required during the course of the project. In this paper we develop two lower bounds for this NP-hard problem using Lagrangean relaxation and column generation techniques, respectively. Both procedures are capable of yielding feasible solutions as well. Hence, we also have two optimization guided heuristics. A computational study consisting of a set of 3210 instances compares both approaches and allows insight into the performance.

Reviews

Required fields are marked *. Your email address will not be published.