Optimization problem: Difference between revisions

Revision as of 23:33, 26 June 2017

Revision as of 20:27, 22 November 2017

Line 1:

{{Broader|Mathematical optimization}}

In [[mathematics]] and [[computer science]], an '''optimization problem''' is the [[Computational_problem|problem]] of finding the ''best'' solution from all [[feasible solution]]s. Optimization problems can be divided into two categories depending on whether the [[Variable (mathematics)|variables]] are [[continuous variable|continuous]] or [[discrete variable|discrete]]. An optimization problem with [[Discrete mathematics|discrete]] variables is known as a [[Combinatorial Optimization|combinatorial optimization problem]]. In a combinatorial optimization problem, we are looking for an object such as an [[integer]], [[permutation]] or [[Graph (discrete mathematics)|graph]] from a [[Finite set|finite]] (or possibly [[Countable set|countablecountably infinite]]) set. Problems with continuous variables include constrained problems and multimodal problems.

==Continuous optimization problem==