Transport-type problems with a minimax criterion

被引:0
作者
Mironov, AA [1 ]
Tsurkov, VI [1 ]
机构
[1] RUSSIAN ACAD SCI,CTR COMP,MOSCOW,RUSSIA
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The set of all matrix-plans of a standard transport problem is studied. The largest element of a matrix of this is set and the su of the largest element in a matrix and the largest elements in every column and row of this matrix are goal functions. The minimum of every goal function is determined and an optimal matrix is constructed on which all goal functions attain their-minimum. The minima-a case for integral matrix-plans of a transport problem is treated separately.
引用
收藏
页码:1752 / 1759
页数:8
相关论文
共 10 条
[1]  
BURKOV VN, 1974, AVTOMAT TELEMEKH, P103
[2]  
BURKOV VN, 1977, MATH PRINCIPLES ACTI
[3]  
Demyanov V.F., 1972, INTRO MINIMAX
[4]  
EMELICHEV VA, 1981, POLYHEDRA GRAPHS OPT
[5]  
MIRONOV AA, 1993, DOKL AKAD NAUK+, V333, P437
[6]  
MIRONOV AA, 1992, DOKL AKAD NAUK+, V324, P959
[7]  
MIRONOV AA, 1992, DOKL AKAD NAUK, V336, P35
[8]  
MOISEEV NN, 1979, THEORY OPERATIONS RE
[9]  
Owen G, 1971, GAME THEORY
[10]  
TRIUS EB, 1967, MATH PROGRAMMING TRA