Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization'' (Q5965674): Difference between revisions

@@ Property / cites work @@
+Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
+Normal rank
@@ Property / cites work @@
+Dual characterizations of set containments with strict convex inequalities
+Normal rank
@@ Property / cites work @@
+Non-convex infinite games
@@ Property / cites work: Non-convex infinite games / rank @@
+Normal rank
@@ Property / cites work @@
+Convex semi-infinite games
@@ Property / cites work: Convex semi-infinite games / rank @@
+Normal rank
@@ Property / cites work @@
+Constraint Qualification, the Strong CHIP, and Best Approximation with Convex Constraints in Banach Spaces
+Normal rank
@@ Property / cites work @@
+Strong CHIP for Infinite System of Closed Convex Sets in Normed Linear Spaces
+Normal rank
@@ Property / cites work @@
+Constraint Qualifications for Semi-Infinite Systems of Convex Inequalities
+Normal rank
@@ Property / cites work @@
+Locally Farkas-Minkowski linear inequality systems
+Normal rank