scientific article; zbMATH DE number 4197755

zbMath0725.90074MaRDI QIDQ5202848

Bahman Kalantari

Publication date: 1990

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

NP-completegeneralized Karmarkar potential function

Mathematics Subject Classification ID

Quadratic programming (90C20) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (7)

On linear programming and matrix scaling over the algebraic numbers ⋮ Diagonal matrix scaling is NP-hard ⋮ A theorem of the alternative for multihomogeneous functions and its relationship to diagonal scaling of matrices ⋮ Semidefinite programming and matrix scaling over the semidefinite cone. ⋮ Generalization of Karmarkar's algorithm to convex homogeneous functions ⋮ A procedure of Chvátal for testing feasibility in linear programming and matrix scaling ⋮ A characterization theorem and an algorithm for a convex hull problem

Uses Software

• GQTPAR

This page was built for publication: