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].











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)