Lower bound in a partially ordered set
= Lower bound in a partially ordered set
{title2=$\ell\leq s\text{ for every }s\in S$}
= Lower bound
{synonym}
A <lower bound> of a subset $S$ of a <partially ordered set> is an element $\ell$ no greater than every member of $S$. For minimization, a number below every feasible objective value is therefore a <lower bound> on the optimum; a relaxation often provides such a certificate.
// Target: mathematical-optimization.bigb