UNRESTRICTED VARIABLES IN LINEAR-PROGRAMMING

被引:1
作者
SCHECHTER, M
机构
[1] Department of Mathematics, Lehigh University, Bethlehem, Pennsylvania
关键词
LINEAR PROGRAMMING; UNRESTRICTED VARIABLES; EXTREME POINTS;
D O I
10.1007/BF00940691
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
There are a number of ways of dealing with a linear programming problem in which some variables are allowed to take on negative values. One of these methods, which is either ignored or mentioned only incidentally in most textbooks, requires only one additional variable to be introduced regardless of how many unrestricted variables the original problem has. In this note, this method is interpreted geometrically and an application to the computation of extreme points is given.
引用
收藏
页码:605 / 610
页数:6
相关论文
共 6 条
[1]  
[Anonymous], 2003, LINEAR PROGRAMMING
[2]  
Chernikova N. V., 1965, COMP MATH MATH PHYS+, V5, P228
[3]  
DUETCH ML, 1959, COMMUNICATIONS, V2, P1
[4]  
GASS SI, 1975, LINEAR PROGRAMMING M
[5]   FINDING ALL VERTICES OF A CONVEX POLYHEDRON [J].
MANAS, M ;
NEDOMA, J .
NUMERISCHE MATHEMATIK, 1968, 12 (03) :226-+
[6]  
Murty K. G., 1983, LINEAR PROGRAMMING