This lecture introduces the backpack problem, a discrete optimization problem with constraints, where the goal is to determine the best way to fill a backpack of maximum capacity with a set of objects of different weights. The problem involves finding a subset of objects that maximizes a given function while respecting the weight constraint. The instructor explains the complexity of the problem, its relation to the class NP, and presents algorithms to solve it.