The variable sequencing approach: A solution to the capital budget allocation model

MaRDI QIDQ3639627zbMATH OpenFDO

Authors Elias Munapo

Publication date 23 October 2009

Full work available at URL http://www.ripublication.com/Volume/aamav2n1.htm

zbMATH Keywords

binary variablecapital budgeting and dynamic programmingNP-completerankingsequencing

Mathematics Subject Classification ID

Dynamic programming (90C39) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• Discrete dynamic programming and capital allocation
• scientific article; zbMATH DE number 1530371
• A fast interactive solution method for large capital expenditure selection problems
• Generating the Discrete Efficient Frontier to the Capital Budgeting Problem
• Dependent-chance integer programming applied to capital budgeting

Cited in

(1)

• A fast interactive solution method for large capital expenditure selection problems

Describes a project that uses

Uses Software

• ABACUS
• SYMPHONY

This page was built for publication: The variable sequencing approach: A solution to the capital budget allocation model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3639627)