A general form for the capital projects sequencing problem

被引:4
作者
Taylor, RG
机构
[1] North Carolina State Univ, Raleigh, NC
关键词
capital budgeting; decision support; mathematical optimization; project management; sequencing;
D O I
10.1016/S0360-8352(97)00038-7
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
The capital sequencing problem consists of finding the lowest cost starting times for a set of capital projects when such projects: 1) are exposed to the effects of inflation, 2) cost different amounts, 3) require different lengths of time to complete, and 4) have dissimilar cash outflows per period. The problem is non-trivial when the timing of the projects is constrained by any one, or any combination of, twelve possibilities. The problem is modeled as a straightforward mathematical zero-one programming problem, and is complicated only by the large number of constraints which are typically needed for a problem of realistic size. (C) 1997 Elsevier Science Ltd.
引用
收藏
页码:47 / 50
页数:4
相关论文
empty
未找到相关数据