@frontlinesystems/rason-mcp-server 2026.5.0

package/examples/Optimization/Linear/Inventory.json

@@ -0,0 +1,200 @@
+{
+  "modelName": "inventoryExample",
+  "modelDescription": "RASON Inventory Planning Optimization Example: Example of non-smooth transformation. You are tasked with minimizing the inventory ordering and holding costs while ensuring there is enough inventory on hand to meet demand over a number of time periods, as well as with maintaining minimum inventory levels for each product. This inventory planning model was originally designed for linear programming, but to properly minimize holding costs, the objective was formulated using IF functions. When the modelSettings property 'transformNonSmooth' is set to True, RASON Decision Services will automatically transform this difficult, hard to solve nonsmooth model into a simple linear mixed integer model.",
+  "modelType": "optimization",
+  "modelSettings": {
+    "comment": "When 'transformNonSmooth' is set to True, RASON Decision Services will attempt to transform nonsmooth functions such as IF, MAX and ABS into equivalent linear formulations. A transformation will only be performed if the model is diagnosed as nonsmooth and a transformation results in a linear model.  Otherwise, the model will be solved 'as is'. ",
+    "transformNonSmooth": true
+  },
+  "variables": {
+    "comment": "9 variables are created in this section representing the amount of products to order. The x variables apply to Product 1, y variables to Product 2 and z variables to Product 3. All variables are integers with upper bound=500 and lower bound=0. ",
+    "x1": {
+      "comment": "Represents the amount of Product 1 to purchase in Period 1. ",
+      "type": "int",
+      "lower": 0,
+      "upper": 500
+    },
+    "y1": {
+      "comment": "Represents the amount of Product 2 to purchase in Period 1. ",
+      "type": "int",
+      "lower": 0,
+      "upper": 500
+    },
+    "z1": {
+      "comment": "Represents the amount of Product 3 to purchase in Period 1.",
+      "type": "int",
+      "lower": 0,
+      "upper": 500
+    },
+    "x2": {
+      "comment": "Represents the amount of Product 1 to purchase in Period 2.",
+      "type": "int",
+      "lower": 0,
+      "upper": 500
+    },
+    "y2": {
+      "comment": "Represents the amount of Product 2 to purchase in Period 2.",
+      "type": "int",
+      "lower": 0,
+      "upper": 500
+    },
+    "z2": {
+      "comment": "Represents the amount of Product 3 to purchase in Period 2.",
+      "type": "int",
+      "lower": 0,
+      "upper": 500
+    },
+    "x3": {
+      "comment": "Represents the amount of Product 1 to purchase in Period 3.",
+      "type": "int",
+      "lower": 0,
+      "upper": 500
+    },
+    "y3": {
+      "comment": "Represents the amount of Product 2 to purchase in Period 3.",
+      "type": "int",
+      "lower": 0,
+      "upper": 500
+    },
+    "z3": {
+      "comment": "Represents the amount of Product 3 to purchase in Period 3.",
+      "type": "int",
+      "lower": 0,
+      "upper": 500
+    }
+  },
+  "formulas": {
+    "comment": "Formulas calculating Inventory.  Initial Inventory for all products in period 1 is 0. Calculate inventory using the following formula:  Initial inventory + production in period 1 - demand in period 1 + production in period 2 - demand in period 2 + production in period 3 - demand in period 3.",
+    "ix1": {
+      "comment": "Inventory for product 1 after period 1.  0 = no demand for product 1 in period 1.",
+      "formula": "x1-0"
+    },
+    "iy1": {
+      "comment": "Inventory for product 2 after period 1.  50 = demand for product 2 in period 1.",
+      "formula": "y1-50"
+    },
+    "iz1": {
+      "comment": "Inventory for product 3 after period 1.  0 = no demand for product 3 in period 1.",
+      "formula": "z1-0"
+    },
+    "ix2": {
+      "comment": "Inventory for product 1 after period 2.  20 = demand for product 1 in period 2.",
+      "formula": "ix1+x2-20"
+    },
+    "iy2": {
+      "comment": "Inventory for product 2 after period 2.  0 = no demand for product 2 in period 2.",
+      "formula": "iy1+y2-0"
+    },
+    "iz2": {
+      "comment": "Inventory for product 1 after period 2.  100 = demand for product 3 in period 2.",
+      "formula": "iz1+z2-100"
+    },
+    "ix3": {
+      "comment": "Inventory for product 1 after period 3.  0 = no demand for product 1 in period 3.",
+      "formula": "ix2+x3-0"
+    },
+    "iy3": {
+      "comment": "Inventory for product 2 after period 3.  50 = demand for product 2 in period 3.",
+      "formula": "iy2+y3-50"
+    },
+    "iz3": {
+      "comment": "Inventory for product 3 after period 3.  0 = no demand for product 3 in period 3.",
+      "formula": "iz2+z3-0"
+    },
+    "hold1": {
+      "comment": "Calculate the holding cost for period 1",
+      "formula": "IF(ix1>0,ix1*10,0)+IF(iy1>0,iy1*10,0)+IF(iz1>0,iz1*10,0)"
+    },
+    "hold2": {
+      "comment": "Calculate the holding cost for period 2",
+      "formula": "IF(ix2>0,ix2*10,0)+IF(iy2>0,iy2*10,0)+IF(iz2>0,iz2*10,0)"
+    },
+    "hold3": {
+      "comment": "Calculate the holding cost for period 3",
+      "formula": "IF(ix3>0,ix3*10,0)+IF(iy3>0,iy3*10,0)+IF(iz3>0,iz3*10,0)"
+    },
+    "purch1": {
+      "comment": "Calculate the purchasing costs for period 1",
+      "formula": "IF(x1>0,500,0)+IF(y1>0,400,0)+IF(z1>0,300,0)"
+    },
+    "purch2": {
+      "comment": "Calculate the purchasing costs for period 2",
+      "formula": "IF(x2>0,500,0)+IF(y2>0,400,0)+IF(z2>0,300,0)"
+    },
+    "purch3": {
+      "comment": "Calculate the purchasing costs for period 3",
+      "formula": "IF(x3>0,500,0)+IF(y3>0,400,0)+IF(z3>0,300,0)"
+    }
+  },
+  "constraints": {
+    "comment": "Ending inventory constraints (9) + Total product purchased constraints (3). Lower bound indicates the minimum inventory amount that must be on hand for each product at the end of each period.",
+    "c1": {
+      "comment": "Ending inventory for product 1 in period 1.",
+      "formula": "ix1",
+      "lower": 0
+    },
+    "c2": {
+      "comment": "Ending inventory for product 2 in period 1.",
+      "formula": "iy1",
+      "lower": 20
+    },
+    "c3": {
+      "comment": "Ending inventory for product 3 in period 1.",
+      "formula": "iz1",
+      "lower": 0
+    },
+    "c4": {
+      "comment": "Ending inventory for product 1 in period 2.",
+      "formula": "ix2",
+      "lower": 0
+    },
+    "c5": {
+      "comment": "Ending inventory for product 2 in period 2.",
+      "formula": "iy2",
+      "lower": 20
+    },
+    "c6": {
+      "comment": "Ending inventory for product 3 in period 2.",
+      "formula": "iz2",
+      "lower": 0
+    },
+    "c7": {
+      "comment": "Ending inventory for product 1 in period 3.",
+      "formula": "ix3",
+      "lower": 50
+    },
+    "c8": {
+      "comment": "Ending inventory for product 2 in period 3.",
+      "formula": "iy3",
+      "lower": 20
+    },
+    "c9": {
+      "comment": "Ending inventory for product 3 in period 3.",
+      "formula": "iz3",
+      "lower": 100
+    },
+    "c10": {
+      "comment": "Maximum purchased products in period 1 must not exceed 150.",
+      "formula": "x1 + y1 + z1",
+      "upper": 150
+    },
+    "c11": {
+      "comment": "Maximum purchased products in period 2 must not exceed 150.",
+      "formula": "x2 + y2 + z2",
+      "upper": 150
+    },
+    "c12": {
+      "comment": "Maximum purchased products in period 3 must not exceed 150.",
+      "formula": "x3 + y3 + z3",
+      "upper": 150
+    }
+  },
+  "objective": {
+    "obj": {
+      "comment": "The objective function minimizes the total holding costs + the total purchasing costs.",
+      "type": "minimize",
+      "finalValue": [],
+      "formula": "hold1+hold2+hold3+purch1+purch2+purch3"
+    }
+  }
+}

