Skip to main content
Log in

Integrability of vector and multivector fields associated with interior point methods for linear programming

  • Published:
Mathematical Programming Submit manuscript

Abstract

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 contravariantp-vector field isX p -forming, is enveloped by a family ofX q 's (q > p) or envelops a family ofX q 's (q < p) (in J.A. Schouten's terminology), whereX q is aq-dimensional manifold.

Immediate consequences of known facts are: (1) The directions hitherto proposed areX 1-forming with the optimum point of the linear programming problem as the stable accumulation point, and (2) there is anX 2-forming contravariant bivector field for which the center path is the critical submanifold. Most of the meaningfulp-vector fields withp ⩾ 3 are notX 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 programs, extension to higher dimensions is easily obtained.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. D. den Hertog and C. Roos, “A survey of search directions in interior point methods for linear programming,”Mathematical Programming (Series B) 52 (1991) 481–509, this issue.

    Google Scholar 

  2. M. Iri and H. Imai, “A multiplicative barrier function method for linear programming,”Algorithmica 1 (1986) 455–482.

    Google Scholar 

  3. N. Karmarkar, “Riemannian geometry underlying interior point methods for linear programming,” Paper presented at the13th International Symposium on Mathematical Programming, August 29–September 2, 1988, Tokyo, TU/2B1.

  4. N. Megiddo, “On the complexity of linear programming,” in: T. Bewley, ed.,Advances in Economic Theory (Cambridge University Press, Cambridge, 1987) pp. 225–268.

    Google Scholar 

  5. N. Megiddo and M. Shub, “Boundary behavior of interior point algorithms for linear programming,”Mathematics of Operations Research 14 (1989) 97–146.

    Google Scholar 

  6. J.A. Schouten,Der Ricci-Kalkül (Springer, Berlin, 1924).

    Google Scholar 

  7. J.A. Schouten,Tensor Analysis for Physicists (Clarendon Press, Oxford, 1951).

    Google Scholar 

  8. J.A. Schouten,Ricci-Calculus — An Introduction to Tensor Analysis and its Geometrical Applications (Springer, Berlin, 1954).

    Google Scholar 

  9. J. A. Schouten and W. v.d. Kulk,Pfaff's Problem and its Generalizations (Clarendon Press, Oxford, 1949).

    Google Scholar 

  10. J.A. Schouten and D.J. Struik,Einführungen in die neueren Methoden der Differential geometrie, I (Noordhoff, Groningen, 1935).

    Google Scholar 

  11. G. Sonnevend, “An analytical centre for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming,”Lecture Notes in Control and Information Sciences No. 84 (Springer, Berlin, 1985) pp. 866–876.

    Google Scholar 

  12. M.J. Todd, “Recent developments and new directions in linear programming,” in: M. Iri and K. Tanabe, eds.,Mathematical Programming — Recent Developments and Applications (Kluwer Academic Publishers, Dordrecht, 1989) pp. 109–157.

    Google Scholar 

  13. H. Yamashita, “A polynomially and quadratically convergent method for linear programming,” Working paper, Mathematical Systems Institute Inc. (Tokyo, 1986).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Iri, M. Integrability of vector and multivector fields associated with interior point methods for linear programming. Mathematical Programming 52, 511–525 (1991). https://doi.org/10.1007/BF01582903

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01582903

Keywords

Navigation