Share Your Research, Maximize Your Social Impacts
OPTIMAL CHARACTERIZATION OF THE TRANSFORMATION PROCEDURE OF KARMARKAR ALGORITHM
Journal: Global Journal of Mathematics (GJM) (Vol.2, No. 2)Publication Date: 2015-04-01
Authors : Omolehin J. O.; Rauf K.; Nyor N.; Owolabi A. A;
Page : 128-137
Keywords : Linear Programming; Karmarkar algorithm; simplex method & inequality constraints;
Source : Download
Find it from : Google Scholar
Abstract
This research aims at proposing an algorithm that standardizes the choice of arbitrary control U in the transformation procedure of Karmarkar algorithm. Our proposed transformation algorithm has not only provided a standard optimal U in any given problem, it has also yielded a better result when compared with the result of simplex method which is used as our exact solution.
Other Latest Articles
- On The Characterizations of Timelike Curves in R_1^4
- A Theorem on Riemannian Curvature Generalizes Gaussian Curvature
- SOME RESULTS ON COMMON FIXED POINT FOR GENERALIZED f-CONTRACTION MAPPING
- Edge Average Wiener Index and Atom-bond Connectivity Index of Molecule Graphs with Special Structure
- Pre-service Teachers Linear Equation Solving Strategies & Errors
Last modified: 2015-08-26 16:01:46