The Branch$-$and$-$Bound algorithm is mainly used to solve combinatorial optimization problems. Provide a trait that an optimization problem possesses.

An optimization problem seeks to eliminate all constrains that are insignificant in the objective function

An optimal solution is computed using the lower limit values of the different constraint variables substituted into the objective function

A feasible solution is an option that uses the best option among the many constraints

An optimization problem seeks to maximize or minimize some objective function subject to some set of constraints