If your objective and constraints are smooth nonlinear functions of the decision variables, solution times will be longer.The Simplex LP Solving method is designed for these problems. This is a linear programming problem it is also a convex optimization problem (since all linear functions are convex). If your objective and constraints are linear functions of the decision variables, you can be confident of finding a globally optimal solution reasonably quickly, given the size of your model.The mathematical relationships, which are determined by the formulas in your model, may be harder to assess, but they often have a decisive impact on solution time and quality – as further explained starting with this topic. Your model’s total size and the use of integer constraints are both relatively easy to assess when you examine your model. Although faster algorithms and faster processors can help, some non-convex or non-smooth models could take years or decades to solve to optimality on the fastest imaginable computers. Other issues, such as poor scaling, can also affect solution time and quality, but the above characteristics affect the intrinsic solvability of your model. The use of integer constraints on variables in your model.linear or nonlinear) between the objective and constraints and the decision variables
Your model size (number of decision variables and constraints, total number of formulas).The kind of solution you can expect, and how much computing time may be needed to find a solution, depends primarily on three characteristics of your model: Solver’s basic purpose is to find a solution – that is, values for the decision variables in your model – that satisfies all of the constraints and maximizes or minimizes the objective cell value (if there is one).