University of Jos Institutional Repository >
Natural Sciences >
Mathematics >

Please use this identifier to cite or link to this item: http://hdl.handle.net/123456789/510

Title: Comparative Analysis of the Affine Scaling and Karmarkar's Polynomial-Time for Linear Programming
Authors: Adejo, B.O
Choji, D.N
Keywords: Complexity bound,
Primal LP,
Dual LP,
Basic Solution,
Degenerate Solution,
Affine Space.
Issue Date: 2008
Publisher: Science World Journal
Series/Report no.: Vol.3;No.2;Pp 23-27
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.
URI: http://hdl.handle.net/123456789/510
Appears in Collections:Mathematics

Files in This Item:

File Description SizeFormat
2816-9990-1-PB.pdf100.3 kBAdobe PDFView/Open
View Statistics

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback