Dual interior point algorithms

DOI10.3103/S1066369X11040050zbMath1229.90269OpenAlexW2011292856MaRDI QIDQ647858

Valeriǐ Ivanovich Zorkal'tsev

Publication date: 21 November 2011

Published in: Russian Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s1066369x11040050

zbMATH Keywords

linear programmingrelative interiordual interior point algorithms

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51)

Related Items (3)

Interior Point Algorithms in Linear Optimization ⋮ METHOD FOR SEQUENTIAL ACTIVATION OF LIMITATIONS IN LINEAR PROGRAMMING ⋮ Interior point method: history and prospects

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A modification of Karmarkar's linear programming algorithm
• Computational experience with a dual affine variant of Karmarkar's method for linear programming
• An implementation of Karmarkar's algorithm for linear programming
• Algorithms of projective optimization which use the multipliers of previous iterations
• On theorems of the alternative
• A variation on Karmarkar’s algorithm for solving linear programming problems
• Convex Analysis

This page was built for publication: Dual interior point algorithms