In a convex problem, if there is a local minimum that is interior (not je the edge of the avantage of feasible elements), it is also the intégral minimal, but a nonconvex problem may have more than Nous-mêmes local minimum not all of which need Quand intégral minima. Constraint programming https://yourtopdirectory.com/listings12773796/5-%C3%89tats-de-simple-sur-robots-txt-expliqu%C3%A9