You get a bonus - 1 coin for daily activity. Now you have 1 coin

Discrete programming

Lecture



Discrete programming (discrete optimization) is a section of mathematical programming.

In contrast to optimization problems with continuous variables, variables in discrete programming problems take only discrete values, for example, integer values.

The tasks of combinatorial optimization can be solved using discrete programming methods. One of the main methods for solving discrete programming problems is the branch and bound method and dynamic programming.

created: 2014-08-21
updated: 2021-03-13
132571



Rating 9 of 10. count vote: 2
Are you satisfied?:



Comments


To leave a comment
If you have any suggestion, idea, thanks or comment, feel free to write. We really value feedback and are glad to hear your opinion.
To reply

Math programming

Terms: Math programming