language-icon Old Web
English
Sign In

Optimization 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 discrete optimization. In a discrete optimization problem, we are looking for an object such as an integer, permutation or graph from a countable set. Problems with continuous variables include constrained problems and multimodal problems. 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 discrete optimization. In a discrete optimization problem, we are looking for an object such as an integer, permutation or graph from a countable set. Problems with continuous variables include constrained problems and multimodal problems. The standard form of a continuous optimization problem is

[ "Algorithm", "Control theory", "Mathematical optimization", "Multi-swarm optimization", "Discrete optimization", "Bilevel optimization", "global optimization problem", "canonical duality theory" ]
Parent Topic
Child Topic
    No Parent Topic