A still simpler way of introducing interior-point method for linear programming

DOI10.1016/j.cosrev.2016.07.001zbMath1398.90204arXiv1510.03339OpenAlexW3099416763MaRDI QIDQ2374256

Kurt Mehlhorn, Sanjeev Saxena

Publication date: 14 December 2016

Published in: Computer Science Review (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.03339

zbMATH Keywords

linear programminginterior point methodsimple presentation

Mathematics Subject Classification ID

Interior-point methods (90C51) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Mathematical programming (educational aspects) (97N60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The use of the optimal partition in a linear programming solution for postoptimal analysis
• 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
• Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
• Interior Point Methods for Linear Optimization
• An easy way to teach interior-point methods.

This page was built for publication: A still simpler way of introducing interior-point method for linear programming