In this paper, a sectoral investment planning
model is examined from computaüonal point of view. It is a well known fact that
conventional mixed bivalent programming models with complex combinatorial
structures are generally intractable.
The paper exploits such a model to determine what capacity,
if any, should be maintained at the various geographical regions during the
planning period in order to meet regional demand and minimise total cost of the
entire system. A Lagrangean relaxation-basedprocedure
is developed to decompose the model into submodels by each geographical region
and planning year. Following that, computationally efficient algorithms to
solve the submodels are presented and computational results are discussed
Primary Language | English |
---|---|
Journal Section | Articles |
Authors | |
Publication Date | December 31, 1994 |
Submission Date | January 1, 1994 |
Published in Issue | Year 1994 Volume: 12 |
Manuscripts must conform to the requirements indicated on the last page of the Journal - Guide for Authors- and in the web page.
Privacy Statement
Names and e-mail addresses in this Journal Web page will only be used for the specified purposes of the Journal; they will not be opened for any other purpose or use by any other person.