A still simpler way of introducing interior-point method for linear programming
From MaRDI portal
Abstract: Linear programming is now included in algorithm undergraduate and postgraduate courses for computer science majors. We give a self-contained treatment of an interior-point method which is particularly tailored to the typical mathematical background of CS students. In particular, only limited knowledge of linear algebra and calculus is assumed.
Recommendations
Cites work
- scientific article; zbMATH DE number 50649 (Why is no real title available?)
- scientific article; zbMATH DE number 1131479 (Why is no real title available?)
- scientific article; zbMATH DE number 830380 (Why is no real title available?)
- An easy way to teach interior-point methods.
- Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
- Interior Point Methods for Linear Optimization
- Introducing interior-point methods for introductory operations research courses and/or linear programming courses
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- The use of the optimal partition in a linear programming solution for postoptimal analysis
Cited in
(2)
This page was built for publication: A still simpler way of introducing interior-point method for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2374256)