On linear programming and matrix scaling over the algebraic numbers

DOI10.1016/S0024-3795(97)80036-5zbMath0885.90079OpenAlexW2056053749WikidataQ114850254 ScholiaQ114850254MaRDI QIDQ1361844

Bahman Kalantari, M. Reza Emamy-K.

Publication date: 1997

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0024-3795(97)80036-5

zbMATH Keywords

real algebraic numbersmatrix scalingpolynomial-time interior-point algorithms

Mathematics Subject Classification ID

Linear programming (90C05) Conditioning of matrices (15A12)

Related Items (3)

Semidefinite programming and matrix scaling over the semidefinite cone. ⋮ On the complexity of general matrix scaling and entropy minimization via the RAS algorithm ⋮ A characterization theorem and an algorithm for a convex hull problem

Cites Work

• A new polynomial-time algorithm for linear programming
• An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
• Polynomial algorithms for linear programming over the algebraic numbers
• A theorem of the alternative for multihomogeneous functions and its relationship to diagonal scaling of matrices
• Scaling of matrices to achieve specified row and column sums
• Diagonal Matrix Scaling and Linear Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On linear programming and matrix scaling over the algebraic numbers