Discrete optimization

Updated: 04/26/2017 by Computer Hope

Discrete optimization is a branch of mathematics and computer science which focuses on optimizing mathematical operations. It specifically deals with making the best use of operations so they perform better when presented with a set of discrete values. Values that vary in distinct amount, such as integers, are an example of discrete values.

Computer Science, Programming terms