Since there are large differences in the time it takes to find a solution and the kinds of solutions – globally optimal, locally optimal, or simply “good” – that you can expect for different types of problems, it pays to understand the differences between ...
A nonlinear function is any function of the variables that is not linear, i.e. which cannot be written in the algebraic form: a 1 x 1 + a 2 x 2 +... + a n x n Examples are =1/C1, =LOG(C1), and =C1^2, where C1 is a decision variable. All of these are call ...
If you are using the Evolutionary Solving method, this message appears when (i) Solver has explored the number of subproblems allowed by the Maximum Subproblems option in the Solver Options dialog and (ii) you clicked the Stop button when Solver displayed ...
If you are using the GRG Nonlinear Solving method and you’ve selected the Use Multistart check box in the Solver Options dialog, this message appears when the multistart method’s Bayesian test has determined that all of the locally optimal solutions have ...
If you are using the Evolutionary Solving method or the multistart methods for global optimization, and you have checked the Require Bounds on Variables check box in the Solver Options dialog (it is checked by default), this message appears if you have no ...
This message appears if you have both a binary or alldifferent constraint on a decision variable and a <= or >= constraint on the same variable (that is inconsistent with the binary or alldifferent specification), or if the same decision variable ap ...
This message appears if you’ve defined lower and upper bounds on a decision variable, where the lower bound is greater than the upper bound. This (obviously) means there can be no feasible solution, but (depending on the Solving method) Solver will detec ...
A model in which the objective function and all of the constraints (other than integer constraints) are linear functions of the decision variables is called a linear programming (LP) problem. (The term “programming” dates from the 1940s and the disciplin ...
A model in which the objective cell and all of the constraints (other than integer constraints) are linear functions of the decision variables is called a linear programming (LP) problem. Such problems are intrinsically easier to solve than nonlinear (NL ...
The GRG Nonlinear Solving method, like most nonlinear optimization methods, normally can find only a locally optimal solution to a nonlinear, non-convex problem. Solver includes a multistart method that can improve your prospects of finding a globally op ...