Comparative Analysis Of The Affine Scaling And Karmakar’s Polynomial – Time For Linear Programming

Authors

  • Adejo B. O. Department of Mathematical Sciences, Kogi State University
  • Choji D. N. Department of Mathematics, University of Jos

Abstract

The simplex method is the well-known, non-polynomial solution technique for linear programming problems. However, some computational testing has shown that the Karmarkar’s polynomial projective interior point method may perform better than the simplex method on many classes of problems, especially, on problems with large sizes. The affine scaling algorithm is a variant of the Karmarkar’s algorithms. In this paper, we compare the affine scaling and the Karmarkar algorithms using the same test LP problem.

Author Biography

Adejo B. O., Department of Mathematical Sciences, Kogi State University

Head and Senior Lecturer, Department of Biological Sciences

Downloads

Issue

Section

ARTICLES