On finite termination in the primal-dual method for linear programming
From MaRDI portal
Recommendations
- Finite termination and decreasing dimensions in Mehrotra's primal-dual algorithm
- scientific article; zbMATH DE number 2099402
- scientific article; zbMATH DE number 1160769
- A Modified Termination Rule for Karmarkar’s Algorithm
- An interesting characteristic of phase-1 of dual-primal algorithm for linear programming
Cited in
(8)- Finite termination of the proximal point algorithm
- A note on finite termination of iterative algorithms in mathematical programming
- Finite termination and decreasing dimensions in Mehrotra's primal-dual algorithm
- Transformations of dual problem and decreasing dimensions in linear programming
- Using Indicators in Finite Termination Procedures
- scientific article; zbMATH DE number 2099402 (Why is no real title available?)
- scientific article; zbMATH DE number 5232244 (Why is no real title available?)
- An interesting characteristic of phase-1 of dual-primal algorithm for linear programming
This page was built for publication: On finite termination in the primal-dual method for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4925002)