Discrete optimization

Discrete optimization is a branch of optimization in applied mathematics and computer science. As opposed to continuous optimization, some or all of the variables used in a discrete optimization problem are restricted to be discrete variables—that is, to assume only a discrete set of values, such as the integers.[1]

  1. ^ Lee, Jon (2004), A First Course in Combinatorial Optimization, Cambridge Texts in Applied Mathematics, vol. 36, Cambridge University Press, p. 1, ISBN 9780521010122.

© MMXXIII Rich X Search. We shall prevail. All rights reserved. Rich X Search