A still simpler way of introducing interior-point method for linear programming (Q2374256): Difference between revisions

@@ Property / DOI @@
-.1016/j.cosrev.2016.07.001
@@ Property / DOI: 10.1016/j.cosrev.2016.07.001 / rank @@
-Normal rank
@@ Property / arXiv ID @@
+.03339
@@ Property / arXiv ID: 1510.03339 / rank @@
+Normal rank
@@ Property / cites work @@
+An easy way to teach interior-point methods.
@@ Property / cites work: An easy way to teach interior-point methods. / rank @@
+Normal rank
@@ Property / cites work @@
+Introducing Interior-Point Methods for Introductory Operations Research Courses and/or Linear Programming Courses
+Normal rank
@@ Property / cites work @@
+Interior Point Methods for Linear Optimization
@@ Property / cites work: Interior Point Methods for Linear Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Q4000282
@@ Property / cites work: Q4000282 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4382667
@@ Property / cites work: Q4382667 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4859839
@@ Property / cites work: Q4859839 / rank @@
+Normal rank
@@ Property / cites work @@
+Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
+Normal rank
@@ Property / cites work @@
+On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
+Normal rank
@@ Property / cites work @@
+The use of the optimal partition in a linear programming solution for postoptimal analysis
+Normal rank
@@ Property / DOI @@
+.1016/J.COSREV.2016.07.001
@@ Property / DOI: 10.1016/J.COSREV.2016.07.001 / rank @@
+Normal rank