INTEGRABILITY OF VECTOR AND MULTIVECTOR FIELDS ASSOCIATED WITH INTERIOR POINT METHODS FOR LINEAR-PROGRAMMING

被引:4
作者
IRI, M
机构
[1] Department of Mathematical Engineering and Information Physics, Faculty of Engineering, University of Tokyo, Tokyo, 113, Bunkyo-ku
关键词
D O I
10.1007/BF01582903
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
In the feasible region of a linear programming problem, a number of "desirably good" directions have been defined in connexion with various interior point methods. Each of them determines a contravariant vector field in the region whose only stable critical point is the optimum point. Some interior point methods incorporate a two- or higher-dimensional search, which naturally leads us to the introduction of the corresponding contravariant multivector field. We investigate the integrability of those multivector fields, i.e., whether a contravariant p-vector field is X(p)-forming, is enveloped by a family of X(q)'s (q > p) or envelops a family of X(q)'s (q < p) (in J.A. Schouten's terminology), where X(q) is a q-dimensional manifold. Immediate consequences of known facts are: (1) The directions hitherto proposed are X1-forming with the optimum point of the linear programming problem as the stable accumulation point, and (2) there is an X2-forming contravariant bivector field for which the center path is the critical submanifold. Most of the meaningful p-vector fields with p greater-than-or-equal-to 3 are not X(p)-forming in general, though they envelop that bivector field. This observation will add another circumstantial evidence that the bivector field has a kind of invariant significance in the geometry of interior point methods for linear programming. For a kind of appendix, it is noted that, if we have several objectives, i.e., in the case of multiobjective linear programming extension to higher dimensions is easily obtained.
引用
收藏
页码:511 / 525
页数:15
相关论文
共 13 条
[1]   A SURVEY OF SEARCH DIRECTIONS IN INTERIOR POINT METHODS FOR LINEAR-PROGRAMMING [J].
DENHERTOG, D ;
ROOS, C .
MATHEMATICAL PROGRAMMING, 1991, 52 (03) :481-509
[2]   A Multiplicative Barrier Function Method for Linear Programming [J].
Iri, Masao ;
Imai, Hiroshi .
ALGORITHMICA, 1986, 1 (1-4) :455-482
[3]  
KARMARKAR NK, 1988, 13TH INT S MATH PROG
[4]   BOUNDARY-BEHAVIOR OF INTERIOR POINT ALGORITHMS IN LINEAR-PROGRAMMING [J].
MEGIDDO, N ;
SHUB, M .
MATHEMATICS OF OPERATIONS RESEARCH, 1989, 14 (01) :97-146
[5]  
MEGIDDO N, 1987, ADV EC THEORY, P225
[6]  
Schouten J.A., 1924, RICCIKALKUL
[7]  
Schouten J. A., 1951, TENSOR ANAL PHYSICIS
[8]  
SCHOUTEN JA, 1935, EINFUHRUNGEN NEUEREN, V1
[9]  
Sonnevend G., 1985, LECTURE NOTES CONTRO, V84, P866
[10]  
Todd M. J., 1989, MATH PROGRAMMING REC, P109