Using geometric arithmetic mean to solve non-linear fractional programming problems (Q2170967): Difference between revisions

@@ Property / cites work @@
+Q5173523
@@ Property / cites work: Q5173523 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5808750
@@ Property / cites work: Q5808750 / rank @@
+Normal rank
@@ Property / cites work @@
+Foundations of Optimization
@@ Property / cites work: Foundations of Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Solving a class of geometric programming problems by an efficient dynamic model
+Normal rank
@@ Property / cites work @@
+Geometric Programming
@@ Property / cites work: Geometric Programming / rank @@
+Normal rank
@@ Property / cites work @@
+On generalized geometric programming problems with non-positive variables
+Normal rank
@@ Property / cites work @@
+Q5090711
@@ Property / cites work: Q5090711 / rank @@
+Normal rank
@@ Property / cites work @@
+Global optimization of generalized geometric programming
+Normal rank
@@ Property / cites work @@
+Q5583568
@@ Property / cites work: Q5583568 / rank @@
+Normal rank
@@ Property / cites work @@
+A new two-level linear relaxed bound method for geometric programming problems
+Normal rank
@@ Property / cites work @@
+Q5591247
@@ Property / cites work: Q5591247 / rank @@
+Normal rank