On Karmakar's Algorithm for Linear Programming
Published in Zenodo (CERN European Organization for Nuclear Research) • Aug 9, 2025
Authors:,,
R.N. Yadav
Chaurasiya R.P.
Yadav D.K.
Abstract
This paper deals with the convergence of the new polynomial-time algorithm developed by N.Karmakar and its relationship with thickness of concentric ellipsoids. Herein, we generalize the Karmakar'sinequality to discuss the bounds of objective function and obtain refind form of Karmakar's Formula for...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!