Interior-point methods for linear programming: a review
From MaRDI portal
Publication:3150491
DOI10.1080/00207390110119934zbMath1006.90088OpenAlexW1966383380WikidataQ99705598 ScholiaQ99705598MaRDI QIDQ3150491
No author found.
Publication date: 17 October 2002
Published in: International Journal of Mathematical Education in Science and Technology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207390110119934
Linear programming (90C05) Interior-point methods (90C51) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (1)
Uses Software
Cites Work
- A modification of Karmarkar's linear programming algorithm
- A new polynomial-time algorithm for linear programming
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- Computational experience with a dual affine variant of Karmarkar's method for linear programming
- Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
- Global convergence of the affine scaling methods for degenerate linear programming problems
- On the convergence of the affine-scaling algorithm
- An interior point potential reduction algorithm for the linear complementarity problem
- A primal-dual infeasible-interior-point algorithm for linear programming
- Polynomiality of infeasible-interior-point algorithms for linear programming
- An implementation of Karmarkar's algorithm for linear programming
- A simplified homogeneous and self-dual linear programming algorithm and its implementation
- A linear programming instance with many crossover events
- A variation on Karmarkar’s algorithm for solving linear programming problems
- A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
- Boundary Behavior of Interior Point Algorithms in Linear Programming
- Polynomial algorithms in linear programming
- On the Implementation of a Primal-Dual Interior Point Method
- An Implementation of a Primal-Dual Interior Point Method for Linear Programming
- Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm
- Global Convergence Property of the Affine Scaling Methods for Primal Degenerate Linear Programming Problems
- Large-scale linearly constrained optimization
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- Convergence in Karmarkar's algorithm: a review
- Classroom Note: Initialization of the Simplex Algorithm: An Artificial-Free Approach
- Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
- Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems
This page was built for publication: Interior-point methods for linear programming: a review