package/examples/Optimization/Linear/Matop.json

@@ -0,0 +1,120 @@
+{
+  "modelName": "matopExample",
+  "modelDescription": "RASON example model uses Frontline's MATOP 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",
+  "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 'initial' 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": [ 14, 18 ],
+      "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 'initial', 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": [ 14, 18 ],
+      "value": 0,
+      "lower": 0,
+      "upper": 1,
+      "type": "int",
+      "finalValue": []
+    }
+  },
+  "data": {
+    "comment": "The data section contains constant parameters utilized in the model to generate the constraints and the objective.",
+    "I": {
+      "comment": "Creates an array of size 14, all values are set to the value of 1.",
+      "dimensions": [ 14 ],
+      "value": 1
+    },
+    "J": {
+      "comment": "Creates an array of size 18, all values are set to the value of 1.",
+      "dimensions": [ 18 ],
+      "value": 1
+    },
+    "Demand": {
+      "comment": "Creates an array of size 18 holding the demand. Array dimension inferred by number of values passed for 'value'.",
+      "value": [ 6, 13, 21, 11, 20, 4, 35, 13, 20, 9, 7, 18, 14, 22, 33, 45, 11, 8 ]
+    },
+    "Supply": {
+      "comment": "Creates an array of size 14 holding the supply values. Array dimension inferred by number of values passed for 'value'.",
+      "value": [ 21, 19, 24, 10, 27, 25, 10, 16, 17, 38, 22, 33, 22, 26 ]
+    },
+    "Cost": {
+      "comment": "Creates the Cost matrix  These are the Transportation costs per mile traveled.",
+      "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 the FixedCost matrix.  These are the fixed costs that must be applied if a route is selected.",
+      "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": [ 14, 18 ],
+      "formula": "MATOP(Supply, 'min', '+', transpose(Demand))"
+    }
+  },
+  "constraints": {
+    "comment": "Contains 18 + 14 + 252 = 284 constraints.",
+    "con1": {
+      "comment": "Adds up the continuous variable values by row and sets each formula equal to the appropriate demand value (i.e. x(1,1) + x(1,2) + x(1,3) + ... x(1,18) = 6 where 6 is Demand[1].",
+      "dimensions": [ 18 ],
+      "formula": "transpose(MMULT(transpose(I), x))",
+      "equal": "Demand"
+    },
+    "con2": {
+      "comment": "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(14,1) = 21 where 21 is Supply[1].",
+      "dimensions": [ 14 ],
+      "formula": "MMULT(x, J)",
+      "equal": "Supply"
+    },
+    "fix": {
+      "comment": "Formula applied to each element of the matrix, i.e. xup(1,1) * y(1,1) - x (1,1) >= 0.  This constraint forces the y variable to 1 if the x variable is 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": [ 14, 18 ],
+      "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/Linear/ProductMix.json

@@ -0,0 +1,98 @@
+{
+  "modelName": "productMixExample",
+  "modelDescription": "Product Mix RASON Optimization Example: Recall that the Product Mix example finds the optimal product mix that a company should manufacture in order to maximize gross profit. Assume a company manufactures TVs, stereos and speakers, using a common parts inventory of power supplies, speaker cones, etc. Parts are in limited supply. Determine the most profitable mix of products to produce.  See our Tutorial Online for step-by-step instructions on formulating this linear programming model. This RASON model was converted from a model created in Excel using Analytic Solver.",
+  "modelType": "optimization",
+
+  "variables": {
+    "comment": "The variables are the number of TVs, stereos, and speakers to build. In the original Excel worksheet, they were located in cells D9:F9 where D9 = the number of TVs to be produced, E9 = the number of Stereos to be produced and F9 = the number of Speakers to be produced.",
+    "d9:f9": {
+      "comment": "D9 is the number of TVs to produce, E9 is the number of Stereos to produce and F9 is the number of Speakers to produce. The keyword, lower, sets the lower bound of each variable to 0.  The keyword, value, sets the initial value of the variable to 1. The keyword, finalValue, returns the final value of each variable in the result.",
+      "lower": 0,
+      "value": 1,
+      "finalValue": []
+    }
+  },
+
+  "data": {
+    "comment": "This section contains the data used to formulate the constraints and the objective. D17:F17 contains the profit per unit for each TV, Stereo, and Speaker produced.  The next 5 arrays contain the number of parts required to produce each TV, Stereo and Speaker: D11:F11 - Number of Chassis required, D12:F12 - Number of LCD Screens required, D13:F13 - Number of Speakers required, D14:F14 - Number of Power Supplies required, D15:F15 - Number of Electronics required.",
+    "d17:f17": {
+      "comment": "Profit per unit for each [TV, Stereo, Speaker]",
+      "value": [
+        [ 75, 50, 35 ]
+      ]
+    },
+    "d11:f11": {
+      "comment": "Number of chassis required for each [TV, Stereo, Speaker]",
+      "value": [
+        [ 1, 1, 0 ]
+      ]
+    },
+    "d12:f12": {
+      "comment": "Number of LCD Screens required for each [TV, Stereo, Speaker]",
+      "value": [
+        [ 1, 0, 0 ]
+      ]
+    },
+    "d13:f13": {
+      "comment": "Number of Speakers required for each [TV, Stereo, Speaker]",
+      "value": [
+        [ 2, 2, 1 ]
+      ]
+    },
+    "d14:f14": {
+      "comment": "Number of Power Supplies required for each [TV, Stereo, Speaker]",
+      "value": [
+        [ 1, 1, 0 ]
+      ]
+    },
+    "d15:f15": {
+      "comment": "Number of Electronics required for each [TV, Stereo, Speaker]",
+      "value": [
+        [ 2, 1, 1 ]
+      ]
+    }
+  },
+
+  "constraints": {
+    "comment": "5 Constraints limit the amount of products used, to the amount of parts on hand:  Chassis - 450, Screens - 250, Speakers - 800, Power Supplies - 450 and Electronics - 600.  Notice the use of the Excel sumproduct function to multiply the variables (D9:F9) by the number of parts required to produce each [TV, Stereo, Speaker]. RASON supports the majority of EXCEL functions in the calculation of constraints and the objective. The keywords, lower and upper, set the lower and upper bounds of each constraint, respectively.",
+    "c11": {
+      "Comment": "Limits the number of Chassis to 450 =#TVS * 1 + #Stereos * 1 + #Speakers * 0",
+      "formula": "sumproduct(d9:f9, d11:f11)",
+      "lower": 0,
+      "upper": 450
+    },
+    "c12": {
+      "Comment": "Limits the number of Screens  to 250 =#TVS * 1 + #Stereos * 0 + #Speakers * 0",
+      "formula": "sumproduct(d9:f9, d12:f12)",
+      "lower": 0,
+      "upper": 250
+    },
+    "c13": {
+      "Comment": "Limits the number of Speakers  to 800 =#TVS * 2 + #Stereos * 2 + #Speakers * 1",
+      "formula": "sumproduct(d9:f9, d13:f13)",
+      "lower": 0,
+      "upper": 800
+    },
+    "c14": {
+      "Comment": "Limits the number of Power Supplies  to 450 =#TVS * 1 + #Stereos * 1 + #Speakers * 0",
+      "formula": "sumproduct(d9:f9, d14:f14)",
+      "lower": 0,
+      "upper": 450
+    },
+    "c15": {
+      "comment": "Limits the number of Electronics to 600:  =#TVS * 2 + #Stereos * 1 + #Speakers * 1",
+      "formula": "sumproduct(d9:f9, d15:f15)",
+      "lower": 0,
+      "upper": 600
+    }
+  },
+
+  "objective": {
+    "comment": "Calculates the objective function to be maximized: =#TVS * 75 + #Stereos * 50 + #Speakers * 35.  The keyword, finalValue, returns the final objective value in the result.",
+    "d18": {
+      "type": "maximize",
+      "formula": "sumproduct(d9:f9, d17:f17)",
+      "finalValue": []
+    }
+  }
+}

package/examples/Optimization/Linear/ProductMix2.json

@@ -0,0 +1,73 @@
+{
+  "modelName": "productMix2Example",
+  "modelDescription": "Product Mix RASON Optimization Example 2: Recall that the Product Mix example finds the optimal product mix that a company should manufacture in order to maximize gross profit. In this version of the Product Mix model, the data section now contains 2 arrays, rather than 6:  D17:F17 - the profit per unit of each [TV, Stereo, Speaker] produced and D11:F15, a double array, - the number of each product required to produce each [TV, Stereo, Speaker]. In the first example, 6 separate arrays were used to supply the constraint coefficient values, or the number of parts required to produce each product. In this example, all values are passed in 1 array. The variables, constraints and objective sections all remain unchanged.",
+  "modelType": "optimization",
+  "variables": {
+    "comment": "The variables are the number of [TVs, Stereos, Speakers] to build. This section remains unchanged from the original Product Mix Example.",
+    "d9:f9": {
+      "comment": "D9 is the number of TVS to produce, E9 is the number of Stereos to produce and F9 is the number of Speakers to produce.",
+      "lower": 0,
+      "value": 0,
+      "finalValue": []
+    }
+  },
+  "data": {
+    "comment": "D17:F17 contain the coefficient values (profit per unit produced) for each [TV, Stereo, Speaker].",
+    "d17:f17": {
+      "value": [
+        [ 75, 50, 35 ]
+      ]
+    },
+    "d11:f15": {
+      "comment": "D11:F15 contains all constraint coefficient values, or the number of parts required to produce each [TV, Stereo, Speaker]. The first row of the array passes the number of chassis required to produce each product, the 2nd, the number of Screens, the 3rd, the number of Speakers, the 4th, the number of Power Supply kits and lastly, the number of Electronic kits required to produce each product.",
+      "value": [
+        [ 1, 1, 0 ],
+        [ 1, 0, 0 ],
+        [ 2, 2, 1 ],
+        [ 1, 1, 0 ],
+        [ 2, 1, 1 ]
+      ]
+    }
+  },
+  "constraints": {
+    "comment": "Five constraints limit the number of parts used to the number of parts in inventory:  C11 - Number of chassis used <= 450, C12 - Number of screens used <= 250, C13 = Number of Speakers used <= 800, C14 = Number of Power Supply kits used <= 450 and C15 = Number of Electronic kits used <= 600. The Excel sumproduct function is used to multiply the variables by the amount of products required to produce each product. This section remains unchanged.",
+    "c11": {
+      "comment": "Limits the number of Chassis to 450 =#TVS * 1 + #Stereos * 1 + #Speakers * 0",
+      "formula": "sumproduct(d9:f9, d11:f11)",
+      "lower": 0,
+      "upper": 450
+    },
+    "c12": {
+      "comment": "Limits the number of Screens  to 250 =#TVS * 1 + #Stereos * 0 + #Speakers * 0",
+      "formula": "sumproduct(d9:f9, d12:f12)",
+      "lower": 0,
+      "upper": 250
+    },
+    "c13": {
+      "comment": "Limits the number of Speakers  to 800 =#TVS * 2 + #Stereos * 2 + #Speakers * 1",
+      "formula": "sumproduct(d9:f9, d13:f13)",
+      "lower": 0,
+      "upper": 800
+    },
+    "c14": {
+      "comment": "Limits the number of Power Supplies  to 450 =#TVS * 1 + #Stereos * 1 + #Speakers * 0",
+      "formula": "sumproduct(d9:f9, d14:f14)",
+      "lower": 0,
+      "upper": 450
+    },
+    "c15": {
+      "comment": "Limits the number of Electronics to 600:  =#TVS * 2 + #Stereos * 1 + #Speakers * 1",
+      "formula": "sumproduct(d9:f9, d15:f15)",
+      "lower": 0,
+      "upper": 600
+    }
+  },
+  "objective": {
+    "comment": "Calculates the objective function to be maximized: =#TVS * 75 + #Stereos * 50 + #Speakers * 35. This section remains unchanged.",
+    "d18": {
+      "type": "maximize",
+      "formula": "sumproduct(d9:f9, d17:f17)",
+      "finalValue": []
+    }
+  }
+}

package/examples/Optimization/Linear/ProductMix3.json

@@ -0,0 +1,50 @@
+{
+  "modelName": "productMix3Example",
+  "modelDescription": "Product Mix RASON Optimization Example 3: Recall that the Product Mix example finds the optimal product mix that a company should manufacture in order to maximize gross profit. In this version of the Product Mix model, sensitivity information is returned in the result.  This information lets the user know which constraints are binding or non binding. If a constraint is binding, the left hand side of the constraint is equal to its upper or lower bound or both, in the case of an equality. This means that in order to improve the objective, the constraint(s) must be relaxed or moved away from the upper or lower bound. The Dual Value, or Shadow Price, is the change in the objective value of the optimal solution when the constraint is relaxed by one unit within the allowable increase or decrease.",
+  "modelType": "optimization",
+  "variables": {
+    "comment": "If the dualValue keyword is present, the variable's dual values will be returned.  The variable dual values in the result will be 0 for TVs, 0 for Stereos and -2.5 for Speakers. The reduced cost of -2.5 for Speakers (F9), indicates that, if forced to produce some Speakers, the objective (Total Profit) would decrease by $2.50 for each Speaker made.  This is because the production of an alternate more profitable product would be decreased to make way for Speaker production.",
+    "d9:f9": {
+      "lower": 0,
+      "value": 0,
+      "finalValue": [],
+      "dualValue": []
+    }
+  },
+  "data": {
+    "d17:f17": {
+      "comment": "D17:F17 contain the coefficient values (profit per unit produced) for each [TV, Stereo, Speaker].",
+      "value": [
+        [ 75, 50, 35 ]
+      ]
+    },
+    "d11:f15": {
+      "comment": "D11:F15 contains all constraint coefficient values, or the number of parts required to produce each [TV, Stereo, Speaker]. The first row of the array passes the number of chassis required to produce each product, the 2nd, the number of Screens, the 3rd, the number of Speakers, the 4th, the number of Power Supply kits and lastly, the number of Electronic kits required to produce each product.",
+      "value": [
+        [ 1, 1, 0 ],
+        [ 1, 0, 0 ],
+        [ 2, 2, 1 ],
+        [ 1, 1, 0 ],
+        [ 2, 1, 1 ]
+      ]
+    }
+  },
+  "constraints": {
+    "comment": "Five constraints are created using the Excel MMULT function, which multiplies matrices. The syntax for the function is: MMULT (array1,array2) where array1 and array2 are the arrays or matrices to be multiplied.  The constraint right hand sides are contained in the upper array.  The resulting constraints are: Chassis -  #Tvs * 1 + #Stereos * 1 + #Speakers * 0 <= 450, Screens - #Tvs * 1 + #Stereos * 0 + #Speakers * 0 <= 250, etc. The constraint dual values will be 0 for 1st, 2nd and 4th constraints, 12.5 for the 3rd constraint (Speakers) and 25 for the last constraint (Electronics). Note that a constraint dual value will only be nonzero if the constraint is equal to it's lower or upper bound.  In the optimal solution, all 800 Speakers and 600 Electronics, but not all of the additional components such as Chassis, LCD Screens or Power Supplies, are used. Since all Speakers and Electronics are used in the final solution, these two constraints have non-zero dual values.  The dual value for Electronics indicates that if we can obtain one more Electronic kit, our objective function value (total profit) will increase by $25.  Similarly, if one more speaker can be obtained in the inventory, the objective final value will increase by $12.50.",
+    "c11:c15": {
+      "formula": "mmult(d11:f15, transpose(d9:f9))",
+      "lower": 0,
+      "upper": [ 450, 250, 800, 450, 600 ],
+      "dualValue": []
+    }
+  },
+  "objective": {
+    "comment": "Calculates the objective function to be maximized: =#TVS * 75 + #Stereos * 50 + #Speakers * 35.  The keyword, initialValue, returns the initial objective value in the result. Since the initial values for all 3 variables are set to 0, the objective's initialValue will also be 0 (=#Tvs * 0, #Stereos * 0 + #Speakers * 0).",
+    "d18": {
+      "type": "maximize",
+      "formula": "sumproduct(d9:f9, d17:f17)",
+      "finalValue": [],
+      "initialValue": []
+    }
+  }
+}

package/examples/Optimization/Linear/ProductMix4.json

@@ -0,0 +1,57 @@
+{
+  "modelName": "productMix4Example",
+  "modelDescription": "Product Mix RASON Optimization Example 4:  This version of the Product Mix example replaces the Excel range array names with improved readable names such as profits, parts, inventory, etc. Recall that the Product Mix example finds the optimal product mix that a company should manufacture in order to maximize gross profit. ",
+  "modelType": "optimization",
+  "variables": {
+    "comment": "The name, D9:F9, has been replaced with the name, x.  The previous name D9:F9 automatically created an array of size 3, since the Excel range contained 3 cells:  D9, E9 and F9.  Since the name is now being replaced with x, the size of the array must be specified.  The dimensions keyword explicitly defines the number of dimensions in the array.  Since there are 3 variables, the variable array must be of size 3.",
+    "x": {
+      "dimensions": [ 3 ],
+      "value": 0,
+      "lower": 0,
+      "finalValue": []
+    }
+  },
+  "data": {
+    "comment": "The name D17:F17 has been replaced with profits and D11:F15 has been replaced with parts.",
+    "profits": {
+      "comment": "This array uses the dimensions property to create an array of size 3.  Previously, the name D17:F17 automatically created an array of size 3 since this Excel range contained 3 cells:  D17, E17, and F17. Note the 'binding' property which serves two functions, one of which is to allow write access to a table or array outside of the RASON model environment. For example, passing 'binding': 'get' to the profits array allows these values to be modified directly through a REST API call, or from within the Query Parameters section on the Editor page. ",
+      "dimensions": [ 3 ],
+      "value": [ 75, 50, 35 ],
+      "binding": "get",
+      "finalValue": []
+    },
+    "parts": {
+      "comment": "This array uses the dimensions property to create a double array of size 5 rows and 3 cols.  Previously, the name D11:F15 automatically created an array of this size since this Excel range contained 15 cells in 5 rows and 3 cols.",
+      "dimensions": [ 5, 3 ],
+      "value": [
+        [ 1, 1, 0 ],
+        [ 1, 0, 0 ],
+        [ 2, 2, 1 ],
+        [ 1, 1, 0 ],
+        [ 2, 1, 1 ]
+      ]
+    },
+    "inventory": {
+      "comment": "This new array contains the constraint right hand sides, or the number of parts in inventory. No dimensions property is required as the size of the array is inferred through the number of individual values passed (5): [Chassis, Screens, Speakers, Power Supply, Electronics]",
+      "value": [ 450, 250, 800, 450, 600 ]
+    }
+  },
+  "constraints": {
+    "comment": "5 constraints are created in this section.",
+    "num_used": {
+      "comment": "The name C11:C15 has been replaced with the name, num_used. The dimensions property is used to set the size of the array to 5. The MMULT Excel function multiplies the parts array by the x array creating 5 constraints. The right hand sides of the constraints are passed in the upper property.",
+      "dimensions": [ 5 ],
+      "formula": "MMULT(parts, x)",
+      "lower": 0,
+      "upper": "inventory"
+    }
+  },
+  "objective": {
+    "comment": "The name D18 has been replaced with total. The sumproduct function multiples two arrays, x and profits, creating the formula: x1 * 75 + x2 * 50 + x3 * 35",
+    "total": {
+      "formula": "sumproduct(x, profits)",
+      "type": "maximize",
+      "finalValue": []
+    }
+  }
+}