1 | Num Variables: Specify how many variables you have in your design that you would like to optimize. Currently, you can optimize up to 20 variables using this tool. | ||||||||||||
2 | Initial Values:
The optimization algorithm needs to start the optimization at some initial values. You will need to specify the initial or starting values. The following options are available:
| ||||||||||||
3 | Name: Specify the name for each variable. The default names are x1, x2, x3, etc. You can give any name you wish, subject to the following constraints. The names for each variable have to be unique across all variables. They should not contain spaces or special characters. Note that names may not be case-sensitive. | ||||||||||||
4 | Type:
Specify the type of variable. The following options are available:
| ||||||||||||
5 | Minimum: Specify a minimum value for the variable. The algorithm will only look for values above this number. Hence, this is also sort of like a constraint on your variable. Pick a large negative number if you do not have a minimum limit. | ||||||||||||
6 | Initial: Specify an initial value for your variable. It is recommended that the initial value you specify be a feasible data point - that is, it should satisfy all the constraints. You could either randomly pick this initial value or maybe pick it right in between the minimum and maximum values. | ||||||||||||
7 | Maximum: Specify a maximum value for the variable. The algorithm will only look for values less than this number. Hence, the maximum value also acts as a constraint for your optimization problem. Pick a large positive number if you don't have a maximum value. | ||||||||||||
8 | Help Button: Click on this button to open the help file for this topic. | ||||||||||||
9 | Cancel Button: Click on this button to cancel all changes to the settings and exit this dialog box. | ||||||||||||
10 | OK Button: Click on this button to save all changes and compute the outputs for this analysis. |
1 | Num Objectives: Specify the number of objective functions you want to optimize. You can optimize up to 10 objective functions at the same time. | ||||||||
2 | Method:
If you have multiple objective functions, the software will automatically combine the different objective functions into a master objective function depending on the relative weights specified for the objective functions. The following options are available:
| ||||||||
3 | Name: Specify a name for the objective function. Make sure that the specified name is unique across all objective function names. The default names are y1, y2, y3 etc. | ||||||||
4 | Type:
Specify the type of objective function. The available options are:
| ||||||||
5 | Weight: Specify the weight for the objective functions. These weights are used if you have multiple objective functions to combine them into a single objective function. Note that the weights can take any real number. The larger the weight, the more important that specific objective function is. The default value of the weights is 1, which means all objectives have the same importance. | ||||||||
6a | Lower: Specify the lower value for a given objective function. You do not need to enter this value if your method is Additive. This value can only be entered for the desirability method to maximize or achieve a specific target value. | ||||||||
6b | Target: Specify the target value for a given objective function. This value is required if you specify either the desirability method or the additive method, and the object is to achieve a target value. | ||||||||
6c | Upper: Specify the upper value for a given objective function. You do not need to enter this value if your method is Additive. This value can only be entered for the desirability method for either minimization or achieving a specific target value. | ||||||||
7 | Equation: Define the equation for computing the objectives. This should use a valid equation using the variables in the variables tab. An example of an equation is y1 = x1 * x2 ^ 3 + (x4 - 5)^2. You can use any standard mathematical function to define the objective function. You can copy and paste the transfer function from other analyses such as DOE, Regression, etc. Note that you can also import the models. |
1 | Num Constraints: Specify the number of constraints for your optimization problem. You can optimize up to 20 constraints for your optimization problem. If a solution is feasible, it should satisfy all these constraints at the same time. |
2 | Method: Specify the number of methods for defining the constraints. Currently, the only option available is to use inequalities (<=, =, >=) to define the constraints. |
3 | LHS: Specify the constraint's left-hand side (LHS). You should use the same variable names as specified earlier to define the constraint equation. Note that you do not need to re-specify the constraints for the minimum and maximum values defined for each variable in the first tab. |
4 | Relationship: Specify the type of relationship for the constraint. Is it less than, equal to or greater than type of relationship? |
5 | RHS: Specify the Right Hand Side (RHS) of the constraint. It would be best to use the same variable names as specified earlier to define the constraint equation, or the RHS value could be a constant. |
1 | Method: Specify the method for solving the optimization. The default option is Generalized Reduced Gradient (GRG) Nonlinear, which can be used to solve non-linear optimization problems. The solver looks at the gradient of the objective function as the input variables change and determines that it has reached the optimum solution when the partial derivatives are equal to zero. This method is usually fast, but the limitation could be that it may not reach the global minimum. The objective functions should be relatively smooth when using GRG nonlinear optimization. You can choose the Simplex LP optimization if all the objective functions and constraints are linear. This method will always result in a globally optimal solution. However, this can only be used in limited cases when all the variables' objectives and constraints are linear functions. The evolutionary algorithm is more robust than GRG nonlinear and may reach the global optimum, but it is prolonged. It uses the theory of natural selection, random starts, and mutations to perturb the solution, looking for a global minimum. |
2 | Precision: Specify the degree of precision you want for the optimization. This value checks if your constraint is satisfied with this amount. The smaller the number, the higher the precision. |
3 | Scaling: If you specify autoscaling, then the solver will internally rescale the values of the variables, constraints, and the objective to similar magnitudes to reduce the impact of extremely large or small values on the accuracy of the solution process. |
4 | Convergence: Specify the convergence tolerance for the nonlinear algorithms. If the solution does not vary more than this amount when the inputs are changed, the solution is assumed to have converged. |
5 | Derivatives: Specify the algorithm you would like to use to calculate the derivates. Use either the forward difference method or the central difference method. The central difference method requires more computations and should only be used if you are having trouble converging to a solution using the default forward difference method. |
6 | Mutation Rate: The mutation rate is between 0 and 1; it is the relative frequency with which some population members will be altered to create a new trial solution. A higher mutation rate increases the diversity of the population and the chance that a new or better solution will be found, but this may increase the total solution time. |
7 | Population Size: In the Population Size box, type the number of different starting points (values for the decision variables) you want the multi-start method to consider. The minimum population size is 10; if you supply a value less than 10 in this box or leave it blank, the multi-start method uses a population size of 10 times the number of decision variables but no more than 200. |
8 | Random Seed: The random seed is a positive integer number to be used as the (fixed) seed for the random number generator used for various random choices in the Evolutionary method. If you enter a number here, the Evolutionary method will use the same choices each time you click Solve. If you leave this box blank, the random number generator will use a different seed each time you click Solve, which may yield a different (better or worse) final solution. |
9 | Muti Start: Select the multi-start option to use the multi-start method for global optimization. If this box is selected when you click Solve, the GRG Nonlinear method will be run repeatedly, starting from different (automatically chosen) starting values for the decision variables. This process may find a better solution, but it will take more computing time than a single run of the GRG Nonlinear method. |
10 | Require Bounds: Select the Require Bounds to specify that the multi-start method should run only if you have defined lower and upper bounds on all decision variables in the Constraints list box. The multi-start method is far more effective if you define bounds on all variables; the tighter the bounds on the variables you can specify, the better the multi-start method is likely to perform. |
11 | Max Time: Specify the number of seconds the optimization algorithm can run to find a solution. The larger the maximum time, the more likely it is to find an optimal solution. |
12 | Max Iterations: Specify the maximum number of iterations the optimization algorithm can run to look for a solution. The larger the number of iterations, the more likely it is to find a solution, but the longer it will take to optimize. |
1 | Item: The left-hand side shows the major tabs and the items checked within each section |
2 | Status: The right-hand side shows the status of the checks. |
3 | Overall Status: The overall status of all the checks for the given analysis is shown here. The overall status check shows a green thumps-up sign if everything is okay and a red thumps-down sign if any checks have not passed. Note that you cannot proceed with generating analysis results for some analyses if the overall status is not okay. |
1 | Available Models: This list box lists all the models that can be imported for optimization. If no valid models are found, the model notes section will indicate this, and you will not be able to use this function to import models. You can use the search functionality to limit the display of available models, especially if you have a large number of models in your current workbook. |
2 | Selected Models: Drag and drop the models you want to import into the list box on the right. When you click the OK button, all the models you select will be imported into the Optimize worksheet. |
3 | Model Notes: When you click the OK button, any messages received are displayed in the Model Notes section. |
4 | Cancel Button: Click on this button to close this dialog box and cancel the process of importing models from other worksheets in the current workbook. You can manually create the variables and model equations directly through the Analysis Setup dialog box. |
5 | OK Button: Click this button to import the selected models into the current Optimize worksheet. The software will try to read the existing variables and models in these worksheets and try to import them into the current Optimize worksheet. Note that any existing data in your current workbook will be overwritten during the import process. Once the import process is complete, the software will display the Analysis Setup dialog box so that you can further refine your imported models. |
Status | Description |
---|---|
0 | Solver found a solution. All constraints and optimality conditions are satisfied. |
1 | Solver has converged to the current solution (may not be optimal). All constraints are satisfied. |
2 | Solver cannot improve the current solution. All constraints are satisfied. |
3 | Stop chosen when the maximum iteration limit was reached. |
4 | The Objective Cell values do not converge. |
5 | Solver could not find a feasible solution. |
6 | Solver stopped at user's request. |
7 | The linearity conditions required by this LP Solver are not satisfied. |
8 | The problem is too large for Solver to handle. |
9 | Solver encountered an error value in a target or constraint cell. |
10 | Stop chosen when the maximum time limit was reached. |
11 | There is not enough memory available to solve the problem. |
12 | Cannot solve the model since another program is using Solver.dll. |
13 | Error in model. Please verify that all cells and constraints are valid. |
14 | Solver found an integer solution within tolerance. All constraints are satisfied. |
15 | Stop chosen when the maximum number of feasible [integer] solutions was reached. |
16 | Stop chosen when the maximum number of feasible [integer] subproblems was reached. |
17 | Solver converged in probability to a global solution. |
18 | All variables must have both upper and lower bounds. |
19 | Variable bounds conflict in binary or all different constraint. |
20 | Lower and upper bounds on variables allow no feasible solution. |
© Rapid Sigma Solutions LLP. All rights reserved.
We use cookies to enhance your browsing experience and serve you personalized content. By clicking "Accept All", you consent to your use of cookies.