{"id":{"repo_id":"vt","oai_identifier":"oai:vtechworks.lib.vt.edu:10919/106123"},"canonical_url":"https://search.dev.ndltd.org/etd/vt/oai:vtechworks.lib.vt.edu:10919/106123","repository":{"repo_id":"vt","name":"Virginia Tech","base_url":"https://vtechworks.lib.vt.edu/oai/request"},"display":{"title":"A microcomputer-based budget allocation and planning algorithm for interdependent projects","abstract":"A budget allocation and planning algorithm was developed for the economic evaluation of interdependent projects. Projects may be characterized by discrete point estimates or by continuous functions. The unique approach of this algorithm is that, if continuous functions are used, the analyst may specify a functional relationship between costs and returns. Budget planning techniques were incorporated into the algorithm to aid the decision maker in planning for future budgetary needs and in influencing the budget determination process. The algorithm utilizes a future worth of net return criterion in conducting the analyses. All projects under consideration need not have the same life; unequal-lived projects may be considered. The algorithm was coded in BASIC on an IBM Personal Computer. Two versions of the algorithm were developed; one which utilizes discrete point estimates to characterize projects, and one which utilizes continuous functions. The algorithm identifies the optimal combination of projects, given a budget profile and various project interdependencies. After the optimal portfolio of projects is identified, four sensitivity analyses may be run to analyze the effect of any uncertainty in the decision environment. An example is provided to illustrate the capabilities and limitations of the algorithm.","abstract_html":"A budget allocation and planning algorithm was developed for the economic evaluation of interdependent projects. Projects may be characterized by discrete point estimates or by continuous functions. The unique approach of this algorithm is that, if continuous functions are used, the analyst may specify a functional relationship between costs and returns. Budget planning techniques were incorporated into the algorithm to aid the decision maker in planning for future budgetary needs and in influencing the budget determination process. The algorithm utilizes a future worth of net return criterion in conducting the analyses. All projects under consideration need not have the same life; unequal-lived projects may be considered. The algorithm was coded in BASIC on an IBM Personal Computer. Two versions of the algorithm were developed; one which utilizes discrete point estimates to characterize projects, and one which utilizes continuous functions. The algorithm identifies the optimal combination of projects, given a budget profile and various project interdependencies. After the optimal portfolio of projects is identified, four sensitivity analyses may be run to analyze the effect of any uncertainty in the decision environment. An example is provided to illustrate the capabilities and limitations of the algorithm.","abstract_has_math":false,"creators":["Kladivko, Kurt A."],"institution":"Virginia Polytechnic Institute and State University","degree_name":"M.S.","degree_level":"masters","degree_discipline":"Industrial Engineering and Operations Research","degree_department":"Industrial Engineering and Operations Research","school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":1986,"date_issued":"1986","date_published":"1986","updated_at":"2026-07-22T22:18:44Z","subjects":[],"languages":["en"],"rights":["In Copyright"],"rights_urls":["http://rightsstatements.org/vocab/InC/1.0/"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/10919/106123","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.department","label":"Department","values":["Industrial Engineering and Operations Research"]},{"key":"dc:creator","label":"Author","values":["Kladivko, Kurt A."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2021-10-26T20:10:13Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2021-10-26T20:10:13Z"]},{"key":"dc:date.issued","label":"Date","values":["1986"]},{"key":"dc:publisher","label":"Institution","values":["Virginia Polytechnic Institute and State University"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"dc:type.dcmitype","label":"Dc Type Dcmitype","values":["Text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Industrial Engineering and Operations Research"]},{"key":"thesis:degree_level","label":"Degree Level","values":["masters"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Virginia Polytechnic Institute and State University"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["In Copyright"]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://rightsstatements.org/vocab/InC/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/10919/106123"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["A budget allocation and planning algorithm was developed for the economic evaluation of interdependent projects. Projects may be characterized by discrete point estimates or by continuous functions. The unique approach of this algorithm is that, if continuous functions are used, the analyst may specify a functional relationship between costs and returns. Budget planning techniques were incorporated into the algorithm to aid the decision maker in planning for future budgetary needs and in influencing the budget determination process. The algorithm utilizes a future worth of net return criterion in conducting the analyses. All projects under consideration need not have the same life; unequal-lived projects may be considered. The algorithm was coded in BASIC on an IBM Personal Computer. Two versions of the algorithm were developed; one which utilizes discrete point estimates to characterize projects, and one which utilizes continuous functions. The algorithm identifies the optimal combination of projects, given a budget profile and various project interdependencies. After the optimal portfolio of projects is identified, four sensitivity analyses may be run to analyze the effect of any uncertainty in the decision environment. An example is provided to illustrate the capabilities and limitations of the algorithm."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["M.S."]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["A microcomputer-based budget allocation and planning algorithm for interdependent projects"]}]}],"canonical_facts":{"dc:contributor.department":["Industrial Engineering and Operations Research"],"dc:creator":["Kladivko, Kurt A."],"dc:date.accessioned":["2021-10-26T20:10:13Z"],"dc:date.available":["2021-10-26T20:10:13Z"],"dc:date.issued":["1986"],"dc:description.abstract":["A budget allocation and planning algorithm was developed for the economic evaluation of interdependent projects. Projects may be characterized by discrete point estimates or by continuous functions. The unique approach of this algorithm is that, if continuous functions are used, the analyst may specify a functional relationship between costs and returns. Budget planning techniques were incorporated into the algorithm to aid the decision maker in planning for future budgetary needs and in influencing the budget determination process. The algorithm utilizes a future worth of net return criterion in conducting the analyses. All projects under consideration need not have the same life; unequal-lived projects may be considered. The algorithm was coded in BASIC on an IBM Personal Computer. Two versions of the algorithm were developed; one which utilizes discrete point estimates to characterize projects, and one which utilizes continuous functions. The algorithm identifies the optimal combination of projects, given a budget profile and various project interdependencies. After the optimal portfolio of projects is identified, four sensitivity analyses may be run to analyze the effect of any uncertainty in the decision environment. An example is provided to illustrate the capabilities and limitations of the algorithm."],"dc:description.degree":["M.S."],"dc:format.mimetype":["application/pdf"],"dc:identifier.uri":["http://hdl.handle.net/10919/106123"],"dc:language.iso":["en"],"dc:publisher":["Virginia Polytechnic Institute and State University"],"dc:rights":["In Copyright"],"dc:rights.uri":["http://rightsstatements.org/vocab/InC/1.0/"],"dc:title":["A microcomputer-based budget allocation and planning algorithm for interdependent projects"],"dc:type":["Thesis"],"dc:type.dcmitype":["Text"],"thesis:degree_discipline":["Industrial Engineering and Operations Research"],"thesis:degree_level":["masters"],"thesis:degree_name":["M.S."],"thesis:institution_name":["Virginia Polytechnic Institute and State University"]},"updated_at":"2026-07-22T22:18:44Z"}