What is the difference between discrete problem and continuous problem In terms of Optimization Techniques?

Answer 1

In optimization, a discrete problem involves variables that can take on distinct, separate values, often represented as integers, such as scheduling or routing problems. In contrast, a continuous problem allows variables to take on any value within a given range, often represented by real numbers, such as minimizing a function over a continuous domain. Consequently, the optimization techniques differ; discrete problems typically use methods like integer programming or combinatorial optimization, while continuous problems often employ techniques like gradient descent or linear programming.