Advertisement

A Simple Polynomial Time Algorithm for a Convex Hull Problem Equivalent to Linear Programming

  • Bahman Kalantari
Part of the Mathematics and Its Applications book series (MAIA, volume 329)

Abstract

Over the rationals, the general linear programming problem is equivalent to the convex hull problem of determining if a given m × n matrix H has a nontrivial nonnegative zero. We give a polynomial time algorithm that either finds a nontrivial nonnegative zero of H, or it obtains a hyperplane separating the column vectors of H from the origin. In particular, the algorithm provides an alternate proof of a strengthened version of Gordan’s duality theorem, previously proved by the author. The algorithm which is motivated by this duality theorem is analogous to Karmarkar’s algorithm but its analysis is much simpler.

Keywords

Arithmetic Operation Iteration Algorithm Basic Feasible Solution Recessive Cone Strengthened Version 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    G.B. Dantzig, Linear Programming and Extensions, Princeton University Press, Princeton, NJ, 1963.zbMATHGoogle Scholar
  2. [2]
    B. Kalantari, Canonical problems for quadratic programming and projective methods for their solution, Proceedings of AMS conference “Mathematical problems arising from linear programming”, 1988. In: Contemporary Mathematics, Volume 114 (1990), 243–263.Google Scholar
  3. [3]
    B. Kalantari, Derivation of a generalized and strengthened Gordan theorem from generalized Karmarkar potential and logarithmic.barrier functions, Technical Report LCSR-TR-121, Department of Computer Science, Rutgers University, New Brunswick, NJ, 1989.Google Scholar
  4. [4]
    B. Kalantari, A theorem of the alternative for multihomogeneous functions and its relationship to diagonal scaling of matrices, Technical Report LCSR-TR-202, Department of Computer Science, Rutgers University, New Brunswick, NJ, 1993. To appear in Linear Algebra and its Applications.Google Scholar
  5. [5]
    N. Karmarkar, A new polynomial time algorithm for linear programming, Combinatorica, 4 (1984), 373–395.MathSciNetzbMATHCrossRefGoogle Scholar
  6. [6]
    L. Khachiyan, A polynomial algorithm in linear programming, Soviet Mathematics Doklady, 20 (1979), 191–196.zbMATHGoogle Scholar
  7. [7]
    L. Khachiyan, Polynomial algorithms in linear programming. USSR Computational Mathematics and Mathematical Physics, 20 (1980), 53–72.zbMATHCrossRefGoogle Scholar
  8. [8]
    L. Khachiyan and B. Kalantari, Diagonal matrix scaling and linear programming, SIAM J. Optimization, 2 (1992), 668–672.MathSciNetzbMATHCrossRefGoogle Scholar
  9. [9]
    C.H. Papadimitriou, and K Steiglitz, Combinatorial Optimization Algorithms and Complexity, Prentice-Hall, Inc., Englewood Cliffs, NJ, 1982.zbMATHGoogle Scholar
  10. [10]
    J. Renegai, A polynomial-time algorithm based on Newton's method for linear programming, Mathematical Programming, 40 (1988), 59–93.MathSciNetCrossRefGoogle Scholar
  11. [11]
    P.M. Vaidya, An algorithm for linear programming which requires O(((m+n)n 2 + (m+n)1.5n)L) arithmetic operations, Mathematical Programming, 47 (1990), 175–201.MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Kluwer Academic Publishers 1995

Authors and Affiliations

  • Bahman Kalantari
    • 1
  1. 1.Department of Computer ScienceRutgers UniversityNew BrunswickUSA

Personalised recommendations