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 |
Dergiye yayımlanmak üzere gönderilecek yazılar Dergi'nin son sayfasında ve Dergi web sistesinde yer alan Yazar Rehberi'ndeki kurallara uygun olmalıdır.
Gizlilik Beyanı
Bu dergi sitesindeki isimler ve e-posta adresleri sadece bu derginin belirtilen amaçları doğrultusunda kullanılacaktır; farklı herhangi bir amaç için veya diğer kişilerin kullanımına açılmayacaktır.