New descent rules for solving the linear semi-infinite programming problem (Q1332958): Difference between revisions

@@ Property / cites work @@
+Q3716809
@@ Property / cites work: Q3716809 / rank @@
+Normal rank
@@ Property / cites work @@
+An extension of the simplex algorithm for semi-infinite linear programming
+Normal rank
@@ Property / cites work @@
+Q3694971
@@ Property / cites work: Q3694971 / rank @@
+Normal rank
@@ Property / cites work @@
+A projected lagrangian algorithm for semi-infinite programming
+Normal rank
@@ Property / cites work @@
+Semi-Infinite Programming: Theory, Methods, and Applications
+Normal rank
@@ Property / cites work @@
+A purification algorithm for semi-infinite programming
+Normal rank
@@ Property / cites work @@
+An optimality test for semi-infinite linear programming
+Normal rank
@@ Property / cites work @@
+Q5589748
@@ Property / cites work: Q5589748 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3701215
@@ Property / cites work: Q3701215 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3873909
@@ Property / cites work: Q3873909 / rank @@
+Normal rank
@@ Property / cites work @@
+A comparative study of several semi-infinite nonlinear programming algorithms
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0167-6377(94)90006-x
+Normal rank
@@ Property / OpenAlex ID @@
+W2143082120
@@ Property / OpenAlex ID: W2143082120 / rank @@
+Normal rank