A family of stochastic programming test problems based on a model for tactical manpower planning

A family of stochastic programming test problems based on a model for tactical manpower planning

0.00 Avg rating0 Votes
Article ID: iaor20061217
Country: Germany
Volume: 4
Issue: 4
Start Page Number: 369
End Page Number: 390
Publication Date: Dec 2005
Journal: Journal of Mathematical Modelling and Algorithms
Authors: , ,
Keywords: programming: linear, programming: probabilistic
Abstract:

Ariyawansa and Felt have recently created a test problem collection for testing software for stochastic linear programs. This freely-available, web-based collection was originally created with 35 problem instances from 11 problem families representing a variety of application areas. This collection was created with plans for enriching it with problem instances based on different application areas from the research community. The work of Martel and Al-Nuaimi on manpower planning under uncertain demand represents an application area suitable for creating new problem instances to be added to the collection. The purpose of this paper is to describe the construction of a new family of stochastic programming test problems based on their work. As part of our construction, we review their work leading to an extension of their models for which their solution procedure does not apply. The new test problems are based on this extension. We also present solutions to the test problems obtained using the software package CPA for stochastic programming developed by Ariyawansa, Felt and Sarich.

Reviews

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