Article ID: | iaor1993850 |
Country: | Netherlands |
Volume: | 18 |
Start Page Number: | 323 |
End Page Number: | 332 |
Publication Date: | Oct 1992 |
Journal: | Information and Decision Technologies |
Authors: | Aderoba Adeyemi |
Keywords: | programming: branch and bound |
This is a model for the selection of a subset of industrial projects from a larger set, and the determination of the basic strategic pre-investment decisions for the selected projects. These decisions include the choice of project locations, their resource supply sources, and product markets. Constraints on the availability of resources and market demands are considered. The model allows multiple assignment as well as no assignment of projects to locations. It also permits the inclusion of secondary constraints. An efficient branch-and-bound algorithm has been developed.