Content deleted Content added
→Continuous optimization problem: clarification |
combinatorial optimization is a sub branch of discrete optimization. Albeit a large one. The WP article claims it is limited to finite feasible sets. |
||
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 [[
==Continuous optimization problem==
| |||