Optimization problem: Difference between revisions

Revision as of 20:36, 31 January 2016

Revision as of 21:03, 26 March 2016

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 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 from a finite (or possibly countable infinite) set. Problems with continuous variables include constrained problems and multimodal problems.

Line 76 ⟶ 78:

==See also==

*[[Mathematical optimization]]

*[[Semi-infinite programming]]

*[[Decision problem]]