@frontlinesystems/rason-mcp-server 2026.5.1 → 2026.5.3

package/examples/{optimization → Optimization}/Linear/Rowop.json

@@ -1,127 +1,127 @@
-{
-  "modelName": "rowopExample",
-  "modelDescription": "RASON example uses Frontline's ROWOP function to solve a famous and difficult fixed-charge transportation optimization model. The optimal objective = 3712. In a fixed charge constraint, a binary variable is forced to 1 if the corresponding continuous variable is nonzero.  In other words, if X >0 then Y = 1. From here the binary variable may be multiplied by a constant value to model a penalty or charge.",
-  "modelType": "optimization",
-  "data": {
-    "comment": "The data section contains constant parameters utilized in the model to generate the constraints and the objective.",
-    "rows": {
-      "comment": "Creates constant, rows, with an assigned value = 14.",
-      "value": 14
-    },
-    "cols": {
-      "comment": "Creates constant, cols, with an assigned value = 18.",
-      "value": 18
-    },
-    "I": {
-      "comment": "Creates the array, I, of size 14.  All elements values = 1.",
-      "dimensions": [ "rows" ],
-      "value": 1
-    },
-    "J": {
-      "comment": "Creates the array, J, of size 18.  All elements values = 1.",
-      "dimensions": [ "cols" ],
-      "value": 1
-    },
-    "Demand": {
-      "comment": "Creates the array, Demand.  The size of the array is inferred by the number of values passed. These values represent the demand.",
-      "value": [ 6, 13, 21, 11, 20, 4, 35, 13, 20, 9, 7, 18, 14, 22, 33, 45, 11, 8 ]
-    },
-    "Supply": {
-      "comment": "Creates the array, Supply.  The size of the array is inferred by the number of values passed. These values represent the supply.",
-      "value": [ 21, 19, 24, 10, 27, 25, 10, 16, 17, 38, 22, 33, 22, 26 ]
-    },
-    "Cost": {
-      "comment": "Creates Cost matrix.  This matrix contains the transportation costs, or the cost per mile",
-      "value": [
-        [ 4, 4, 10, 3, 4, 9, 10, 9, 3, 10, 5, 10, 9, 10, 5, 8, 9, 8 ],
-        [ 7, 1, 7, 4, 6, 7, 7, 1, 4, 4, 10, 1, 7, 5, 8, 3, 3, 1 ],
-        [ 10, 10, 4, 10, 3, 2, 3, 8, 3, 7, 1, 5, 5, 6, 1, 8, 3, 8 ],
-        [ 7, 1, 1, 1, 10, 1, 7, 6, 6, 2, 5, 5, 7, 9, 6, 3, 3, 5 ],
-        [ 4, 10, 2, 1, 7, 8, 1, 2, 4, 5, 9, 2, 8, 7, 2, 8, 5, 3 ],
-        [ 3, 7, 4, 10, 8, 10, 9, 9, 6, 8, 9, 5, 5, 6, 1, 4, 9, 5 ],
-        [ 2, 7, 10, 10, 4, 10, 6, 8, 6, 6, 6, 8, 2, 3, 6, 9, 7, 5 ],
-        [ 1, 7, 10, 1, 7, 3, 1, 10, 10, 6, 2, 9, 1, 6, 5, 8, 6, 5 ],
-        [ 10, 7, 4, 1, 1, 1, 8, 4, 4, 3, 2, 4, 6, 6, 8, 3, 6, 6 ],
-        [ 4, 7, 1, 3, 3, 1, 3, 3, 5, 9, 9, 2, 6, 8, 2, 4, 3, 6 ],
-        [ 4, 1, 1, 2, 1, 4, 6, 8, 2, 4, 2, 5, 5, 8, 7, 4, 6, 9 ],
-        [ 7, 4, 1, 3, 10, 3, 1, 5, 2, 5, 1, 5, 6, 6, 3, 9, 9, 3 ],
-        [ 4, 7, 1, 10, 3, 8, 2, 9, 9, 6, 6, 9, 7, 7, 9, 1, 3, 10 ],
-        [ 6, 4, 8, 1, 2, 3, 4, 9, 9, 2, 6, 2, 5, 7, 8, 10, 10, 2 ]
-      ]
-    },
-    "FixedCost": {
-      "comment": "Creates FixedCost matrix.  This matrix contains the fixed charge cost.",
-      "value": [
-        [ 202.0, 222.0, 100.0, 174.0, 116.0, 253.0, 252.0, 113.0, 261.0, 240.0, 106.0, 146.0, 76.0, 169.0, 247.0, 194.0, 208.0, 242.0 ],
-        [ 190.0, 158.0, 243.0, 175.0, 191.0, 243.0, 162.0, 251.0, 248.0, 213.0, 123.0, 65.0, 73.0, 246.0, 181.0, 132.0, 91.0, 264.0 ],
-        [ 229.0, 112.0, 107.0, 193.0, 214.0, 120.0, 154.0, 150.0, 94.0, 74.0, 104.0, 152.0, 94.0, 258.0, 264.0, 88.0, 262.0, 220.0 ],
-        [ 190.0, 198.0, 130.0, 118.0, 135.0, 91.0, 243.0, 258.0, 98.0, 78.0, 188.0, 129.0, 162.0, 208.0, 110.0, 186.0, 262.0, 223.0 ],
-        [ 154.0, 217.0, 156.0, 91.0, 233.0, 191.0, 172.0, 157.0, 202.0, 212.0, 169.0, 173.0, 150.0, 96.0, 210.0, 194.0, 106.0, 221.0 ],
-        [ 141.0, 149.0, 234.0, 230.0, 126.0, 113.0, 101.0, 240.0, 138.0, 87.0, 242.0, 189.0, 93.0, 204.0, 184.0, 176.0, 148.0, 140.0 ],
-        [ 131.0, 256.0, 147.0, 252.0, 107.0, 112.0, 165.0, 255.0, 71.0, 244.0, 192.0, 168.0, 250.0, 132.0, 177.0, 195.0, 98.0, 105.0 ],
-        [ 211.0, 85.0, 124.0, 171.0, 139.0, 115.0, 65.0, 253.0, 217.0, 178.0, 186.0, 87.0, 119.0, 137.0, 82.0, 208.0, 205.0, 223.0 ],
-        [ 147.0, 149.0, 214.0, 105.0, 132.0, 131.0, 202.0, 213.0, 81.0, 234.0, 226.0, 202.0, 138.0, 245.0, 148.0, 209.0, 177.0, 152.0 ],
-        [ 249.0, 126.0, 145.0, 235.0, 234.0, 92.0, 201.0, 142.0, 106.0, 113.0, 134.0, 90.0, 138.0, 114.0, 239.0, 222.0, 262.0, 205.0 ],
-        [ 95.0, 251.0, 145.0, 131.0, 130.0, 222.0, 192.0, 179.0, 183.0, 234.0, 196.0, 106.0, 200.0, 147.0, 72.0, 176.0, 231.0, 160.0 ],
-        [ 109.0, 234.0, 78.0, 115.0, 136.0, 221.0, 252.0, 129.0, 80.0, 94.0, 65.0, 177.0, 258.0, 137.0, 185.0, 242.0, 181.0, 132.0 ],
-        [ 107.0, 233.0, 91.0, 112.0, 261.0, 150.0, 119.0, 102.0, 207.0, 138.0, 71.0, 122.0, 125.0, 166.0, 168.0, 144.0, 174.0, 241.0 ],
-        [ 191.0, 154.0, 101.0, 66.0, 156.0, 128.0, 234.0, 75.0, 86.0, 210.0, 231.0, 79.0, 105.0, 166.0, 147.0, 171.0, 241.0, 80.0 ]
-      ]
-    }
-  },
-  "formulas": {
-    "comment": "A new matrix is created using the MATOP function by applying two operators, oper1 and oper2, MATOP(A, oper1, oper2, B); For each k:  MATOP[x, y] = MATOP[x, y] oper2 (A[x, k] oper1 B[k, y]). For more information on this function, see https://www.solver.com/risk-solver-help/psi-function-help/matrices/matop.",
-    "xup": {
-      "dimensions": [ "rows", "cols" ],
-      "formula": "MATOP(Supply, 'min', '+', transpose(Demand))"
-    }
-  },
-  "variables": {
-    "comment": "This model includes two variable blocks, x and y.  The x variable array contains 252 continuous variables.  The y variable array contains 252 binary (0,1) variables.",
-    "x": {
-      "comment": "Creates x double array to hold 252 variables (14 * 18). All vars have been given an initial value of 0 using 'value' and a lower bound of 0, using 'lower'. The final variable values will be returned in the results due to the presence of the 'finalValue' keyword.",
-      "dimensions": [ "rows", "cols" ],
-      "value": 0,
-      "lower": 0,
-      "finalValue": []
-    },
-    "y": {
-      "comment": "Creates y double array to hold 252 more variables (14 * 18). All vars have been given an initial value of 0 using 'value', a lower bound of 0, using 'lower' and an upper bound of 1 using 'upper'. The 'type' property specifies that variables in this array must be integer, or binary variables, taking on values of either 0 or 1. The final variable values will be returned in the results due to the presence of the 'finalValue' keyword. The 'fix' constraint will ensure that if the corresponding x variable is nonzero, the corresponding y variable will be forced to 1, (i.e. if x(1,1) is > 0, y(1,1) = 1. ",
-      "dimensions": [ "rows", "cols" ],
-      "value": 0,
-      "lower": 0,
-      "upper": 1,
-      "type": "int",
-      "finalValue": []
-    }
-  },
-  "constraints": {
-    "comment": "Contains 18 + 14 + 252 = 284 constraints.",
-    "con1": {
-      "comment": "Generates Demand constraints: Adds up the continuous variable values by row and sets each formula equal to the appropriate demand value (i.e. x(1,1) + x(2,1) + x(3,1) + ... x(18,1) = 6 where 6 is Demand[1].",
-      "dimensions": [ "cols" ],
-      "formula": "transpose(ROWOP(x, '+'))",
-      "equal": "Demand"
-    },
-    "con2": {
-      "comment": "Generates Supply constraints: Adds up the continuous variable values by column and sets each formula equal to the appropriate supply value (i.e. x(1,1) + x(2,1) + x(3,1) + ... x(18,1) = 21 where 21 is Supply[1].",
-      "dimensions": [ "rows" ],
-      "formula": "COLOP(x, '+')",
-      "equal": "Supply"
-    },
-    "fix": {
-      "comment": "Creates the fixed charge constraint that forces the y variables to 1 when the corresponding x variable i nonzero.  This type of constraint is otherwise known as a fixed-charge constraint because it applies a fixed cost if a truck route is selected.",
-      "dimensions": [ "rows", "cols" ],
-      "formula": "xup * y - x",
-      "lower": 0
-    }
-  },
-  "objective": {
-    "obj": {
-      "comment": "The objective minimizes the transportation costs by adding the sumproduct of the Fixed Cost matrix and the y matrix with the sumproduct of the Cost matrix and the x matrix.",
-      "type": "minimize",
-      "formula": "sumproduct(FixedCost, y) + sumproduct(Cost, x)",
-      "finalValue": []
-    }
-  }
+{
+  "modelName": "rowopExample",
+  "modelDescription": "RASON example uses Frontline's ROWOP function to solve a famous and difficult fixed-charge transportation optimization model. The optimal objective = 3712. In a fixed charge constraint, a binary variable is forced to 1 if the corresponding continuous variable is nonzero.  In other words, if X >0 then Y = 1. From here the binary variable may be multiplied by a constant value to model a penalty or charge.",
+  "modelType": "optimization",
+  "data": {
+    "comment": "The data section contains constant parameters utilized in the model to generate the constraints and the objective.",
+    "rows": {
+      "comment": "Creates constant, rows, with an assigned value = 14.",
+      "value": 14
+    },
+    "cols": {
+      "comment": "Creates constant, cols, with an assigned value = 18.",
+      "value": 18
+    },
+    "I": {
+      "comment": "Creates the array, I, of size 14.  All elements values = 1.",
+      "dimensions": [ "rows" ],
+      "value": 1
+    },
+    "J": {
+      "comment": "Creates the array, J, of size 18.  All elements values = 1.",
+      "dimensions": [ "cols" ],
+      "value": 1
+    },
+    "Demand": {
+      "comment": "Creates the array, Demand.  The size of the array is inferred by the number of values passed. These values represent the demand.",
+      "value": [ 6, 13, 21, 11, 20, 4, 35, 13, 20, 9, 7, 18, 14, 22, 33, 45, 11, 8 ]
+    },
+    "Supply": {
+      "comment": "Creates the array, Supply.  The size of the array is inferred by the number of values passed. These values represent the supply.",
+      "value": [ 21, 19, 24, 10, 27, 25, 10, 16, 17, 38, 22, 33, 22, 26 ]
+    },
+    "Cost": {
+      "comment": "Creates Cost matrix.  This matrix contains the transportation costs, or the cost per mile",
+      "value": [
+        [ 4, 4, 10, 3, 4, 9, 10, 9, 3, 10, 5, 10, 9, 10, 5, 8, 9, 8 ],
+        [ 7, 1, 7, 4, 6, 7, 7, 1, 4, 4, 10, 1, 7, 5, 8, 3, 3, 1 ],
+        [ 10, 10, 4, 10, 3, 2, 3, 8, 3, 7, 1, 5, 5, 6, 1, 8, 3, 8 ],
+        [ 7, 1, 1, 1, 10, 1, 7, 6, 6, 2, 5, 5, 7, 9, 6, 3, 3, 5 ],
+        [ 4, 10, 2, 1, 7, 8, 1, 2, 4, 5, 9, 2, 8, 7, 2, 8, 5, 3 ],
+        [ 3, 7, 4, 10, 8, 10, 9, 9, 6, 8, 9, 5, 5, 6, 1, 4, 9, 5 ],
+        [ 2, 7, 10, 10, 4, 10, 6, 8, 6, 6, 6, 8, 2, 3, 6, 9, 7, 5 ],
+        [ 1, 7, 10, 1, 7, 3, 1, 10, 10, 6, 2, 9, 1, 6, 5, 8, 6, 5 ],
+        [ 10, 7, 4, 1, 1, 1, 8, 4, 4, 3, 2, 4, 6, 6, 8, 3, 6, 6 ],
+        [ 4, 7, 1, 3, 3, 1, 3, 3, 5, 9, 9, 2, 6, 8, 2, 4, 3, 6 ],
+        [ 4, 1, 1, 2, 1, 4, 6, 8, 2, 4, 2, 5, 5, 8, 7, 4, 6, 9 ],
+        [ 7, 4, 1, 3, 10, 3, 1, 5, 2, 5, 1, 5, 6, 6, 3, 9, 9, 3 ],
+        [ 4, 7, 1, 10, 3, 8, 2, 9, 9, 6, 6, 9, 7, 7, 9, 1, 3, 10 ],
+        [ 6, 4, 8, 1, 2, 3, 4, 9, 9, 2, 6, 2, 5, 7, 8, 10, 10, 2 ]
+      ]
+    },
+    "FixedCost": {
+      "comment": "Creates FixedCost matrix.  This matrix contains the fixed charge cost.",
+      "value": [
+        [ 202.0, 222.0, 100.0, 174.0, 116.0, 253.0, 252.0, 113.0, 261.0, 240.0, 106.0, 146.0, 76.0, 169.0, 247.0, 194.0, 208.0, 242.0 ],
+        [ 190.0, 158.0, 243.0, 175.0, 191.0, 243.0, 162.0, 251.0, 248.0, 213.0, 123.0, 65.0, 73.0, 246.0, 181.0, 132.0, 91.0, 264.0 ],
+        [ 229.0, 112.0, 107.0, 193.0, 214.0, 120.0, 154.0, 150.0, 94.0, 74.0, 104.0, 152.0, 94.0, 258.0, 264.0, 88.0, 262.0, 220.0 ],
+        [ 190.0, 198.0, 130.0, 118.0, 135.0, 91.0, 243.0, 258.0, 98.0, 78.0, 188.0, 129.0, 162.0, 208.0, 110.0, 186.0, 262.0, 223.0 ],
+        [ 154.0, 217.0, 156.0, 91.0, 233.0, 191.0, 172.0, 157.0, 202.0, 212.0, 169.0, 173.0, 150.0, 96.0, 210.0, 194.0, 106.0, 221.0 ],
+        [ 141.0, 149.0, 234.0, 230.0, 126.0, 113.0, 101.0, 240.0, 138.0, 87.0, 242.0, 189.0, 93.0, 204.0, 184.0, 176.0, 148.0, 140.0 ],
+        [ 131.0, 256.0, 147.0, 252.0, 107.0, 112.0, 165.0, 255.0, 71.0, 244.0, 192.0, 168.0, 250.0, 132.0, 177.0, 195.0, 98.0, 105.0 ],
+        [ 211.0, 85.0, 124.0, 171.0, 139.0, 115.0, 65.0, 253.0, 217.0, 178.0, 186.0, 87.0, 119.0, 137.0, 82.0, 208.0, 205.0, 223.0 ],
+        [ 147.0, 149.0, 214.0, 105.0, 132.0, 131.0, 202.0, 213.0, 81.0, 234.0, 226.0, 202.0, 138.0, 245.0, 148.0, 209.0, 177.0, 152.0 ],
+        [ 249.0, 126.0, 145.0, 235.0, 234.0, 92.0, 201.0, 142.0, 106.0, 113.0, 134.0, 90.0, 138.0, 114.0, 239.0, 222.0, 262.0, 205.0 ],
+        [ 95.0, 251.0, 145.0, 131.0, 130.0, 222.0, 192.0, 179.0, 183.0, 234.0, 196.0, 106.0, 200.0, 147.0, 72.0, 176.0, 231.0, 160.0 ],
+        [ 109.0, 234.0, 78.0, 115.0, 136.0, 221.0, 252.0, 129.0, 80.0, 94.0, 65.0, 177.0, 258.0, 137.0, 185.0, 242.0, 181.0, 132.0 ],
+        [ 107.0, 233.0, 91.0, 112.0, 261.0, 150.0, 119.0, 102.0, 207.0, 138.0, 71.0, 122.0, 125.0, 166.0, 168.0, 144.0, 174.0, 241.0 ],
+        [ 191.0, 154.0, 101.0, 66.0, 156.0, 128.0, 234.0, 75.0, 86.0, 210.0, 231.0, 79.0, 105.0, 166.0, 147.0, 171.0, 241.0, 80.0 ]
+      ]
+    }
+  },
+  "formulas": {
+    "comment": "A new matrix is created using the MATOP function by applying two operators, oper1 and oper2, MATOP(A, oper1, oper2, B); For each k:  MATOP[x, y] = MATOP[x, y] oper2 (A[x, k] oper1 B[k, y]). For more information on this function, see https://www.solver.com/risk-solver-help/psi-function-help/matrices/matop.",
+    "xup": {
+      "dimensions": [ "rows", "cols" ],
+      "formula": "MATOP(Supply, 'min', '+', transpose(Demand))"
+    }
+  },
+  "variables": {
+    "comment": "This model includes two variable blocks, x and y.  The x variable array contains 252 continuous variables.  The y variable array contains 252 binary (0,1) variables.",
+    "x": {
+      "comment": "Creates x double array to hold 252 variables (14 * 18). All vars have been given an initial value of 0 using 'value' and a lower bound of 0, using 'lower'. The final variable values will be returned in the results due to the presence of the 'finalValue' keyword.",
+      "dimensions": [ "rows", "cols" ],
+      "value": 0,
+      "lower": 0,
+      "finalValue": []
+    },
+    "y": {
+      "comment": "Creates y double array to hold 252 more variables (14 * 18). All vars have been given an initial value of 0 using 'value', a lower bound of 0, using 'lower' and an upper bound of 1 using 'upper'. The 'type' property specifies that variables in this array must be integer, or binary variables, taking on values of either 0 or 1. The final variable values will be returned in the results due to the presence of the 'finalValue' keyword. The 'fix' constraint will ensure that if the corresponding x variable is nonzero, the corresponding y variable will be forced to 1, (i.e. if x(1,1) is > 0, y(1,1) = 1. ",
+      "dimensions": [ "rows", "cols" ],
+      "value": 0,
+      "lower": 0,
+      "upper": 1,
+      "type": "int",
+      "finalValue": []
+    }
+  },
+  "constraints": {
+    "comment": "Contains 18 + 14 + 252 = 284 constraints.",
+    "con1": {
+      "comment": "Generates Demand constraints: Adds up the continuous variable values by row and sets each formula equal to the appropriate demand value (i.e. x(1,1) + x(2,1) + x(3,1) + ... x(18,1) = 6 where 6 is Demand[1].",
+      "dimensions": [ "cols" ],
+      "formula": "transpose(ROWOP(x, '+'))",
+      "equal": "Demand"
+    },
+    "con2": {
+      "comment": "Generates Supply constraints: Adds up the continuous variable values by column and sets each formula equal to the appropriate supply value (i.e. x(1,1) + x(2,1) + x(3,1) + ... x(18,1) = 21 where 21 is Supply[1].",
+      "dimensions": [ "rows" ],
+      "formula": "COLOP(x, '+')",
+      "equal": "Supply"
+    },
+    "fix": {
+      "comment": "Creates the fixed charge constraint that forces the y variables to 1 when the corresponding x variable i nonzero.  This type of constraint is otherwise known as a fixed-charge constraint because it applies a fixed cost if a truck route is selected.",
+      "dimensions": [ "rows", "cols" ],
+      "formula": "xup * y - x",
+      "lower": 0
+    }
+  },
+  "objective": {
+    "obj": {
+      "comment": "The objective minimizes the transportation costs by adding the sumproduct of the Fixed Cost matrix and the y matrix with the sumproduct of the Cost matrix and the x matrix.",
+      "type": "minimize",
+      "formula": "sumproduct(FixedCost, y) + sumproduct(Cost, x)",
+      "finalValue": []
+    }
+  }
 }

package/examples/{optimization → Optimization}/NonLinear/AirlineHub.json

@@ -1,64 +1,64 @@
-{
-  "modelName": "AirlineHubExample",
-  "modelDescription": "Airline Hub Nonlinear RASON Optimization Example: Finds the hub location that minimizes the overall distance to 6 different airports. This example uses the distance formula to determine the distance between the projected hub and each of the 6 airports, SQRT((x1 - x0) + (y1 - y0))  The objective returns the coordinates of the prospective location.",
-  "modelType": "optimization",
-  "engineSettings": {
-    "engine": "GRG Nonlinear"
-  },
-  "variables": {
-    "comment": "3 variables: x, y and z.  x and y are the (x, y) coordinates of the proposed hub location. z is an artificial variable that will be minimized in the objective. The initial value of each variable is set to 1 using the value property and the final values will be returned in the result due to the presence of the keyword, finalValue.",
-    "x": {
-      "value": 1.0,
-      "finalValue": []
-    },
-    "y": {
-      "value": 1.0,
-      "finalValue": []
-    },
-    "z": {
-      "value": 1.0,
-      "finalValue": []
-    }
-  },
-  "constraints": {
-    "comment": "Each constraint calculates the distance between the proposed hub and each of the 6 airports. Originally, each constraint would be of the form SQRT((x1 - x0) + (y1 - y0)) <= z where z is the artificial variable.  When z is minimized in the objective, it has a 'squashing' effect that pushes the distance formula to be as small as possible, thereby moving the (x,y) coordinates to such a place that minimizes the distance between the hub and all 6 airports. (To convert the constraint to standard form, z is subtracted from both sides of the equation, leaving SQRT((x1 - x0) + (y1 - y0)) - z <= 0.)",
-    "c1": {
-      "comment": "Minimize the distance between the proposed hub and airport 1.",
-      "formula": "sqrt((x - 1)^2 + (y - 4)^2) - z",
-      "upper": 0
-    },
-    "c2": {
-      "comment": "Minimize the distance between the proposed hub and airport 2.",
-      "formula": "sqrt((x - 0.5)^2 + (y - 3)^2) - z",
-      "upper": 0
-    },
-    "c3": {
-      "comment": "Minimize the distance between the proposed hub and airport 3.",
-      "formula": "sqrt((x - 2)^2 + (y - 4)^2) - z",
-      "upper": 0
-    },
-    "c4": {
-      "comment": "Minimize the distance between the proposed hub and airport 4.",
-      "formula": "sqrt((x - 2)^2 + (y - 2)^2) - z",
-      "upper": 0
-    },
-    "c5": {
-      "comment": "Minimize the distance between the proposed hub and airport 5.",
-      "formula": "sqrt((x - 2)^2 + (y - 5)^2) - z",
-      "upper": 0
-    },
-    "c6": {
-      "comment": "Minimize the distance between the proposed hub and airport 6.",
-      "formula": "sqrt((x - 0.5)^2 + (y - 6)^2) - z",
-      "upper": 0
-    }
-  },
-  "objective": {
-    "comment": "Minimize the artificial variable z.  This minimization 'squashes' all six of the distance formulas.  The resulting (x,y) coordinate will be the coordinate that minimizes the distance between the hub and all six airports.",
-    "obj": {
-      "formula": "z",
-      "type": "minimize",
-      "finalValue": []
-    }
-  }
+{
+  "modelName": "AirlineHubExample",
+  "modelDescription": "Airline Hub Nonlinear RASON Optimization Example: Finds the hub location that minimizes the overall distance to 6 different airports. This example uses the distance formula to determine the distance between the projected hub and each of the 6 airports, SQRT((x1 - x0) + (y1 - y0))  The objective returns the coordinates of the prospective location.",
+  "modelType": "optimization",
+  "engineSettings": {
+    "engine": "GRG Nonlinear"
+  },
+  "variables": {
+    "comment": "3 variables: x, y and z.  x and y are the (x, y) coordinates of the proposed hub location. z is an artificial variable that will be minimized in the objective. The initial value of each variable is set to 1 using the value property and the final values will be returned in the result due to the presence of the keyword, finalValue.",
+    "x": {
+      "value": 1.0,
+      "finalValue": []
+    },
+    "y": {
+      "value": 1.0,
+      "finalValue": []
+    },
+    "z": {
+      "value": 1.0,
+      "finalValue": []
+    }
+  },
+  "constraints": {
+    "comment": "Each constraint calculates the distance between the proposed hub and each of the 6 airports. Originally, each constraint would be of the form SQRT((x1 - x0) + (y1 - y0)) <= z where z is the artificial variable.  When z is minimized in the objective, it has a 'squashing' effect that pushes the distance formula to be as small as possible, thereby moving the (x,y) coordinates to such a place that minimizes the distance between the hub and all 6 airports. (To convert the constraint to standard form, z is subtracted from both sides of the equation, leaving SQRT((x1 - x0) + (y1 - y0)) - z <= 0.)",
+    "c1": {
+      "comment": "Minimize the distance between the proposed hub and airport 1.",
+      "formula": "sqrt((x - 1)^2 + (y - 4)^2) - z",
+      "upper": 0
+    },
+    "c2": {
+      "comment": "Minimize the distance between the proposed hub and airport 2.",
+      "formula": "sqrt((x - 0.5)^2 + (y - 3)^2) - z",
+      "upper": 0
+    },
+    "c3": {
+      "comment": "Minimize the distance between the proposed hub and airport 3.",
+      "formula": "sqrt((x - 2)^2 + (y - 4)^2) - z",
+      "upper": 0
+    },
+    "c4": {
+      "comment": "Minimize the distance between the proposed hub and airport 4.",
+      "formula": "sqrt((x - 2)^2 + (y - 2)^2) - z",
+      "upper": 0
+    },
+    "c5": {
+      "comment": "Minimize the distance between the proposed hub and airport 5.",
+      "formula": "sqrt((x - 2)^2 + (y - 5)^2) - z",
+      "upper": 0
+    },
+    "c6": {
+      "comment": "Minimize the distance between the proposed hub and airport 6.",
+      "formula": "sqrt((x - 0.5)^2 + (y - 6)^2) - z",
+      "upper": 0
+    }
+  },
+  "objective": {
+    "comment": "Minimize the artificial variable z.  This minimization 'squashes' all six of the distance formulas.  The resulting (x,y) coordinate will be the coordinate that minimizes the distance between the hub and all six airports.",
+    "obj": {
+      "formula": "z",
+      "type": "minimize",
+      "finalValue": []
+    }
+  }
 }

package/examples/{optimization → Optimization}/NonLinear/AirlineHub2.json

@@ -1,48 +1,48 @@
-{
-  "modelName": "AirlineHub2Example",
-  "modelDescription": "Airline Hub 2 RASON Nonlinear Optimization Example:  Same problem as AirlineHubExample but this example uses block constraints. (Recall that this RASON example finds the minimum distance between a proposed airline hub location and several regional cities.)  This model still finds the location that minimizes the overall distance to 6 different airports",
-  "modelType": "optimization",
-  "variables": {
-    "comment": "As with AirlineHubExample, there are 3 variables in the model: x, y and z.  x and y are the (x, y) coordinates of the proposed hub location. z is an artificial variable that will be minimized in the objective. The initial value of each variable is set to 1 using the value property and the final values will be returned in the result due to the presence of the keyword, finalValue.",
-
-    "x": {
-      "value": 1.0,
-      "finalValue": []
-    },
-    "y": {
-      "value": 1.0,
-      "finalValue": []
-    },
-    "z": {
-      "value": 1.0,
-      "finalValue": []
-    }
-  },
-  "data": {
-    "comment": "The data section holds the x and y coordinates of each of the 6 airports. Supplying the x and y coordinates in two arrays allows all 6 constraints to be entered as a constraint block.  See 'constraints' section below. In this example, the size of the arrays are inferred by the number of values passed to each array.",
-    "dx": {
-      "comment": "These are the x coordinates of each of the 6 airports.",
-      "value": [ 1, 0.5, 2, 2, 2, 0.5 ]
-    },
-    "dy": {
-      "comment": "These are the y coordinates of each of the 6 airports.",
-      "value": [ 4, 3, 4, 2, 5, 6 ]
-    }
-  },
-  "constraints": {
-    "comment": "In AirlineHubExample, each constraint was entered separately. In this example, all six constraints are entered at once. This was made possible by the x and y coordinates being supplied via two arrays, dx and dy. Recall from the original AirlineHubExample, that each constraint calculates the distance between the proposed hub and each of the 6 airports. Originally, each constraint would be of the form SQRT((x1 - x0) + (y1 - y0)) <= z where z is the artificial variable.  When z is minimized in the objective, it has a 'squashing' effect that pushes the distance formula to be as small as possible, thereby moving the (x,y) coordinates to such a place that minimizes the distance between the hub and all 6 airports. (To convert the constraint to standard form, z is subtracted from both sides of the equation, leaving SQRT((x1 - x0) + (y1 - y0)) - z <= 0.)  Notice that the 'dimensions' propety is used to explicitly create the array of size 6.",
-    "c": {
-      "dimensions": [ 6 ],
-      "formula": "sqrt((x - dx)^2 + (y - dy)^2) - z",
-      "upper": 0
-    }
-  },
-  "objective": {
-    "obj": {
-      "comment": "Minimize the artificial variable z.  This minimization 'squashes' all six of the distance formulas.  The resulting (x,y) coordinate will be the coordinate that minimizes the distance between the hub and all six airports.",
-      "formula": "z",
-      "type": "minimize",
-      "finalValue": []
-    }
-  }
+{
+  "modelName": "AirlineHub2Example",
+  "modelDescription": "Airline Hub 2 RASON Nonlinear Optimization Example:  Same problem as AirlineHubExample but this example uses block constraints. (Recall that this RASON example finds the minimum distance between a proposed airline hub location and several regional cities.)  This model still finds the location that minimizes the overall distance to 6 different airports",
+  "modelType": "optimization",
+  "variables": {
+    "comment": "As with AirlineHubExample, there are 3 variables in the model: x, y and z.  x and y are the (x, y) coordinates of the proposed hub location. z is an artificial variable that will be minimized in the objective. The initial value of each variable is set to 1 using the value property and the final values will be returned in the result due to the presence of the keyword, finalValue.",
+
+    "x": {
+      "value": 1.0,
+      "finalValue": []
+    },
+    "y": {
+      "value": 1.0,
+      "finalValue": []
+    },
+    "z": {
+      "value": 1.0,
+      "finalValue": []
+    }
+  },
+  "data": {
+    "comment": "The data section holds the x and y coordinates of each of the 6 airports. Supplying the x and y coordinates in two arrays allows all 6 constraints to be entered as a constraint block.  See 'constraints' section below. In this example, the size of the arrays are inferred by the number of values passed to each array.",
+    "dx": {
+      "comment": "These are the x coordinates of each of the 6 airports.",
+      "value": [ 1, 0.5, 2, 2, 2, 0.5 ]
+    },
+    "dy": {
+      "comment": "These are the y coordinates of each of the 6 airports.",
+      "value": [ 4, 3, 4, 2, 5, 6 ]
+    }
+  },
+  "constraints": {
+    "comment": "In AirlineHubExample, each constraint was entered separately. In this example, all six constraints are entered at once. This was made possible by the x and y coordinates being supplied via two arrays, dx and dy. Recall from the original AirlineHubExample, that each constraint calculates the distance between the proposed hub and each of the 6 airports. Originally, each constraint would be of the form SQRT((x1 - x0) + (y1 - y0)) <= z where z is the artificial variable.  When z is minimized in the objective, it has a 'squashing' effect that pushes the distance formula to be as small as possible, thereby moving the (x,y) coordinates to such a place that minimizes the distance between the hub and all 6 airports. (To convert the constraint to standard form, z is subtracted from both sides of the equation, leaving SQRT((x1 - x0) + (y1 - y0)) - z <= 0.)  Notice that the 'dimensions' propety is used to explicitly create the array of size 6.",
+    "c": {
+      "dimensions": [ 6 ],
+      "formula": "sqrt((x - dx)^2 + (y - dy)^2) - z",
+      "upper": 0
+    }
+  },
+  "objective": {
+    "obj": {
+      "comment": "Minimize the artificial variable z.  This minimization 'squashes' all six of the distance formulas.  The resulting (x,y) coordinate will be the coordinate that minimizes the distance between the hub and all six airports.",
+      "formula": "z",
+      "type": "minimize",
+      "finalValue": []
+    }
+  }
 }

package/examples/{optimization → Optimization}/NonLinear/AirlineHub3.json

@@ -1,48 +1,48 @@
-{
-  "modelName": "AirlineHub3Example",
-  "modelDescription": "Airline Hub 3 RASON Nonlinear Optimization Example: Same problem as AirlineHubExample and AirlineHub2Example but this example specifies the dimension directly for the data and constraint arrays. (Recall that these two RASON examples find the minimum distance between a proposed airline hub location and several regional cities.) This model still finds the location that minimizes the overall distance to 6 different airports",
-  "modelType": "optimization",
-  "variables": {
-    "comment": "As with AirlineHubExample, there are 3 variables in the model: x, y and z.  x and y are the (x, y) coordinates of the proposed hub location. z is an artificial variable that will be minimized in the objective. The initial value of each variable is set to 1 using the value property and the final values will be returned in the result due to the presence of the keyword, finalValue.  This section remains unchanged from the previous example, AirlineHub2Example.",
-    "x": {
-      "value": 1.0,
-      "finalValue": []
-    },
-    "y": {
-      "value": 1.0,
-      "finalValue": []
-    },
-    "z": {
-      "value": 1.0,
-      "finalValue": []
-    }
-  },
-  "data": {
-    "comment": "The data section holds the x and y coordinates of each of the 6 airports. Supplying the x and y coordinates in two arrays allows all 6 constraints to be entered as a constraint block.  See 'constraints' section below. In this example, the array dimensions are explicitly set using the dimensions property.",
-    "dx": {
-      "dimensions": [ 6 ],
-      "value": [ 1, 0.5, 2, 2, 2, 0.5 ]
-    },
-    "dy": {
-      "dimensions": [ 6 ],
-      "value": [ 4, 3, 4, 2, 5, 6 ]
-    }
-  },
-  "constraints": {
-    "comment": "The only difference for this section compared with AirlineHub2Example, is that in this example, the finalValue keyword is present which means that the final value of each constraint will be returned in the results.",
-    "c": {
-      "dimensions": [ 6 ],
-      "formula": "sqrt((x - dx)^2 + (y - dy)^2) - z",
-      "upper": 0,
-      "finalValue": []
-    }
-  },
-  "objective": {
-    "comment": "Minimize the artificial variable z.  This minimization 'squashes' all six of the distance formulas.  The resulting (x,y) coordinate will be the coordinate that minimizes the distance between the hub and all six airports. This section remains unchanged from the previous example, AirlineHub2Example.",
-    "obj": {
-      "formula": "z",
-      "type": "minimize",
-      "finalValue": []
-    }
-  }
+{
+  "modelName": "AirlineHub3Example",
+  "modelDescription": "Airline Hub 3 RASON Nonlinear Optimization Example: Same problem as AirlineHubExample and AirlineHub2Example but this example specifies the dimension directly for the data and constraint arrays. (Recall that these two RASON examples find the minimum distance between a proposed airline hub location and several regional cities.) This model still finds the location that minimizes the overall distance to 6 different airports",
+  "modelType": "optimization",
+  "variables": {
+    "comment": "As with AirlineHubExample, there are 3 variables in the model: x, y and z.  x and y are the (x, y) coordinates of the proposed hub location. z is an artificial variable that will be minimized in the objective. The initial value of each variable is set to 1 using the value property and the final values will be returned in the result due to the presence of the keyword, finalValue.  This section remains unchanged from the previous example, AirlineHub2Example.",
+    "x": {
+      "value": 1.0,
+      "finalValue": []
+    },
+    "y": {
+      "value": 1.0,
+      "finalValue": []
+    },
+    "z": {
+      "value": 1.0,
+      "finalValue": []
+    }
+  },
+  "data": {
+    "comment": "The data section holds the x and y coordinates of each of the 6 airports. Supplying the x and y coordinates in two arrays allows all 6 constraints to be entered as a constraint block.  See 'constraints' section below. In this example, the array dimensions are explicitly set using the dimensions property.",
+    "dx": {
+      "dimensions": [ 6 ],
+      "value": [ 1, 0.5, 2, 2, 2, 0.5 ]
+    },
+    "dy": {
+      "dimensions": [ 6 ],
+      "value": [ 4, 3, 4, 2, 5, 6 ]
+    }
+  },
+  "constraints": {
+    "comment": "The only difference for this section compared with AirlineHub2Example, is that in this example, the finalValue keyword is present which means that the final value of each constraint will be returned in the results.",
+    "c": {
+      "dimensions": [ 6 ],
+      "formula": "sqrt((x - dx)^2 + (y - dy)^2) - z",
+      "upper": 0,
+      "finalValue": []
+    }
+  },
+  "objective": {
+    "comment": "Minimize the artificial variable z.  This minimization 'squashes' all six of the distance formulas.  The resulting (x,y) coordinate will be the coordinate that minimizes the distance between the hub and all six airports. This section remains unchanged from the previous example, AirlineHub2Example.",
+    "obj": {
+      "formula": "z",
+      "type": "minimize",
+      "finalValue": []
+    }
+  }
 }