最佳化问题（英语：Optimization problem）在数学与计算机科学领域中，是从所有可行解中寻找最优良的解的问题。根据变量是连续的或离散的，最佳化问题可分为两类：连续最佳化问题与组合优化。

相对于决策问题(Decision problem)、功能性问题(Function problem)，最佳化问题是：从问题的多个解中，求出最佳解。例子：背包问题

In mathematics and computer science, an optimization problem is the problem of finding the best solution from all feasible solutions. Optimization problems can be divided into two categories depending on whether the variables are continuous or discrete. An optimization problem with discrete variables is known as a combinatorial optimization problem. In a combinatorial optimization problem, we are looking for an object such as an integer, permutation or graph from a finite (or possibly countable infinite) set. Problems with continuous variables include constrained problems and multimodal problems.