Nonadjacent extreme point methods for solving linear programs (Q3673477): Difference between revisions

@@ Property / describes a project that uses @@
+DEVEX
@@ Property / describes a project that uses: DEVEX / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1002/nav.3800300111
+Normal rank
@@ Property / OpenAlex ID @@
+W2047184793
@@ Property / OpenAlex ID: W2047184793 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4673630
@@ Property / cites work: Q4673630 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4177319
@@ Property / cites work: Q4177319 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4178772
@@ Property / cites work: Q4178772 / rank @@
+Normal rank
@@ Property / cites work @@
+The simplex algorithm with the pivot rule of maximizing criterion improvement
+Normal rank
@@ Property / cites work @@
+Q3252270
@@ Property / cites work: Q3252270 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4132007
@@ Property / cites work: Q4132007 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5629405
@@ Property / cites work: Q5629405 / rank @@
+Normal rank