Constraints and feasibility

Understand

Penalties discourage broken constraints. A formulation must encode every required condition and use its validated penalty policy. Arbitrarily weakening a penalty can favor an invalid assignment.

Separate instance feasibility, the validity of a decoded sample, and whether auxiliary bits satisfy the encoding. For example, a Set Cover selection can cover every element while its slack bits are inconsistent.

An exact infeasibility result for these tiny reference instances differs from failing to sample a feasible answer. For larger compiled models, a successful compilation is not a feasibility proof.

Visualize

The status comes from native fixture verification. Recorded assignment details expose both domain feasibility and encoding constraint checks when available.

Experiment

Compare the feasible coloring path with the infeasible two-color triangle. Inspect the scheduling examples and the Set Cover candidate details. Do not infer feasibility from the height of an energy bar.

Return to the example controls