On a classification scheme for geometric programming and complementarity theorems†<sup>†</sup> (Q4143032): Difference between revisions

@@ Property / cites work @@
+On the primal and dual constraint sets in geometric programming
+Normal rank
@@ Property / cites work @@
+Duality and asymptotic solvability over cones
@@ Property / cites work: Duality and asymptotic solvability over cones / rank @@
+Normal rank
@@ Property / cites work @@
+Linearizing Geometric Programs
@@ Property / cites work: Linearizing Geometric Programs / rank @@
+Normal rank
@@ Property / cites work @@
+Convex analysis treated by linear programming
@@ Property / cites work: Convex analysis treated by linear programming / rank @@
+Normal rank
@@ Property / cites work @@
+Duality Theory for Geometric Programming
@@ Property / cites work: Duality Theory for Geometric Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Constraint Sets of Geometric Programs Characterized by Auxiliary Problems
+Normal rank
@@ Property / cites work @@
+Classifying convex extremum problems over linear topologies having separation properties
+Normal rank
@@ Property / cites work @@
+Solution Sets of Convex Programs Related to Chemical Equilibrium Problems
+Normal rank
@@ Property / cites work @@
+Symmetric Duality for Generalized Unconstrained Geometric Programming
+Normal rank
@@ Property / cites work @@
+Theorems on the dimensions of convex sets
@@ Property / cites work: Theorems on the dimensions of convex sets / rank @@
+Normal rank