An extension of Karmarkar's algorithm for solving a system of linear homogeneous equations on the simplex

DOI10.1007/BF02592072MaRDI QIDQ3777792zbMATH OpenFDO

Authors Guy de Ghellinck, Jean-Philippe Vial

Publication date 1987

Published in Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

projective geometrypolynomial algorithmfeasibility problemsystem of linear homogeneous equationsKarmarkar's algorithm

Mathematics Subject Classification ID

Linear programming (90C05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• An extension of Karmarkar's algorithm for linear programming using dual variables
• A Deterministic Kaczmarz Algorithm for Solving Linear Systems
• A variation on Karmarkar’s algorithm for solving linear programming problems
• An implementation of Karmarkar's algorithm for linear programming
• scientific article; zbMATH DE number 1135749
• scientific article; zbMATH DE number 4181135
• An extension of the simplex algorithm for semi-infinite linear programming
• scientific article; zbMATH DE number 892328
• scientific article; zbMATH DE number 4072277
• scientific article; zbMATH DE number 4082856

Cites work

• A monotonic projective algorithm for fractional linear programming
• A new polynomial-time algorithm for linear programming
• A polynomial Newton method for linear programming
• An extension of Karmarkar's algorithm for linear programming using dual variables
• Khachiyan's linear programming algorithm

Cited in

(12)

• scientific article; zbMATH DE number 4181135 (Why is no real title available?)
• Linear updates for a single-phase projective method
• Search directions for a class of projective methods
• Generalization of Karmarkar's algorithm to convex homogeneous functions
• A projective algorithm for linear programming with no regularity condition
• On combined phase 1-phase 2 projective methods for linear programming
• Cutting planes and column generation techniques with the projective algorithm
• scientific article; zbMATH DE number 650970 (Why is no real title available?)
• A polynomial Newton method for linear programming
• A fully polynomial time projective method
• El metodo de Karmarkar: Un estudio de sus variantes
• Determination of an interior feasible point for a system of linear constraints

This page was built for publication: An extension of Karmarkar's algorithm for solving a system of linear homogeneous equations on the simplex

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3777792)