scientific article; zbMATH DE number 2047294
From MaRDI portal
Publication:4451485
For a linear programming problem with \(n\) variables, with positive coefficients and under some additional restrictions, the authors propose an algorithm for selecting \(n\) linear algebraic equations whose solution yields the optimal solution. Several examples are elaborated in which the proposed algorithm is more efficient than the simplex method. For the entire collection see [Zbl 1011.00025].
Recommendations
Cited in
(17)- A space decomposition-based deterministic algorithm for solving linear optimization problems
- Modified Fourier's method of solving linear programming problems.
- Optimal and strongly optimal solutions for linear programming models with variable parameters
- On Chubanov's Method for Linear Programming
- The use of classification theory for automated selection of algorithms in program packages
- The Criss-Cross Method for Solving Linear Programming Problems
- scientific article; zbMATH DE number 3148889 (Why is no real title available?)
- scientific article; zbMATH DE number 3858832 (Why is no real title available?)
- scientific article; zbMATH DE number 3867084 (Why is no real title available?)
- scientific article; zbMATH DE number 4216294 (Why is no real title available?)
- scientific article; zbMATH DE number 5669891 (Why is no real title available?)
- scientific article; zbMATH DE number 5524675 (Why is no real title available?)
- RPD-algorithm for optimization of developing systems in large-scale linear programming problems
- scientific article; zbMATH DE number 169279 (Why is no real title available?)
- scientific article; zbMATH DE number 1085271 (Why is no real title available?)
- scientific article; zbMATH DE number 3999659 (Why is no real title available?)
- Solving linear optimization problems on arrangements by the truncation method
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4451485)