MODELS FOR PLANNING CAPACITY EXPANSION OF CONVENIENCE STORES UNDER UNCERTAIN DEMAND AND THE VALUE OF INFORMATION

被引:12
作者
WAGNER, JM
BERMAN, O
机构
[1] UNIV MASSACHUSETTS,DEPT MANAGEMENT SCI & INFORMAT SYST,BOSTON,MA 02125
[2] UNIV TORONTO,TORONTO,ON,CANADA
关键词
D O I
10.1007/BF02031742
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
Several stochastic optimization models for planning capacity expansion for convenience store chains (or other similar businesses) are developed that incorporate uncertainty in future demand. All of these models generate schedules for capacity expansion, specifying the size, location, and timing of these expansions in order to maximize the expected profit to the company and to remain within a budget constraint on available resources. The models differ in how uncertainty is incorporated, specifically they differ in the point in the decision-making process that the uncertainty in the demand is resolved. Several measures of the value of information are defined by comparing the results from the different models. Two sample problems are given and their solutions for the various approaches compared.
引用
收藏
页码:19 / 44
页数:26
相关论文
共 18 条
[1]  
[Anonymous], 1986, NUMERICAL RECIPES
[2]   CAPACITY EXPANSION UNDER STOCHASTIC DEMANDS [J].
BEAN, JC ;
HIGLE, JL ;
SMITH, RL .
OPERATIONS RESEARCH, 1992, 40 :S210-S216
[3]  
BERMAN O, 1994, NAV RES LOG, V41, P545, DOI 10.1002/1520-6750(199406)41:4<545::AID-NAV3220410407>3.0.CO
[4]  
2-Z
[5]  
BERMAN O, 1991, 91101 CLARK U TECHN
[7]  
BIRGE JR, 1993, 932 U MICH DEP IND O
[8]  
Brooke A., 1988, GAMS USERS GUIDE
[9]   THE DECOMPOSITION ALGORITHM FOR LINEAR-PROGRAMS [J].
DANTZIG, GB ;
WOLFE, P .
ECONOMETRICA, 1961, 29 (04) :767-778
[10]   EXACT METHODS FOR THE KNAPSACK-PROBLEM AND ITS GENERALIZATIONS [J].
DUDZINSKI, K ;
WALUKIEWICZ, S .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1987, 28 (01) :3-21