A CONSTRAINT QUALIFICATION FOR A DYNAMIC TRAFFIC ASSIGNMENT MODEL

被引:53
作者
CAREY, M
机构
关键词
MATHEMATICAL PROGRAMMING; DYNAMIC - SYSTEMS SCIENCE AND CYBERNETICS - Constraint Theory - TRANSPORTATION - Operations Research;
D O I
10.1287/trsc.20.1.55
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
This note resolves an open question as to whether a dynamic traffic assignment model, which was developed and analyzed in earlier issues of this journal, satisfies a 'constraint qualification. ' It is shown that the model does in fact satisfy a constraint qualification, which establishes the validity of the optimality analysis presented by previous authors.
引用
收藏
页码:55 / 58
页数:4
相关论文
共 7 条
[1]  
Bazaraa S., 1970, NONLINEAR PROGRAMMIN
[2]  
CAREY M, 1982, MODELLING NETWORK FL
[3]  
CAREY M, UNPUB OPERATIONS RES
[4]   A SUCCESSIVE LINEAR OPTIMIZATION APPROACH TO THE DYNAMIC TRAFFIC ASSIGNMENT PROBLEM [J].
HO, JK .
TRANSPORTATION SCIENCE, 1980, 14 (04) :295-305
[5]  
Merchant D. K., 1978, Transportation Science, V12, P200, DOI 10.1287/trsc.12.3.200
[6]   MODEL AND AN ALGORITHM FOR THE DYNAMIC TRAFFIC ASSIGNMENT PROBLEMS. [J].
Merchant, Deepak K. ;
Nemhauser, George L. .
1600, (12)
[7]  
MERCHANT DK, 1974, THESIS CORNELL U