Research Reports from the Department of Operations
Document Type
Report
Publication Date
6-1-1969
Abstract
This paper utilizes binary programming formulations of certain R&D project selection problems. This formulation leads to significant computational advantages over the previous formulations. The first problem considered is that of allocating a specified budget among a set of technical approaches, so that the probability of at least one approach being successfully completed is maximized. Secondly, the problem of multi-period allocation is considered, where the objective function is the same as above. Thirdly, a shared project model is also considered, where each project can be allocated different amounts. An algorithm to solve binary programming problems has been developed by Professor Egon Balas and has been programmed by Jack Mathis.
Keywords
Operations research, Research and development projects, Project management--Mathematical models, Resource allocation--Mathematical models
Publication Title
Technical Memorandums from the Department of Operations, School of Management, Case Western Reserve University
Issue
Technical memorandum no. 153
Rights
This work is in the public domain and may be freely downloaded for personal or academic use
Recommended Citation
Rao, Arza K., "Applications of binary programming to R&D project selection problems" (1969). Research Reports from the Department of Operations. 46.
https://commons.case.edu/wsom-ops-reports/46