Science Fair Project Encyclopedia
Discrete optimization
Discrete optimization is a branch of optimization in applied mathematics and computer science.
As opposed to continuous optimization, the variables used in the objective function (or some of them) are restricted to assume only discrete values, such as the integers.
Problems of combinatorial optimization can be formulated in terms of discrete optimization, however methods of their solution are often different.
10-26-2009 08:16:03
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details