A Simple Polynomial Time Algorithm for a Convex Hull Problem Equivalent to Linear Programming
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.
KeywordsArithmetic Operation Iteration Algorithm Basic Feasible Solution Recessive Cone Strengthened Version
Unable to display preview. Download preview PDF.
- 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
- 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
- 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