Duality theorems for a class of nonconvex programming problems (Q2553909): Difference between revisions

@@ Property / author @@
-R. N. Kaul
@@ Property / author: R. N. Kaul / rank @@
-Normal rank
@@ Property / author @@
+R. N. Kaul
@@ Property / author: R. N. Kaul / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Finding all vertices of a convex polyhedron
@@ Property / cites work: Finding all vertices of a convex polyhedron / rank @@
+Normal rank
@@ Property / cites work @@
+Duality in nonlinear programming
@@ Property / cites work: Duality in nonlinear programming / rank @@
+Normal rank
@@ Property / cites work @@
+Duality in quadratic programming
@@ Property / cites work: Duality in quadratic programming / rank @@
+Normal rank
@@ Property / cites work @@
+Q3844775
@@ Property / cites work: Q3844775 / rank @@
+Normal rank
@@ Property / cites work @@
+Duality in fractional programming
@@ Property / cites work: Duality in fractional programming / rank @@
+Normal rank