How do continuous optimization problems differ from combinatorial optimization problems?

In the field of optimization, problems are categorized based on the nature of their variables and the structure of their constraints. The primary difference between continuous and combinatorial optimization lies in the domain of the variables being manipulated.1

Continuous Optimization

Continuous optimization problems involve variables that are real numbers. These problems often utilize techniques from linear programming or nonlinear programming, where the objective function or constraints may involve continuous mathematical functions. Because the variables can take any value within a continuous range, these problems are typically solved using methods from numerical analysis and calculus.1

Combinatorial Optimization

In contrast, combinatorial optimization deals with problems where the variables are discrete. The solution must be selected from a finite, though often extremely large, set of possibilities—such as determining the optimal route for a vehicle or assigning resources to specific locations. These problems are deeply rooted in combinatorics, focusing on the selection and arrangement of items within discrete systems.12