Optimization of capital budgeting for interrelated capacity expansion projects

Ali E. Haghani, Chien-Hung Wei

Research output: Chapter in Book/Report/Conference proceedingChapter

1 Citation (Scopus)

Abstract

A network representation procedure for the optimization of capital budgeting problems is proposed. Interrelated capacity expansion projects and discrete time decisions are considered. An alternative-based approach is proposed that yields a very neat formulation by identifying the relationships among alternatives before solving the problem. The most general pairwise interactions are considered, and a 0-1 integer program is formulated with nonlinear objective function and linear constraints. Procedures are demonstrated that convert the nonlinear program into a linear form with an embedded network structure. The out-of-kilter algorithm is applied to solve the resulting network flow problem. Because of the inherent nature of the network structure, this approach enables efficient calculation of optimal solutions for relatively large problems. Computational efficiency is shown that requires less than 3 min of central processing unit time for a system with 372 alternatives.

Original languageEnglish
Title of host publicationTransportation Research Record
Pages27-35
Number of pages9
Edition1400
Publication statusPublished - 1993

Fingerprint

Budget control
Computational efficiency
Program processors

All Science Journal Classification (ASJC) codes

  • Civil and Structural Engineering

Cite this

Haghani, A. E., & Wei, C-H. (1993). Optimization of capital budgeting for interrelated capacity expansion projects. In Transportation Research Record (1400 ed., pp. 27-35)
Haghani, Ali E. ; Wei, Chien-Hung. / Optimization of capital budgeting for interrelated capacity expansion projects. Transportation Research Record. 1400. ed. 1993. pp. 27-35
@inbook{0f92b0457397400eb9ece20f121657ac,
title = "Optimization of capital budgeting for interrelated capacity expansion projects",
abstract = "A network representation procedure for the optimization of capital budgeting problems is proposed. Interrelated capacity expansion projects and discrete time decisions are considered. An alternative-based approach is proposed that yields a very neat formulation by identifying the relationships among alternatives before solving the problem. The most general pairwise interactions are considered, and a 0-1 integer program is formulated with nonlinear objective function and linear constraints. Procedures are demonstrated that convert the nonlinear program into a linear form with an embedded network structure. The out-of-kilter algorithm is applied to solve the resulting network flow problem. Because of the inherent nature of the network structure, this approach enables efficient calculation of optimal solutions for relatively large problems. Computational efficiency is shown that requires less than 3 min of central processing unit time for a system with 372 alternatives.",
author = "Haghani, {Ali E.} and Chien-Hung Wei",
year = "1993",
language = "English",
pages = "27--35",
booktitle = "Transportation Research Record",
edition = "1400",

}

Haghani, AE & Wei, C-H 1993, Optimization of capital budgeting for interrelated capacity expansion projects. in Transportation Research Record. 1400 edn, pp. 27-35.

Optimization of capital budgeting for interrelated capacity expansion projects. / Haghani, Ali E.; Wei, Chien-Hung.

Transportation Research Record. 1400. ed. 1993. p. 27-35.

Research output: Chapter in Book/Report/Conference proceedingChapter

TY - CHAP

T1 - Optimization of capital budgeting for interrelated capacity expansion projects

AU - Haghani, Ali E.

AU - Wei, Chien-Hung

PY - 1993

Y1 - 1993

N2 - A network representation procedure for the optimization of capital budgeting problems is proposed. Interrelated capacity expansion projects and discrete time decisions are considered. An alternative-based approach is proposed that yields a very neat formulation by identifying the relationships among alternatives before solving the problem. The most general pairwise interactions are considered, and a 0-1 integer program is formulated with nonlinear objective function and linear constraints. Procedures are demonstrated that convert the nonlinear program into a linear form with an embedded network structure. The out-of-kilter algorithm is applied to solve the resulting network flow problem. Because of the inherent nature of the network structure, this approach enables efficient calculation of optimal solutions for relatively large problems. Computational efficiency is shown that requires less than 3 min of central processing unit time for a system with 372 alternatives.

AB - A network representation procedure for the optimization of capital budgeting problems is proposed. Interrelated capacity expansion projects and discrete time decisions are considered. An alternative-based approach is proposed that yields a very neat formulation by identifying the relationships among alternatives before solving the problem. The most general pairwise interactions are considered, and a 0-1 integer program is formulated with nonlinear objective function and linear constraints. Procedures are demonstrated that convert the nonlinear program into a linear form with an embedded network structure. The out-of-kilter algorithm is applied to solve the resulting network flow problem. Because of the inherent nature of the network structure, this approach enables efficient calculation of optimal solutions for relatively large problems. Computational efficiency is shown that requires less than 3 min of central processing unit time for a system with 372 alternatives.

UR - http://www.scopus.com/inward/record.url?scp=0027858169&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0027858169&partnerID=8YFLogxK

M3 - Chapter

SP - 27

EP - 35

BT - Transportation Research Record

ER -

Haghani AE, Wei C-H. Optimization of capital budgeting for interrelated capacity expansion projects. In Transportation Research Record. 1400 ed. 1993. p. 27-35