Article citationsMore>>

Karmarkar, N. and Ramakrishnan, U. (1985) Further Developments in the New Polynomial-Time Algorithm for Linear Programming. Talk Given at ORSA/TIMS National Meeting, Boston.

has been cited by the following article:

• TITLE: An Improved Affine-Scaling Interior Point Algorithm for Linear Programming

  AUTHORS: Douglas Kwasi Boah, Stephen Boakye Twum

  KEYWORDS: Interior-Point Methods, Affine-Scaling Interior Point Algorithm, Optimal Solution, Linear Programming, Initial Feasible Trial Solution

  JOURNAL NAME: Journal of Applied Mathematics and Physics, Vol.7 No.10, October 30, 2019

  ABSTRACT: In this paper, an Improved Affine-Scaling Interior Point Algorithm for Linear Programming has been proposed. Computational results of selected practical problems affirming the proposed algorithm have been provided. The proposed algorithm is accurate, faster and therefore reduces the number of iterations required to obtain an optimal solution of a given Linear Programming problem as compared to the already existing Affine-Scaling Interior Point Algorithm. The algorithm can be very useful for development of faster software packages for solving linear programming problems using the interior-point methods.