KnowraInteger programmingLinked fromLinked fromThe 22 pages that link to Integer programming, each with the reason it gives.All 22Broader topic 3Related 13Narrower topic 1Compared with 5Linear programmingCompared with: Discrete decisions violate the continuous-variable assumption of ordinary linear programming.Convex optimizationCompared with: Discrete constraints generally destroy convexity and tractability.Boolean satisfiability problemCompared with: SAT uses Boolean constraints, while integer programming expresses discrete choices through arithmetic constraints.Linear programming dualityCompared with: Its linear relaxation has a dual, but integrality can create a gap between primal and dual optima.Shadow priceCompared with: Discrete decisions can make value changes jump discontinuously, so ordinary marginal prices may not exist.