Determination of an interior feasible point for a system of linear constraints

DOI10.1007/BF02667198zbMath0914.90195MaRDI QIDQ1280896

I. I. Dikin

Publication date: 28 April 1999

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

zbMATH Keywords

linear systeminterior point algorithmspower engineeringconvergence resultsaffine scaling methodinterior feasible pointtwo-sided constraints

Mathematics Subject Classification ID

Linear programming (90C05)

Cites Work

• A new polynomial-time algorithm for linear programming
• On the convergence of the affine-scaling algorithm
• Degeneracy in interior point methods for linear programming: A survey
• Convergence of the dual variables for the primal affine scaling method with unit steps in the homogeneous case
• Local Convergence Properties of New Methods in Linear Programming
• An extension of Karmarkar's algorithm for solving a system of linear homogeneous equations on the simplex
• Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Determination of an interior feasible point for a system of linear constraints