Algorithmic insights and a convergence analysis for a Karmarkar‐type of algorithm for linear programming problems

Hanif D. Sherali

Naval Research Logistics (NRL), 1987, vol. 34, issue 3, 399-416

Abstract: This paper is concerned with a modification of a recently proposed variant of Karmarkar's algorithm for solving linear programming problems. In analyzing this variant, we exhibit interesting and useful relationships of these types of algorithms with barrier function methods, and subgradient optimization procedures involving space dilation techniques, which subsume the well‐known ellipsoidal type of algorithms. Convergence of this variant is established under certain regularity conditions. We also provide remarks on how to obtain dual variables or Lagrange multipliers at optimality.

Date: 1987
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://doi.org/10.1002/1520-6750(198706)34:33.0.CO;2-6

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:34:y:1987:i:3:p:399-416

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().