As noted in the Introduction to Optimization, an important step in the optimization process is classifying your optimization model, since algorithms for solving optimization problems are tailored to a particular type of problem. Here we provide some guidance to help you classify your optimization model; for the various optimization problem types, we provide a linked page with some basic information, links to algorithms and software, and online and print resources.

For an alphabetical listing of all of the linked pages, see Optimization Problem Types: Alphabetical Listing. While it is difficult to provide a taxonomy of optimization, see Optimization Taxonomy for one perspective.

versus**Continuous Optimization****Discrete Optimization**

Some models only make sense if the variables take on values from a discrete set, often a subset of integers, whereas other models contain variables that can take on any real value. Models with discrete variables are*discrete optimization*problems; models with continuous variables are*continuous optimization*problems. Continuous optimization problems tend to be easier to solve than discrete optimization problems; the smoothness of the functions means that the objective function and constraint function values at a point \(x\) can be used to deduce information about points in a neighborhood of \(x\). However, improvements in algorithms coupled with advancements in computing technology have dramatically increased the size and complexity of discrete optimization problems that can be solved efficiently. Continuous optimization algorithms are important in discrete optimization because many discrete optimization algorithms generate a sequence of continuous subproblems.versus**Unconstrained Optimization****Constrained Optimization**

Another important distinction is between problems in which there are*no constraints*on the variables and problems in which there are*constraints*on the variables.*Unconstrained optimization*problems arise directly in many practical applications; they also arise in the reformulation of*constrained*optimization problems in which the constraints are replaced by a penalty term in the objective function.*Constrained optimization*problems arise from applications in which there are explicit constraints on the variables. The constraints on the variables can vary widely from simple bounds to systems of equalities and inequalities that model complex relationships among the variables. Constrained optimization problems can be furthered classified according to the nature of the constraints (e.g., linear, nonlinear, convex) and the smoothness of the functions (e.g., differentiable or nondifferentiable).**None, One or Many Objectives**

Most optimization problems have a single objective function, however, there are interesting cases when optimization problems have no objective function or multiple objective functions.*Feasibility problems*are problems in which the goal is to find values for the variables that satisfy the constraints of a model with no particular objective to optimize.*Complementarity problems*are pervasive in engineering and economics. The goal is to find a solution that satisfies the complementarity conditions.*Multi-objective optimization*problems arise in many fields, such as engineering, economics, and logistics, when optimal decisions need to be taken in the presence of trade-offs between two or more conflicting objectives. For example, developing a new component might involve minimizing weight while maximizing strength or choosing a portfolio might involve maximizing the expected return while minimizing the risk. In practice, problems with multiple objectives often are reformulated as single objective problems by either forming a weighted combination of the different objectives or by replacing some of the objectives by constraints.versus**Deterministic Optimization****Stochastic Optimization**

In*deterministic optimization*, it is assumed that the data for the given problem are known accurately. However, for many actual problems, the data cannot be known accurately for a variety of reasons. The first reason is due to simple measurement error. The second and more fundamental reason is that some data represent information about the future (e. g., product demand or price for a future time period) and simply cannot be known with certainty. In*optimization under uncertainty*, or*stochastic optimization*, the uncertainty is incorporated into the model.*Robust optimization*techniques can be used when the parameters are known only within certain bounds; the goal is to find a solution that is feasible for all data and optimal in some sense. Stochastic programming models take advantage of the fact that probability distributions governing the data are known or can be estimated; the goal is to find some policy that is feasible for all (or almost all) the possible data instances and optimizes the expected performance of the model.